( en | de | ru )

 

Disambiguation of "Fellows, Michael R."

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Polynomial-Time Approximation.

, , , and . Theory Comput. Syst., 41 (3): 459-477 (2007)

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.

Christine Fellows

Edward Fellows

Michael R Schön

Michael R Glaubitz

Michael R Koch

 

Other publications of authors with the same name

Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . Algorithmica, 61 (2): 362-388 (2011)Processor Utilization in a Linearly Connected Parallel Processing System., and . IEEE Trans. Computers, 37 (5): 594-603 (1988)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)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)Connected Coloring Completion for General Graphs: Algorithms and Complexity., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 75-85. Springer, (2007)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 86-96. Springer, (2007)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)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)Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average., , , , , , and . FSTTCS, volume 13 of LIPIcs, page 229-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)