Author of the publication

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion.

, , and . J. Comput. Syst. Sci., (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

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors., , and . J. Comb. Theory, Ser. B, (2017)Packing and Covering Immersion Models of Planar Subcubic Graphs., , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 74-84. (2016)Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths., , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 148-160. Springer, (2020)A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion., , and . J. Comput. Syst. Sci., (2018)A Polynomial Kernel for Distance-Hereditary Vertex Deletion., and . Algorithmica, 83 (7): 2096-2141 (2021)Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms., , , and . Algorithmica, 81 (10): 3890-3935 (2019)Mim-width III. Graph powers and generalized distance domination problems., , , and . Theor. Comput. Sci., (2019)A polynomial kernel for $3$-leaf power deletion., , , and . CoRR, (2019)A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width., , and . STACS, volume 96 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)., , and . CoRR, (2022)