Author of the publication

Balanced Judicious Bipartition is Fixed-Parameter Tractable.

, , , and . FSTTCS, volume 93 of LIPIcs, page 40:40-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)On the directed Full Degree Spanning Tree problem., , , and . Discret. Optim., 8 (1): 97-109 (2011)A 2ℓk Kernel for ℓ-Component Order Connectivity., and . CoRR, (2016)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . SODA, page 1010-1018. SIAM, (2020)Graph Classes with Few Minimal Separators. II. A Dichotomy., and . SODA, page 3098-3178. SIAM, (2023)Beating Brute Force for Systems of Polynomial Equations over Finite Fields., , , , and . SODA, page 2190-2202. SIAM, (2017)FPT-approximation for FPT Problems., , , , and . SODA, page 199-218. SIAM, (2021)