( en | de | ru )

 

Disambiguation of "Fellows, Michael R."

Author of the publication

copydeleteadd this publication to your clipboard
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.

, , , , , and . ALENEX/ANALC, page 62-69. SIAM, (2004)

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. You can also use the button next to the name to display some publications already assigned to the person.

Edward Fellows

Christine Fellows

Michael R Schön

Michael R Glaubitz

Michael R Schön

 

Other publications of authors with the same name

FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders., and . TOCT, 6 (4): 16:1-16:26 (2014)An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem., , , , and . Theory Comput. Syst., 41 (3): 479-492 (2007)Processor Utilization in a Linearly Connected Parallel Processing System., and . IEEE Trans. Computers, 37 (5): 594-603 (1988)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . Algorithmica, 61 (2): 362-388 (2011)Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.. WG, volume 2880 of Lecture Notes in Computer Science, page 1-12. Springer, (2003)Parameterized Complexity: The Main Ideas and Connections to Practical Computing.. Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, page 51-77. Springer, (2000)New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.. WADS, volume 2748 of Lecture Notes in Computer Science, page 505-520. Springer, (2003)Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 150-159. Springer, (2002)The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 180-189. Springer, (2002)Parameterized Complexity of Stabbing Rectangles and Squares in the Plane., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 298-309. Springer, (2009)