Author of the publication

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.

, , , , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 185-200. Springer, (2019)

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

From symmetry to asymmetry: Generalizing TSP approximations by parametrization., , , , , and . J. Comput. Syst. Sci., (2023)Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . CoRR, (2022)Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number., , , , , and . ICALP, volume 132 of LIPIcs, page 109:1-109:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Fixed-Parameter Approach for Privacy-Protection with Global Recoding.. FAW, volume 8497 of Lecture Notes in Computer Science, page 25-35. Springer, (2014)Complexity of independency and cliquy trees., , , , , , , and . Discret. Appl. Math., (2020)Combinatorial Properties and Recognition of Unit Square Visibility Graphs., , , , and . Discret. Comput. Geom., 69 (4): 937-980 (June 2023)Balanced Crown Decomposition for Connectivity Constraints., , , , and . ESA, volume 204 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . WG, volume 14093 of Lecture Notes in Computer Science, page 143-156. Springer, (2023)Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover., , , , , , , , , and 1 other author(s). SEA, volume 265 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics., , , , , and . KDD, page 882-891. ACM, (2021)