( en | de | ru )

 

Disambiguation of "Subramanian, C. R."

Author of the publication

copydeleteadd this publication to your clipboard
Faster algorithms for feedback vertex set.

, , and . Electron. Notes Discret. Math., (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

C R Jacob

Mahmut Çag r c

J R C Cousland

Heinrich C R Klein

Berit C R Royer

 

Other publications of authors with the same name

On induced acyclic subgraphs in sparse random digraphs., and . Electron. Notes Discret. Math., (2011)A spectral lower bound for the treewidth of a graph and its consequences., and . Inf. Process. Lett., 87 (4): 195-200 (2003)Dominating set based exact algorithms for 3-coloring., and . Inf. Process. Lett., 111 (6): 251-255 (2011)Inductive graph invariants and approximation algorithms .. Discret. Math. Algorithms Appl., 14 (6): 2250019:1-2250019:36 (2022)On approximating MIS over B1-VPG graphs*., , and . Discret. Math. Algorithms Appl., 14 (7): 2250035:1-2250035:13 (2022)General Partitioning on Random Graphs., and . J. Algorithms, 42 (1): 153-172 (2002)Maximum Independent Set on B_1 B 1 -VPG Graphs., , and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 633-646. Springer, (2015)Optimal Acyclic Edge Colouring of Grid Like Graphs., , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 360-367. Springer, (2006)The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number., , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 268-279. Springer, (2007)Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.. FOCS, page 463-472. IEEE Computer Society, (1995)