Subramanian, C. R. Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Subramanian, C. R. (1999). A Generalization of Janson inequalities and its application to finding shortest paths. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99) (pp. 795-804). New York, USA: ACM.