( en | de | ru )

 

Disambiguation of "Fellows, Michael R."

Author of the publication

copydeleteadd this publication to your clipboard
Small Diameter Symmetric Networks from Linear Groups.

, , , , , , , , and . IEEE Trans. Computers, 41 (2): 218-220 (1992)

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

Fixed Parameter Tractability and Completeness., and . Complexity Theory: Current Research, page 191-225. Cambridge University Press, (1992)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: The Main Ideas and Connections to Practical Computing.. Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, page 51-77. Springer, (2000)Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover., , , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 271-280. Springer, (2004)Parameterized Approximation Problems., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 121-129. Springer, (2006)A Purely Democratic Characterization of W1., , , and . IWPEC, volume 5018 of Lecture Notes in Computer Science, page 103-114. Springer, (2008)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)