C. R. Subramanian

From MaRDI portal
Person:536213

Available identifiers

zbMath Open subramanian.c-rMaRDI QIDQ536213

List of research outcomes





PublicationDate of PublicationType
Weighted Erlang-truncated exponential distribution: system reliability optimization, structural properties, and simulation2025-01-03Paper
A new extension of Chris-Jerry distribution with its properties2024-07-05Paper
On Induced Paths, Holes, and Trees in Random Graphs2023-03-30Paper
Inductive graph invariants and algorithmic applications2023-03-21Paper
On approximating MIS over B1-VPG graphs*2022-12-19Paper
Coloring random graphs2022-12-09Paper
Inductive graph invariants and approximation algorithms2022-09-02Paper
Intersection dimension and graph invariants2020-12-08Paper
On Induced Paths, Holes and Trees in Random Graphs2019-09-18Paper
https://portal.mardi4nfdi.de/entity/Q46359892018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q29599032017-02-10Paper
Improved bounds on induced acyclic subgraphs in random digraphs2016-09-22Paper
Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs2016-02-05Paper
Faster fixed parameter tractable algorithms for finding feedback vertex sets2015-09-02Paper
Cartesian Product and Acyclic Edge Colouring2015-08-05Paper
Probabilistic Arguments in Graph Coloring (Invited Talk)2015-02-19Paper
Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms2014-07-28Paper
Star coloring of subcubic graphs2013-11-11Paper
On induced acyclic subgraphs in sparse random digraphs2013-11-01Paper
Intersection dimension and maximum degree2013-07-19Paper
Dominating set based exact algorithms for \(3\)-coloring2013-04-04Paper
Forbidden subgraph colorings and the oriented chromatic number2013-01-24Paper
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs2013-01-04Paper
Oriented colouring of some graph products2012-09-05Paper
The complexity of König subgraph problems and above-guarantee vertex cover2011-12-14Paper
https://portal.mardi4nfdi.de/entity/Q30124032011-07-06Paper
Bounds on Edge Colorings with Restrictions on the Union of Color Classes2011-06-17Paper
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs2011-05-16Paper
Bounds on vertex colorings with restrictions on the union of color classes2011-03-21Paper
Isoperimetric Inequalities and the Width Parameters of Graphs2011-03-18Paper
https://portal.mardi4nfdi.de/entity/Q35754222010-07-27Paper
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration2010-04-27Paper
Analysis of a heuristic for acyclic edge colouring2010-01-29Paper
Forbidden Subgraph Colorings and the Oriented Chromatic Number2009-12-11Paper
A spectral lower bound for the treewidth of a graph and its consequences2009-04-28Paper
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q34396932007-05-29Paper
List Set Colouring: Bounds and Algorithms2007-03-20Paper
https://portal.mardi4nfdi.de/entity/Q46676252005-04-20Paper
Girth and treewidth2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q44704992004-07-01Paper
Finding induced acyclic subgraphs in random digraphs2004-02-05Paper
https://portal.mardi4nfdi.de/entity/Q44259582003-09-14Paper
General paritioning on random graphs2002-09-11Paper
Paths of specified length in random \(k\)-partite graphs2002-01-07Paper
https://portal.mardi4nfdi.de/entity/Q27539572001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45257362001-01-24Paper
Algorithms for Colouring Random k-colourable Graphs2000-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42527312000-04-26Paper
Minimum Coloring k-Colorable Graphs in Polynomial Average Time2000-03-20Paper
Algorithms for coloring semi-random graphs1999-12-19Paper
Some properties of touching distances for polygons and polyhedra1999-11-25Paper
https://portal.mardi4nfdi.de/entity/Q42684341999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42523621999-06-17Paper
The existence of homeomorphic subgraphs in chordal graphs1998-02-23Paper

Research outcomes over time

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