| 2022 | GLOBECOM | High-Speed Packet Classification: A Case for Approximate Sorting. | Aditya Narasimhan, Sridhar Radhakrishnan, Mohammad Atiquzzaman, C. R. Subramanian |
| 2020 | COCOA | Inductive Graph Invariants and Algorithmic Applications. | C. R. Subramanian |
| 2015 | COCOA | Maximum Independent Set on B_1 B 1 -VPG Graphs. | Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian |
| 2010 | LATIN | Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. | Kunal Dutta, C. R. Subramanian |
| 2009 | IWOCA | Forbidden Subgraph Colorings and the Oriented Chromatic Number. | N. R. Aravind, C. R. Subramanian |
| 2007 | AAIM | Acyclic Edge Colouring of Outerplanar Graphs. | Rahul Muthu, N. Narayanan, C. R. Subramanian |
| 2007 | ISAAC | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
| 2006 | COCOON | Optimal Acyclic Edge Colouring of Grid Like Graphs. | Rahul Muthu, N. Narayanan, C. R. Subramanian |
| 2003 | COCOON | Isoperimetric Inequalities and the Width Parameters of Graphs. | L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian |
| 2002 | ISAAC | Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
| 2000 | ESA | Coloring Sparse Random Graphs in Polynominal Average Time. | C. R. Subramanian |
| 1999 | SODA | A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. | C. R. Subramanian |
| 1995 | FOCS | Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. | C. R. Subramanian |
| 1994 | ISAAC | Improved Algorithms for Coloring Random Graphs. | C. R. Subramanian |
| 1993 | ISAAC | Coloring Random Graphs in Polynomial Expected Time. | Martin Frer, C. R. Subramanian, C. E. Veni Madhavan |