Author of the publication

Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421).

, , and . Dagstuhl Reports, 8 (10): 63-86 (2018)

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

Editing to a connected graph of given degrees.. Inf. Comput., (2017)Low-rank binary matrix approximation in column-sum norm., , , and . CoRR, (2019)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)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)Parameterized k-Clustering: The distance matters!, , and . CoRR, (2019)Parameterized algorithm for eternal vertex cover., , , , and . Inf. Process. Lett., 110 (16): 702-706 (2010)Spanners in Sparse Graphs., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 597-608. Springer, (2008)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)