Author of the publication

Parameterized complexity of connected even/odd subgraph problems.

, and . J. Comput. Syst. Sci., 80 (1): 157-179 (2014)

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

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)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)Approximation Schemes for Low-Rank Binary Matrix Approximation Problems., , , , and . CoRR, (2018)Spanning Circuits in Regular Matroids., , , and . CoRR, (2016)Parameterized algorithm for eternal vertex cover., , , , and . Inf. Process. Lett., 110 (16): 702-706 (2010)Parameterized k-Clustering: The distance matters!, , and . CoRR, (2019)Low-rank binary matrix approximation in column-sum norm., , , and . CoRR, (2019)Recognizing Threshold Tolerance Graphs in O(n2) Time., , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)