C. R. Subramanian

Publication Activity (10 Years)

Years Active: 1992-2022
Publications (10 Years): 9

Top Topics

Maximum Independent Set

Overlay Multicast

Top Venues

Discuss. Math. Graph Theory

Discret. Math. Algorithms Appl.

Publications

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