Author of the publication

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.

, , , , , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 110-119. Springer, (2011)

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.

 

Other publications of authors with the same name

An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs., , , and . IPEC, volume 7535 of Lecture Notes in Computer Science, page 85-96. Springer, (2012)Recognizing Threshold Tolerance Graphs in O(n2) Time., , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)Induced Disjoint Paths in Circular-Arc Graphs in Linear Time., , and . WG, volume 8747 of Lecture Notes in Computer Science, page 225-237. Springer, (2014)Low-rank binary matrix approximation in column-sum norm., , , and . CoRR, (2019)Contracting a Chordal Graph to a Split Graph or a Tree., , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 339-350. Springer, (2011)Distance Constrained Labelings of Trees., , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 125-135. Springer, (2008)Spanners in Sparse Graphs., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 597-608. Springer, (2008)Enumeration and maximum number of maximal irredundant sets for chordal graphs., , , and . Discret. Appl. Math., (2019)Partial Complementation of Graphs., , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Modification to Planarity is Fixed Parameter Tractable., , and . STACS, volume 126 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)