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

A parameterized view on matroid optimization problems.. Theor. Comput. Sci., 410 (44): 4471-4479 (2009)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . Electron. Colloquium Comput. Complex., (2019)Constraint solving via fractional edge covers., and . SODA, page 289-298. ACM Press, (2006)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)A Parameterized View on Matroid Optimization Problems.. ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 655-666. Springer, (2006)Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).. WAOA, volume 2909 of Lecture Notes in Computer Science, page 214-226. Springer, (2003)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , and . SODA, page 1782-1801. SIAM, (2014)Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations., , , , and . SODA, page 314-345. SIAM, (2024)09511 Open Problems - Parameterized complexity and approximation algorithms., , and . Parameterized complexity and approximation algorithms, volume 09511 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)