( en | de | ru )

 

Disambiguation of "Fellows, Michael R."

Author of the publication

copydeleteadd this publication to your clipboard
Processor Utilization in a Linearly Connected Parallel Processing System.

, and . IEEE Trans. Computers, 37 (5): 594-603 (1988)

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

On the parameterized complexity of multiple-interval graph problems., , , and . Theor. Comput. Sci., 410 (1): 53-61 (2009)On Search, Decision, and the Efficiency of Polynomial-Time Algorithms., and . J. Comput. Syst. Sci., 49 (3): 769-779 (1994)On the Structure of Parameterized Problems in NP., , , and . Inf. Comput., 123 (1): 38-49 (1995)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)An Improved Fixed-Parameter Algorithm for Vertex Cover., , and . Inf. Process. Lett., 65 (3): 163-168 (1998)Clustering with Partial Information., , , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 144-155. Springer, (2008)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)Fast search algorithms for layout permutation problems., and . Integr., 12 (3): 321-337 (1991)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., and . CiE, volume 4497 of Lecture Notes in Computer Science, page 268-277. Springer, (2007)The Lost Continent of Polynomial Time: Preprocessing and Kernelization.. IWPEC, volume 4169 of Lecture Notes in Computer Science, page 276-277. Springer, (2006)