( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity: The Main Ideas and Connections to Practical Computing.

. Experimental Algorithmics, том 2547 из Lecture Notes in Computer Science, стр. 51-77. Springer, (2000)

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.

Christine Fellows

Edward Fellows

Michael R Schön

Michael R Glaubitz

Michael R Koch

 

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

Local Search: Is Brute-Force Avoidable?, , , , , и . IJCAI, стр. 486-491. (2009)Fast search algorithms for layout permutation problems., и . Integr., 12 (3): 321-337 (1991)On Search, Decision, and the Efficiency of Polynomial-Time Algorithms., и . J. Comput. Syst. Sci., 49 (3): 769-779 (1994)On the parameterized complexity of multiple-interval graph problems., , , и . Theor. Comput. Sci., 410 (1): 53-61 (2009)On the Structure of Parameterized Problems in NP., , , и . Inf. Comput., 123 (1): 38-49 (1995)Surfing with Rod.. Computability and Complexity, том 10010 из Lecture Notes in Computer Science, стр. 9-18. Springer, (2017)An Improved Fixed-Parameter Algorithm for Vertex Cover., , и . Inf. Process. Lett., 65 (3): 163-168 (1998)FPT Is Characterized by Useful Obstruction Sets., и . WG, том 8165 из Lecture Notes in Computer Science, стр. 261-273. Springer, (2013)On the Structure of Parameterized Problems in NP (Extended Abstract)., , , и . STACS, том 775 из Lecture Notes in Computer Science, стр. 509-520. Springer, (1994)Distortion Is Fixed Parameter Tractable., , , , , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 463-474. Springer, (2009)