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

An Extension-Based Approach to Belief Revision in Abstract Argumentation., , , , and . IJCAI, page 2926-2932. AAAI Press, (2015)Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Multicut on Graphs of Bounded Clique-Width., , , and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 115-126. Springer, (2012)Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough., , , and . KR, AAAI Press, (2010)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)Multicut Algorithms via Tree Decompositions., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 167-179. Springer, (2010)Belief merging within fragments of propositional logic., , , and . ECAI, volume 263 of Frontiers in Artificial Intelligence and Applications, page 231-236. IOS Press, (2014)The Parameterized Complexity of Abduction., , , and . AAAI, page 743-749. AAAI Press, (2012)Fast Counting with Bounded Treewidth., , , and . LPAR, volume 5330 of Lecture Notes in Computer Science, page 436-450. Springer, (2008)