( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of the Arc-Preserving Subsequence Problem.

, и . WG, том 6410 из Lecture Notes in Computer Science, стр. 244-255. (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.

Andreas Daniel Marx

Dániel Tóvári

Dániel Ungár

Dániel Apai

Fritz Marx

 

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

Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).. WAOA, том 2909 из Lecture Notes in Computer Science, стр. 214-226. Springer, (2003)Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set., , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 249-261. Springer, (2019)Covering a tree with rooted subtrees., и . CoRR, (2019)Slightly Superexponential Parameterized Problems., , и . CoRR, (2019)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)A Parameterized View on Matroid Optimization Problems.. ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 655-666. Springer, (2006)Parameterized Graph Cleaning Problems., и . WG, том 5344 из Lecture Notes in Computer Science, стр. 287-299. (2008)Finding and Counting Permutations via CSPs., , и . IPEC, том 148 из LIPIcs, стр. 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)