Author of the publication

Domination and Cut Problems on Chordal Graphs with Bounded Leafage.

, , , , and . Algorithmica, 86 (5): 1428-1474 (May 2024)

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

Domination and Cut Problems on Chordal Graphs with Bounded Leafage., , , , and . Algorithmica, 86 (5): 1428-1474 (May 2024)Planar CPG graphs., , and . CoRR, (2018)Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs., , and . SoCG, volume 258 of LIPIcs, page 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Classifying k-Edge Colouring for H-free Graphs., , , and . CoRR, (2018)Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width., , and . CoRR, (2018)Blocking Dominating Sets for H-Free Graphs via Edge Contractions., , and . ISAAC, volume 149 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters., , , , and . MFCS, volume 241 of LIPIcs, page 51:1-51:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification., , , and . CoRR, (2022)CPG graphs: Some structural and hardness results., , and . CoRR, (2019)Approximating Independent Set and Dominating Set on VPG graphs., and . CoRR, (2020)