( en | de | ru )

 

Disambiguation of "Marx, Dániel"

Author of the publication

copydeleteadd this publication to your clipboard
A parameterized view on matroid optimization problems.

. Theor. Comput. Sci., 410 (44): 4471-4479 (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.

Andreas Daniel Marx

Dániel Tóvári

Dániel Ungár

Dániel Apai

Justina Marx

 

Other publications of authors with the same name

Cleaning Interval Graphs, and . CoRR, (2010)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 Algorithms for Generalizations of Directed Feedback Vertex Set., , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 249-261. Springer, (2019)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)Parameterized Graph Cleaning Problems., and . WG, volume 5344 of Lecture Notes in Computer Science, page 287-299. (2008)Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).. WAOA, volume 2909 of Lecture Notes in Computer Science, page 214-226. Springer, (2003)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)