Author of the publication

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

Partial Complementation of Graphs., , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)Enumeration and maximum number of maximal irredundant sets for chordal graphs., , , and . Discret. Appl. Math., (2019)Induced Disjoint Paths in AT-Free Graphs., , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 153-164. Springer, (2012)A linear kernel for finding square roots of almost planar graphs., , , and . Theor. Comput. Sci., (2017)Parameterized Aspects of Strong Subgraph Closure., , , , and . Algorithmica, 82 (7): 2006-2038 (2020)Metric Dimension of Bounded Width Graphs., , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 115-126. Springer, (2015)Metric Dimension of Bounded Tree-length Graphs., , , and . SIAM J. Discret. Math., 31 (2): 1217-1243 (2017)FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges., , , and . MFCS, volume 272 of LIPIcs, page 46:1-46:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)