( en | de | ru )

 

Disambiguation of "Fellows, Michael R."

Author of the publication

copydeleteadd this publication to your clipboard
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.

, , and . J. Univers. Comput. Sci., 3 (11): 1194-1198 (1997)

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 Schön

 

Other publications of authors with the same name

Fast search algorithms for layout permutation problems., and . Integr., 12 (3): 321-337 (1991)Surfing with Rod.. Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 9-18. Springer, (2017)An Improved Fixed-Parameter Algorithm for Vertex Cover., , and . Inf. Process. Lett., 65 (3): 163-168 (1998)On Search, Decision, and the Efficiency of Polynomial-Time Algorithms., and . J. Comput. Syst. Sci., 49 (3): 769-779 (1994)On the parameterized complexity of multiple-interval graph problems., , , and . Theor. Comput. Sci., 410 (1): 53-61 (2009)Implementing the Standards: Let's Focus on the First Four., and . Discrete Mathematics in the Schools, volume 36 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 51-65. DIMACS/AMS, (1992)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , and 2 other author(s). GD, volume 2265 of Lecture Notes in Computer Science, page 1-15. Springer, (2001)FPT Is Characterized by Useful Obstruction Sets., and . WG, volume 8165 of Lecture Notes in Computer Science, page 261-273. Springer, (2013)Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design., and . AWOC, volume 319 of Lecture Notes in Computer Science, page 278-287. Springer, (1988)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)