Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Subramanian, C.R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New lower bounds for the independence number of sparse graphs and hypergraphs
Kunal Dutta
,
Dhruv Mubayi
,
C.R. Subramanian
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1134-1147
Bounds on vertex colorings with restrictions on the union of color classes
N.R. Aravind
,
C.R. Subramanian
Journal of Graph Theory
66
(3), 2011, pp. 213-234
The complexity of König subgraph problems and above-guarantee vertex cover
Sounaka Mishra
,
Venkatesh Raman
,
Saket Saurabh
,
Somnath Sikdar
,
C.R. Subramanian
Algorithmica
61
(4), 2011, pp. 857-881
Dominating set based exact algorithms for 3-coloring
N.S. Narayanaswamy
,
C.R. Subramanian
Information Processing Letters
111
(6), 2011, pp. 251-255
Bounds on edge colorings with restrictions on the union of color classes
N.R. Aravind
,
C.R. Subramanian
SIAM Journal on Discrete Mathematics
24
(3), 2010, pp. 841-852
Largest induced acyclic tournament in random digraphs: A 2-point concentration
Kunal Dutta
,
C.R. Subramanian
Lecture Notes in Computer Science
6034
, 2010, pp. 627-637
The complexity of finding subgraphs whose matching number equals the vertex cover number
Sounaka Mishra
,
Venkatesh Raman
,
Saket Saurabh
,
Somnath Sikdar
,
C.R. Subramanian
Lecture Notes in Computer Science
4835
, 2007, pp. 268-279
Optimal acyclic edge colouring of grid like graphs
Rahul Muthu
,
N. Narayanan
,
C.R. Subramanian
Lecture Notes in Computer Science
4112
, 2006, pp. 360-367
Analysis of a heuristic for acyclic edge colouring
C.R. Subramanian
Information Processing Letters
99
(6), 2006, pp. 227-229
Girth and treewidth
L. Sunil Chandran
,
C.R. Subramanian
Journal of Combinatorial Theory Series B
93
(1), 2005, pp. 23-32
Isoperimetric inequalities and the width parameters of graphs
L. Sunil Chandran
,
T. Kavitha
,
C.R. Subramanian
Lecture Notes in Computer Science
2697
, 2003, pp. 385-393
A spectral lower bound for the treewidth of a graph and its consequences
L. Sunil Chandran
,
C.R. Subramanian
Information Processing Letters
87
(4), 2003, pp. 195-200
Faster fixed parameter tractable algorithms for undirected feedback vertex set
Venkatesh Raman
,
Saket Saurabh
,
C.R. Subramanian
Lecture Notes in Computer Science
2518
, 2002, pp. 241-248
General partitioning on random graphs
C.R. Subramanian
,
C.E. Veni Madhavan
Journal of Algorithms
42
(1), 2002, pp. 153-172
Coloring sparse random graphs in polynomial average time
C.R. Subramanian
Lecture Notes in Computer Science
1879
, 2000, pp. 415-426
Minimum coloring
k
-coloring graphs in polynomial average time
C.R. Subramanian
Journal of Algorithms
33
(1), 1999, pp. 112-123
A generalization of Janson inequalities and its application fo finding shortest paths
C.R. Subramanian
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 795-804
Almost optimal (on the average) combinatorial algorithms for Boolean matrix product witnesses, computing the diameter
C.P. Schnorr
,
C.R. Subramanian
Lecture Notes in Computer Science
1518
, 1998, pp. 218-231
Minimum coloring random and semi-random graphs in polynomial expected time
C.R. Subramanian
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 463-472
Coloring semi-random graphs in polynomial expected time
C.R. Subramanian
,
C.E. Veni Madhavan
Lecture Notes in Computer Science
880
, 1994, pp. 137-148
Improved algorithms for coloring random graphs
C.R. Subramanian
Lecture Notes in Computer Science
834
, 1994, pp. 460-468
Coloring random graphs in polynomial expected time
Martin Furer
,
C.R. Subramanian
,
C.E. Veni Madhavan
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 31-37
Coloring random graphs
Martin Fürer
,
C.R. Subramanian
Lecture Notes in Computer Science
621
, 1992, pp. 284-291