( 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

 

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

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem., , , , и . Theory Comput. Syst., 41 (3): 479-492 (2007)Quadratic Kernelization for Convex Recoloring of Trees., , , , , и . Algorithmica, 61 (2): 362-388 (2011)Processor Utilization in a Linearly Connected Parallel Processing System., и . IEEE Trans. Computers, 37 (5): 594-603 (1988)FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders., и . TOCT, 6 (4): 16:1-16:26 (2014)Polynomial Time Data Reduction for Dominating Set, , и . CoRR, (2002)The Private Neighbor Cube., , , и . SIAM J. Discret. Math., 7 (1): 41-47 (1994)Fixed Parameter Tractability and Completeness., и . Complexity Theory: Current Research, стр. 191-225. Cambridge University Press, (1992)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)