Author of the publication

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.

, , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 16-27. Springer, (2013)

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

Low-rank binary matrix approximation in column-sum norm., , , and . CoRR, (2019)Distance Constrained Labelings of Trees., , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 125-135. Springer, (2008)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)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)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 minimal dominating sets for chordal graphs., , , and . Theor. Comput. Sci., (2019)Parameterized Complexity of Broadcasting in Graphs., , and . WG, volume 14093 of Lecture Notes in Computer Science, page 334-347. Springer, (2023)Parameterized Complexity of Superstring Problems., , , , , and . Algorithmica, 79 (3): 798-813 (2017)