Authors: Salman, FS Cheriyan, J Ravi, R Subramanian, S

Citation: Fs. Salman et al., Approximating the single-sink link-installation problem in network design, SIAM J OPTI, 11(3), 2001, pp. 595-610

Authors: Cheriyan, J Sebo, A Szigeti, Z

Citation: J. Cheriyan et al., Improving on the 1.5-approximation of a smallest 2-edge connected spanningsubgraph, SIAM J DISC, 14(2), 2001, pp. 170-180

Authors: Cheriyan, J Jordan, T Nutov, Z

Citation: J. Cheriyan et al., On rooted node-connectivity problems, ALGORITHMIC, 30(3), 2001, pp. 353-375

Authors: Cheriyan, J Thurimella, R

Citation: J. Cheriyan et R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J COMP, 30(2), 2000, pp. 528-560

Authors: Cheriyan, J Thurimella, R

Citation: J. Cheriyan et R. Thurimella, Fast algorithms for k-shredders and k-node connectivity augmentation, J ALGORITHM, 33(1), 1999, pp. 15-50

Authors: Cheriyan, J Mehlhorn, K

Citation: J. Cheriyan et K. Mehlhorn, An analysis of the highest-level selection rule in the preflow-push max-flow algorithm, INF PROCESS, 69(5), 1999, pp. 239-242