( en | de | ru )

 

Disambiguation of "Marx, Dániel"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of global cardinality constraints

, and . Logical Methods in Computer Science, (2010)

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.

Andreas Daniel Marx

Dániel Tóvári

Dániel Ungár

Dániel Apai

Dieter Marx

 

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)Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem., and . ESA, volume 5757 of Lecture Notes in Computer Science, page 647-658. Springer, (2009)Minimizing Movement: Fixed-Parameter Tractability., , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 718-729. Springer, (2009)A Parameterized View on Matroid Optimization Problems.. ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 655-666. Springer, (2006)The Complexity of Tree Multicolorings.. MFCS, volume 2420 of Lecture Notes in Computer Science, page 532-542. Springer, (2002)Covering a tree with rooted subtrees., and . CoRR, (2019)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)Clustering with Local Restrictions., and . CoRR, (2017)