Coloring Random Graphs. - Martin Fürer; C. R. Subramanian 001 (SWAT, 1992)

Coloring Random Graphs in Polynomial Expected Time. - Martin Fürer; C. R. Subramanian 001; C. E. Veni Madhavan (ISAAC, 1993)

Coloring Semi-Random Graphs in Polynomial Expected Time. - C. R. Subramanian 001; C. E. Veni Madhavan (FSTTCS, 1994)

Improved Algorithms for Coloring Random Graphs. - C. R. Subramanian 001 (ISAAC, 1994)

Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. - C. R. Subramanian 001 (FOCS, 1995)

Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). - Claus-Peter Schnorr; C. R. Subramanian 001 (RANDOM, 1998)

Algorithms for coloring semi-random graphs. - C. R. Subramanian 001; Martin Fürer; C. E. Veni Madhavan (Random Struct. Algorithms, 1998)

A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. - C. R. Subramanian 001 (SODA, 1999)

Minimum Coloring k-Colorable Graphs in Polynomial Average Time. - C. R. Subramanian 001 (J. Algorithms, 1999)

Coloring Sparse Random Graphs in Polynominal Average Time. - C. R. Subramanian 001 (ESA, 2000)

Algorithms For Colouring Random K-Colourable Graphs. - C. R. Subramanian 001 (Comb. Probab. Comput., 2000)

Paths of specified length in random k-partite graphs. - C. R. Subramanian 001 (Discret. Math. Theor. Comput. Sci., 2001)

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. - Venkatesh Raman 001; Saket Saurabh 001; C. R. Subramanian 001 (ISAAC, 2002)

General Partitioning on Random Graphs. - C. R. Subramanian 001; C. E. Veni Madhavan (J. Algorithms, 2002)

Isoperimetric Inequalities and the Width Parameters of Graphs. - L. Sunil Chandran; Telikepalli Kavitha; C. R. Subramanian 001 (COCOON, 2003)

Finding Induced Acyclic Subgraphs in Random Digraphs. - C. R. Subramanian 001 (Electron. J. Comb., 2003)

A spectral lower bound for the treewidth of a graph and its consequences. - L. Sunil Chandran; C. R. Subramanian 001 (Inf. Process. Lett., 2003)

Graphs of low chordality. - L. Sunil Chandran; Vadim V. Lozin; C. R. Subramanian 001 (Discret. Math. Theor. Comput. Sci., 2005)

Improved bounds on acyclic edge colouring. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2005)

Faster algorithms for feedback vertex set. - Venkatesh Raman 001; Saket Saurabh 001; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2005)

Girth and treewidth. - L. Sunil Chandran; C. R. Subramanian 001 (J. Comb. Theory B, 2005)

On Sampling Colorings of Bipartite Graphs. - R. Balasubramanian; C. R. Subramanian 001 (Discret. Math. Theor. Comput. Sci., 2006)

Analysis of a heuristic for acyclic edge colouring. - C. R. Subramanian 001 (Inf. Process. Lett., 2006)

Faster fixed parameter tractable algorithms for finding feedback vertex sets. - Venkatesh Raman 001; Saket Saurabh 001; C. R. Subramanian 001 (ACM Trans. Algorithms, 2006)

Acyclic Edge Colouring of Outerplanar Graphs. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (AAIM, 2007)

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (ISAAC, 2007)

List Set Colouring: Bounds and Algorithms. - C. R. Subramanian 001 (Comb. Probab. Comput., 2007)

On the Size of Induced Acyclic Subgraphs in Random Digraphs. - Joel Spencer; C. R. Subramanian 001 (Discret. Math. Theor. Comput. Sci., 2008)

On k-intersection edge colourings. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2009)

Intersection Dimension and Maximum Degree. - N. R. Aravind; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2009)

Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. - Kunal Dutta; C. R. Subramanian 001 (LATIN, 2010)

Optimal acyclic edge colouring of grid like graphs. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (Discret. Math., 2010)

Bounds on Edge Colorings with Restrictions on the Union of Color Classes. - N. R. Aravind; C. R. Subramanian 001 (SIAM J. Discret. Math., 2010)

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (Algorithmica, 2011)

Bounding χ in terms of ω and Δ for some classes of graphs. - N. R. Aravind; T. Karthick; C. R. Subramanian 001 (Discret. Math., 2011)

Oriented colouring of some graph products. - N. R. Aravind; N. Narayanan 001; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2011)

On induced acyclic subgraphs in sparse random digraphs. - Kunal Dutta; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2011)

Dominating set based exact algorithms for 3-coloring. - N. S. Narayanaswamy; C. R. Subramanian 001 (Inf. Process. Lett., 2011)

Bounds on vertex colorings with restrictions on the union of color classes. - N. R. Aravind; C. R. Subramanian 001 (J. Graph Theory, 2011)

New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs. - Kunal Dutta; Dhruv Mubayi; C. R. Subramanian 001 (SIAM J. Discret. Math., 2012)

Star coloring subcubic graphs. - T. Karthick; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2013)

Forbidden subgraph colorings and the oriented chromatic number. - N. R. Aravind; C. R. Subramanian 001 (Eur. J. Comb., 2013)

Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms. - Kunal Dutta; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2014)

Probabilistic Arguments in Graph Coloring (Invited Talk). - C. R. Subramanian 001 (CALDAM, 2015)

Maximum Independent Set on B_1 B 1 -VPG Graphs. - Abhiruk Lahiri; Joydeep Mukherjee; C. R. Subramanian 001 (COCOA, 2015)

Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs. - Kunal Dutta; C. R. Subramanian 001 (SIAM J. Discret. Math., 2016)

Approximating MIS over equilateral B1-VPG graphs. - Abhiruk Lahiri; Joydeep Mukherjee; C. R. Subramanian 001 (CoRR, 2019)

Inductive Graph Invariants and Algorithmic Applications. - C. R. Subramanian 001 (COCOA, 2020)

Intersection dimension and graph invariants. - N. R. Aravind; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2021)

Causal Node Failures and Computation of Giant and Small Components in Networks. - Zuyuan Zhang; Sridhar Radhakrishnan; C. R. Subramanian 001; Kash Barker; Andrés D. González (IEEE Trans. Netw. Sci. Eng., 2021)

High-Speed Packet Classification: A Case for Approximate Sorting. - Aditya Narasimhan; Sridhar Radhakrishnan; Mohammad Atiquzzaman; C. R. Subramanian 001 (GLOBECOM, 2022)

On approximating MIS over B1-VPG graphs*. - Abhiruk Lahiri; Joydeep Mukherjee; C. R. Subramanian 001 (Discret. Math. Algorithms Appl., 2022)

Inductive graph invariants and approximation algorithms . - C. R. Subramanian 001 (Discret. Math. Algorithms Appl., 2022)

On Induced Paths, Holes, and Trees in Random Graphs. - Kunal Dutta; C. R. Subramanian 001 (SIAM J. Discret. Math., 2023)