C. R. Subramanian

Available identifiers

zbMath Open subramanian.c-rMaRDI QIDQ536213

List of research outcomes

Publication	Date of Publication	Type
On Induced Paths, Holes, and Trees in Random Graphs	2023-03-30	Paper
Inductive graph invariants and algorithmic applications	2023-03-21	Paper
On approximating MIS over B1-VPG graphs*	2022-12-19	Paper
Coloring random graphs	2022-12-09	Paper
Inductive graph invariants and approximation algorithms	2022-09-02	Paper
Intersection dimension and graph invariants	2020-12-08	Paper
On Induced Paths, Holes and Trees in Random Graphs	2019-09-18	Paper
https://portal.mardi4nfdi.de/entity/Q4635989	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q2959903	2017-02-10	Paper
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs	2016-09-22	Paper
Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs	2016-02-05	Paper
Faster fixed parameter tractable algorithms for finding feedback vertex sets	2015-09-02	Paper
Cartesian Product and Acyclic Edge Colouring	2015-08-05	Paper
Probabilistic Arguments in Graph Coloring (Invited Talk)	2015-02-19	Paper
Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms	2014-07-28	Paper
Star coloring of subcubic graphs	2013-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q2857365	2013-11-01	Paper
Intersection Dimension and Maximum Degree	2013-07-19	Paper
Dominating set based exact algorithms for \(3\)-coloring	2013-04-04	Paper
Forbidden subgraph colorings and the oriented chromatic number	2013-01-24	Paper
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs	2013-01-04	Paper
The complexity of König subgraph problems and above-guarantee vertex cover	2011-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q3012403	2011-07-06	Paper
Bounds on Edge Colorings with Restrictions on the Union of Color Classes	2011-06-17	Paper
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs	2011-05-16	Paper
Bounds on vertex colorings with restrictions on the union of color classes	2011-03-21	Paper
Isoperimetric Inequalities and the Width Parameters of Graphs	2011-03-18	Paper
https://portal.mardi4nfdi.de/entity/Q3575422	2010-07-27	Paper
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration	2010-04-27	Paper
Analysis of a heuristic for acyclic edge colouring	2010-01-29	Paper
Forbidden Subgraph Colorings and the Oriented Chromatic Number	2009-12-11	Paper
A spectral lower bound for the treewidth of a graph and its consequences	2009-04-28	Paper
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number	2008-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q3439693	2007-05-29	Paper
List Set Colouring: Bounds and Algorithms	2007-03-20	Paper
https://portal.mardi4nfdi.de/entity/Q4667625	2005-04-20	Paper
Girth and treewidth	2005-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q4470499	2004-07-01	Paper
Finding induced acyclic subgraphs in random digraphs	2004-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q4425958	2003-09-14	Paper
General Partitioning on Random Graphs	2002-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q2752459	2002-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q2753957	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4525736	2001-01-24	Paper
Algorithms for Colouring Random k-colourable Graphs	2000-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4252731	2000-04-26	Paper
Minimum Coloring k-Colorable Graphs in Polynomial Average Time	2000-03-20	Paper
Algorithms for coloring semi-random graphs	1999-12-19	Paper
Some properties of touching distances for polygons and polyhedra	1999-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4268434	1999-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q4252362	1999-06-17	Paper
The existence of homeomorphic subgraphs in chordal graphs	1998-02-23	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: C. R. Subramanian