C. R. Subramanian

According to our database, C. R. Subramanian authored at least 54 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

On Induced Paths, Holes, and Trees in Random Graphs.

Kunal Dutta, C. R. Subramanian

SIAM J. Discret. Math., March, 2023

2022

Inductive graph invariants and approximation algorithms .

C. R. Subramanian

Discret. Math. Algorithms Appl., 2022

On approximating MIS over B1-VPG graphs*.

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

Discret. Math. Algorithms Appl., 2022

High-Speed Packet Classification: A Case for Approximate Sorting.

Aditya Narasimhan, Sridhar Radhakrishnan, Mohammad Atiquzzaman, C. R. Subramanian

Proceedings of the IEEE Global Communications Conference, 2022

2021

Causal Node Failures and Computation of Giant and Small Components in Networks.

Zuyuan Zhang, Sridhar Radhakrishnan, C. R. Subramanian, Kash Barker, Andrés D. González

IEEE Trans. Netw. Sci. Eng., 2021

Intersection dimension and graph invariants.

N. R. Aravind, C. R. Subramanian

Discuss. Math. Graph Theory, 2021

2020

Inductive Graph Invariants and Algorithmic Applications.

C. R. Subramanian

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Approximating MIS over equilateral B₁-VPG graphs.

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

CoRR, 2019

2016

Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs.

Kunal Dutta, C. R. Subramanian

SIAM J. Discret. Math., 2016

2015

Maximum Independent Set on B_1 B 1 -VPG Graphs.

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

Proceedings of the Combinatorial Optimization and Applications, 2015

Probabilistic Arguments in Graph Coloring (Invited Talk).

C. R. Subramanian

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms.

Kunal Dutta, C. R. Subramanian

Discuss. Math. Graph Theory, 2014

2013

Forbidden subgraph colorings and the oriented chromatic number.

N. R. Aravind, C. R. Subramanian

Eur. J. Comb., 2013

Star coloring subcubic graphs.

T. Karthick, C. R. Subramanian

Discuss. Math. Graph Theory, 2013

2012

New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.

Kunal Dutta, Dhruv Mubayi, C. R. Subramanian

SIAM J. Discret. Math., 2012

2011

Bounds on vertex colorings with restrictions on the union of color classes.

N. R. Aravind, C. R. Subramanian

J. Graph Theory, 2011

Dominating set based exact algorithms for 3-coloring.

N. S. Narayanaswamy, C. R. Subramanian

Inf. Process. Lett., 2011

On induced acyclic subgraphs in sparse random digraphs.

Kunal Dutta, C. R. Subramanian

Electron. Notes Discret. Math., 2011

Oriented colouring of some graph products.

N. R. Aravind, N. Narayanan, C. R. Subramanian

Discuss. Math. Graph Theory, 2011

Bounding χ in terms of ω and Δ for some classes of graphs.

N. R. Aravind, T. Karthick, C. R. Subramanian

Discret. Math., 2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian

Algorithmica, 2011

2010

Bounds on Edge Colorings with Restrictions on the Union of Color Classes.

N. R. Aravind, C. R. Subramanian

SIAM J. Discret. Math., 2010

Optimal acyclic edge colouring of grid like graphs.

Rahul Muthu, N. Narayanan, C. R. Subramanian

Discret. Math., 2010

Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration.

Kunal Dutta, C. R. Subramanian

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Intersection Dimension and Maximum Degree.

N. R. Aravind, C. R. Subramanian

Electron. Notes Discret. Math., 2009

On <i>k</i>-intersection edge colourings.

Rahul Muthu, N. Narayanan, C. R. Subramanian

Discuss. Math. Graph Theory, 2009

2008

On the Size of Induced Acyclic Subgraphs in Random Digraphs.

Joel Spencer, C. R. Subramanian

Discret. Math. Theor. Comput. Sci., 2008

2007

List Set Colouring: Bounds and Algorithms.

C. R. Subramanian

Comb. Probab. Comput., 2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Acyclic Edge Colouring of Outerplanar Graphs.

Rahul Muthu, N. Narayanan, C. R. Subramanian

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Faster fixed parameter tractable algorithms for finding feedback vertex sets.

Venkatesh Raman, Saket Saurabh, C. R. Subramanian

ACM Trans. Algorithms, 2006

Analysis of a heuristic for acyclic edge colouring.

C. R. Subramanian

Inf. Process. Lett., 2006

On Sampling Colorings of Bipartite Graphs.

R. Balasubramanian, C. R. Subramanian

Discret. Math. Theor. Comput. Sci., 2006

2005

Girth and treewidth.

L. Sunil Chandran, C. R. Subramanian

J. Comb. Theory, Ser. B, 2005

Faster algorithms for feedback vertex set.

Venkatesh Raman, Saket Saurabh, C. R. Subramanian

Electron. Notes Discret. Math., 2005

Improved bounds on acyclic edge colouring.

Rahul Muthu, N. Narayanan, C. R. Subramanian

Electron. Notes Discret. Math., 2005

Graphs of low chordality.

L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian

Discret. Math. Theor. Comput. Sci., 2005

2003

A spectral lower bound for the treewidth of a graph and its consequences.

L. Sunil Chandran, C. R. Subramanian

Inf. Process. Lett., 2003

Finding Induced Acyclic Subgraphs in Random Digraphs.

C. R. Subramanian

Electron. J. Comb., 2003

Isoperimetric Inequalities and the Width Parameters of Graphs.

L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

General Partitioning on Random Graphs.

C. R. Subramanian, C. E. Veni Madhavan

J. Algorithms, 2002

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.

Venkatesh Raman, Saket Saurabh, C. R. Subramanian

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Paths of specified length in random k-partite graphs.

C. R. Subramanian

Discret. Math. Theor. Comput. Sci., 2001

2000

Algorithms For Colouring Random K-Colourable Graphs.

C. R. Subramanian

Comb. Probab. Comput., 2000

Coloring Sparse Random Graphs in Polynominal Average Time.

C. R. Subramanian

Proceedings of the Algorithms, 2000

1999

Minimum Coloring k-Colorable Graphs in Polynomial Average Time.

C. R. Subramanian

J. Algorithms, 1999

A Generalization of Janson Inequalities and its Application to Finding Shortest Paths.

C. R. Subramanian

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Algorithms for coloring semi-random graphs.

C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan

Random Struct. Algorithms, 1998

Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).

Claus-Peter Schnorr, C. R. Subramanian

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1995

Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.

C. R. Subramanian

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Improved Algorithms for Coloring Random Graphs.

C. R. Subramanian

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Coloring Semi-Random Graphs in Polynomial Expected Time.

C. R. Subramanian, C. E. Veni Madhavan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

Coloring Random Graphs in Polynomial Expected Time.

Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Coloring Random Graphs.

Martin Fürer, C. R. Subramanian

Proceedings of the Algorithm Theory, 1992