( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.

, , и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 298-309. Springer, (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.

Christine Fellows

Edward Fellows

Michael R Schön

Michael R Glaubitz

Michael R Koch

 

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

Fixed Parameter Tractability and Completeness., и . Complexity Theory: Current Research, стр. 191-225. Cambridge University Press, (1992)A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals., , и . J. Univers. Comput. Sci., 3 (11): 1194-1198 (1997)Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average., , , , , , и . FSTTCS, том 13 из LIPIcs, стр. 229-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)The Private Neighbor Cube., , , и . SIAM J. Discret. Math., 7 (1): 41-47 (1994)Parameterized Complexity: The Main Ideas and Connections to Practical Computing.. Experimental Algorithmics, том 2547 из Lecture Notes in Computer Science, стр. 51-77. Springer, (2000)New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.. WADS, том 2748 из Lecture Notes in Computer Science, стр. 505-520. Springer, (2003)Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.. WG, том 2880 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2003)Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover., , , и . IWPEC, том 3162 из Lecture Notes in Computer Science, стр. 271-280. Springer, (2004)Parameterized Approximation Problems., , и . IWPEC, том 4169 из Lecture Notes in Computer Science, стр. 121-129. Springer, (2006)A Purely Democratic Characterization of W1., , , и . IWPEC, том 5018 из Lecture Notes in Computer Science, стр. 103-114. Springer, (2008)