Authors: Guruswami, V Rangan, CP Chang, MS Chang, GJ Wong, CK

Citation: V. Guruswami et al., The K-r-packing problem, COMPUTING, 66(1), 2001, pp. 79-89

Authors: Guruswami, V Rangan, CP

Citation: V. Guruswami et Cp. Rangan, Algorithmic aspects of clique-transversal and clique-independent sets, DISCR APP M, 100(3), 2000, pp. 183-202

Authors: Kumar, DA Rangan, CP

Citation: Da. Kumar et Cp. Rangan, Approximation algorithms for the traveling salesman problem with range condition, RAIRO-INF, 34(3), 2000, pp. 173-181

Authors: Arvind, A Rangan, CP

Citation: A. Arvind et Cp. Rangan, Symmetric Min-Max heap: A simpler data structure for double-ended priorityqueue, INF PROCESS, 69(4), 1999, pp. 197-199

Authors: Kirkpatrick, DG Reddy, KM Rangan, CP Srinivasan, A

Citation: Dg. Kirkpatrick et al., Partial and perfect path covers of cographs, DISCR APP M, 89(1-3), 1998, pp. 143-153

Authors: Guruswami, V Rangan, CP

Citation: V. Guruswami et Cp. Rangan, A natural family of optimization problems with arbitrarily small approximation thresholds, INF PROCESS, 68(5), 1998, pp. 241-248