Author of the publication

Editing to Connected f-Degree Graph.

, , , and . STACS, volume 47 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Parameterized Complexity of Superstring Problems., , , , , and . Algorithmica, 79 (3): 798-813 (2017)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)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)Partial Complementation of Graphs., , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Enumeration and maximum number of maximal irredundant sets for chordal graphs., , , and . Discret. Appl. Math., (2019)Editing to a planar graph of given degrees., , , , and . J. Comput. Syst. Sci., (2017)On the parameterized complexity of coloring graphs in the absence of a linear forest., , , and . J. Discrete Algorithms, (2012)Computing Tree Decompositions with Small Independence Number., , , , and . CoRR, (2022)Three complexity results on coloring Pk-free graphs., , , and . Eur. J. Comb., 34 (3): 609-619 (2013)Going Far from Degeneracy., , , , , and . SIAM J. Discret. Math., 34 (3): 1587-1601 (2020)