C. R. Subramanian

60 papers A* 2A 1B 6C 4Misc 2Journal 39Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximation of MWIS on geometric intersection graphs.
Comput. Geom.
C. R. Subramanian
2023 J jnl
On Induced Paths, Holes, and Trees in Random Graphs.
SIAM J. Discret. Math.
Kunal Dutta, C. R. Subramanian
2022 B conf
High-Speed Packet Classification: A Case for Approximate Sorting.
GLOBECOM
Aditya Narasimhan, Sridhar Radhakrishnan, Mohammad Atiquzzaman, C. R. Subramanian
2022 J jnl
Inductive graph invariants and approximation algorithms .
Discret. Math. Algorithms Appl.
C. R. Subramanian
2022 J jnl
On approximating MIS over B1-VPG graphs*.
Discret. Math. Algorithms Appl.
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
2021 — ed.
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings
CALDAM
Apurva Mudgal, C. R. Subramanian
2021 J jnl
Causal Node Failures and Computation of Giant and Small Components in Networks.
IEEE Trans. Netw. Sci. Eng.
Zuyuan Zhang, Sridhar Radhakrishnan, C. R. Subramanian, Kash Barker, Andrés D. González
2021 J jnl
Intersection dimension and graph invariants.
Discuss. Math. Graph Theory
N. R. Aravind, C. R. Subramanian
2020 C conf
Inductive Graph Invariants and Algorithmic Applications.
COCOA
C. R. Subramanian
2019 J jnl
Approximating MIS over equilateral B
CoRR
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
2018 — conf
On Induced Paths, Holes and Trees in Random Graphs.
ANALCO
Kunal Dutta, C. R. Subramanian
2016 J jnl
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs.
SIAM J. Discret. Math.
Kunal Dutta, C. R. Subramanian
2015 C conf
Maximum Independent Set on B_1 B 1 -VPG Graphs.
COCOA
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
2015 — conf
Probabilistic Arguments in Graph Coloring (Invited Talk).
CALDAM
C. R. Subramanian
2014 J jnl
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms.
Discuss. Math. Graph Theory
Kunal Dutta, C. R. Subramanian
2013 J jnl
Forbidden subgraph colorings and the oriented chromatic number.
Eur. J. Comb.
N. R. Aravind, C. R. Subramanian
2013 J jnl
Star coloring subcubic graphs.
Discuss. Math. Graph Theory
T. Karthick, C. R. Subramanian
2012 J jnl
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.
SIAM J. Discret. Math.
Kunal Dutta, Dhruv Mubayi, C. R. Subramanian
2011 J jnl
Bounding χ in terms of ω and Δ for some classes of graphs.
Discret. Math.
N. R. Aravind, T. Karthick, C. R. Subramanian
2011 J jnl
Bounds on vertex colorings with restrictions on the union of color classes.
J. Graph Theory
N. R. Aravind, C. R. Subramanian
2011 J jnl
Dominating set based exact algorithms for 3-coloring.
Inf. Process. Lett.
N. S. Narayanaswamy, C. R. Subramanian
2011 J jnl
On induced acyclic subgraphs in sparse random digraphs.
Electron. Notes Discret. Math.
Kunal Dutta, C. R. Subramanian
2011 J jnl
Oriented colouring of some graph products.
Discuss. Math. Graph Theory
N. R. Aravind, N. Narayanan, C. R. Subramanian
2011 J jnl
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.
Algorithmica
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2010 J jnl
Bounds on Edge Colorings with Restrictions on the Union of Color Classes.
SIAM J. Discret. Math.
N. R. Aravind, C. R. Subramanian
2010 B conf
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration.
LATIN
Kunal Dutta, C. R. Subramanian
2010 J jnl
Optimal acyclic edge colouring of grid like graphs.
Discret. Math.
Rahul Muthu, N. Narayanan, C. R. Subramanian
2009 C conf
Forbidden Subgraph Colorings and the Oriented Chromatic Number.
IWOCA
N. R. Aravind, C. R. Subramanian
2009 J jnl
Intersection Dimension and Maximum Degree.
Electron. Notes Discret. Math.
N. R. Aravind, C. R. Subramanian
2009 J jnl
On
Discuss. Math. Graph Theory
Rahul Muthu, N. Narayanan, C. R. Subramanian
2008 J jnl
On the Size of Induced Acyclic Subgraphs in Random Digraphs.
Discret. Math. Theor. Comput. Sci.
Joel Spencer, C. R. Subramanian
2007 C conf
Acyclic Edge Colouring of Outerplanar Graphs.
AAIM
Rahul Muthu, N. Narayanan, C. R. Subramanian
2007 J jnl
Improved bounds on acyclic edge colouring.
Discret. Math.
Rahul Muthu, N. Narayanan, C. R. Subramanian
2007 J jnl
List Set Colouring: Bounds and Algorithms.
Comb. Probab. Comput.
C. R. Subramanian
2007 B conf
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
ISAAC
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2006 J jnl
Analysis of a heuristic for acyclic edge colouring.
Inf. Process. Lett.
C. R. Subramanian
2006 J jnl
Faster fixed parameter tractable algorithms for finding feedback vertex sets.
ACM Trans. Algorithms
Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2006 J jnl
On Sampling Colorings of Bipartite Graphs.
Discret. Math. Theor. Comput. Sci.
R. Balasubramanian, C. R. Subramanian
2006 Misc conf
Optimal Acyclic Edge Colouring of Grid Like Graphs.
COCOON
Rahul Muthu, N. Narayanan, C. R. Subramanian
2005 J jnl
Faster algorithms for feedback vertex set.
Electron. Notes Discret. Math.
Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2005 J jnl
Girth and treewidth.
J. Comb. Theory B
L. Sunil Chandran, C. R. Subramanian
2005 J jnl
Graphs of low chordality.
Discret. Math. Theor. Comput. Sci.
L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian
2005 J jnl
Improved bounds on acyclic edge colouring.
Electron. Notes Discret. Math.
Rahul Muthu, N. Narayanan, C. R. Subramanian
2003 J jnl
A spectral lower bound for the treewidth of a graph and its consequences.
Inf. Process. Lett.
L. Sunil Chandran, C. R. Subramanian
2003 J jnl
Finding Induced Acyclic Subgraphs in Random Digraphs.
Electron. J. Comb.
C. R. Subramanian
2003 Misc conf
Isoperimetric Inequalities and the Width Parameters of Graphs.
COCOON
L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian
2002 B conf
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.
ISAAC
Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2002 J jnl
General Partitioning on Random Graphs.
J. Algorithms
C. R. Subramanian, C. E. Veni Madhavan
2001 J jnl
Paths of specified length in random k-partite graphs.
Discret. Math. Theor. Comput. Sci.
C. R. Subramanian
2000 J jnl
Algorithms For Colouring Random K-Colourable Graphs.
Comb. Probab. Comput.
C. R. Subramanian
2000 A conf
Coloring Sparse Random Graphs in Polynominal Average Time.
ESA
C. R. Subramanian
1999 A* conf
A Generalization of Janson Inequalities and its Application to Finding Shortest Paths.
SODA
C. R. Subramanian
1999 J jnl
Minimum Coloring k-Colorable Graphs in Polynomial Average Time.
J. Algorithms
C. R. Subramanian
1998 J jnl
Algorithms for coloring semi-random graphs.
Random Struct. Algorithms
C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan
1998 — conf
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).
RANDOM
Claus-Peter Schnorr, C. R. Subramanian
1995 A* conf
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.
FOCS
C. R. Subramanian
1994 — conf
Coloring Semi-Random Graphs in Polynomial Expected Time.
FSTTCS
C. R. Subramanian, C. E. Veni Madhavan
1994 B conf
Improved Algorithms for Coloring Random Graphs.
ISAAC
C. R. Subramanian
1993 B conf
Coloring Random Graphs in Polynomial Expected Time.
ISAAC
Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan
1992 — conf
Coloring Random Graphs.
SWAT
Martin Fürer, C. R. Subramanian