Author of the publication

When is Red-Blue Nonblocker Fixed-Parameter Tractable?

, , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 515-528. Springer, (2018)

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

Backdoors to Acyclic SAT., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 363-374. Springer, (2012)Enumeration of Preferred Extensions in Almost Oriented Digraphs., and . MFCS, volume 138 of LIPIcs, page 74:1-74:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Kernels for Global Constraints., and . IJCAI, page 540-545. IJCAI/AAAI, (2011)Making the Most of Parallel Composition in Differential Privacy., , , , , and . CoRR, (2021)Backdoors into Heterogeneous Classes of SAT and CSP., , , , and . CoRR, (2015)Linearly χ-bounding (P6, C4)-free graphs., and . J. Graph Theory, 92 (3): 322-342 (2019)Turbocharging Treewidth Heuristics., , , , and . Algorithmica, 81 (2): 439-475 (2019)Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements., , , and . ISAAC, volume 92 of LIPIcs, page 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets., and . ACM Trans. Algorithms, 13 (4): 44:1-44:36 (2017)Stable Matching with Uncertain Linear Preferences., , , , , and . Algorithmica, 82 (5): 1410-1433 (2020)