Author of the publication

The Complexity of Global Cardinality Constraints.

, and . LICS, page 419-428. IEEE Computer Society, (2009)

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

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal., , and . ACM Trans. Algorithms, 14 (2): 13:1-13:30 (2018)Parameterized Graph Cleaning Problems., and . WG, volume 5344 of Lecture Notes in Computer Science, page 287-299. (2008)Finding and Counting Permutations via CSPs., , and . IPEC, volume 148 of LIPIcs, page 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , , and . CoRR, (2019)The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk).. SWAT, volume 53 of LIPIcs, page 32:1-32:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Closest Substring Problems with Small Distances.. SIAM J. Comput., 38 (4): 1382-1410 (2008)Constraint solving via fractional edge covers., and . SODA, page 289-298. ACM Press, (2006)The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201)., , , and . Dagstuhl Reports, 12 (5): 112-130 (2022)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . Electron. Colloquium Comput. Complex., (2019)A parameterized view on matroid optimization problems.. Theor. Comput. Sci., 410 (44): 4471-4479 (2009)