( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Complexity of Tree Multicolorings.

. MFCS, том 2420 из Lecture Notes in Computer Science, стр. 532-542. Springer, (2002)

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.

Andreas Daniel Marx

Dániel Tóvári

Dániel Ungár

Dániel Apai

Andreas Marx

 

Другие публикации лиц с тем же именем

Cleaning Interval Graphs, и . CoRR, (2010)Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal., , и . ACM Trans. Algorithms, 14 (2): 13:1-13:30 (2018)Constraint solving via fractional edge covers., и . SODA, стр. 289-298. ACM Press, (2006)The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk).. SWAT, том 53 из LIPIcs, стр. 32:1-32:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Complexity of Tree Multicolorings.. MFCS, том 2420 из Lecture Notes in Computer Science, стр. 532-542. Springer, (2002)Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem., и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 647-658. Springer, (2009)Minimizing Movement: Fixed-Parameter Tractability., , и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 718-729. Springer, (2009)Parameterized Graph Cleaning Problems., и . WG, том 5344 из Lecture Notes in Computer Science, стр. 287-299. (2008)A Parameterized View on Matroid Optimization Problems.. ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 655-666. Springer, (2006)Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).. WAOA, том 2909 из Lecture Notes in Computer Science, стр. 214-226. Springer, (2003)