Michael R. Fellows

Mike Fellows

The University of Newcastle, NSW, Australia

	2009
142		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664
141		Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526
140		Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352
139		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474
138		Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491
137		Michael R. Fellows: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. IWOCA 2009: 2-10
136		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330
135		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420
134		Michael Dom, Michael R. Fellows, Frances A. Rosamond: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309
133		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR abs/0902.2149: (2009)
132		Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. 75(4): 231-244 (2009)
131		Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009)
	2008
130		Michael R. Fellows, Henning Fernau: Facility Location Problems: A Parameterized View. AAIM 2008: 188-199
129		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71
128		Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43
127		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
126		Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305
125		Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413
124		Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114
123		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
122		Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008)
121		Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
120		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR abs/0804.3028: (2008)
119		Rodney G. Downey, Michael R. Fellows, Michael A. Langston: The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Comput. J. 51(1): 1-6 (2008)
118		Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008)
	2007
117		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377
116		Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir: Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON 2007: 75-85
115		Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96
114		Michael R. Fellows, Frances A. Rosamond: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE 2007: 268-277
113		Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw: Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321
112		Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351
111		Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters: Crown Structures for Vertex Cover Kernelization. Theory Comput. Syst. 41(3): 411-430 (2007)
110		Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond: The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41(3): 459-477 (2007)
109		Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens: An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst. 41(3): 479-492 (2007)
	2006
108		Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Kernelization for Convex Recoloring. ACiD 2006: 23-35
107		Rodney G. Downey, Michael R. Fellows, Catherine McCartin: Parameterized Approximation Problems. IWPEC 2006: 121-129
106		Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. IWPEC 2006: 192-202
105		Michael R. Fellows: The Lost Continent of Polynomial Time: Preprocessing and Kernelization. IWPEC 2006: 276-277
104		Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond: NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245
103		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
102		Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)
101		Michael R. Fellows, Jens Gramm, Rolf Niedermeier: On The Parameterized Intractability Of Motif Search Problems. Combinatorica 26(2): 141-167 (2006)
100		Michael R. Fellows, Stefan Szeider, Graham Wrightson: On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006)
	2005
99		Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond: FPT is P-Time Extremal Structure I. ACiD 2005: 1-41
98		Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens: An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. COCOON 2005: 859-869
97		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electronic Colloquium on Computational Complexity (ECCC)(080): (2005)
96		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width II: non-approximability of clique-width Electronic Colloquium on Computational Complexity (ECCC)(081): (2005)
95		Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2): 216-231 (2005)
94		Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005)
	2004
93		Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings Springer 2004
92		Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. ALENEX/ANALC 2004: 62-69
91		Michael R. Fellows: A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. ESA 2004: 1-2
90		Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322
89		Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia: Tight Lower Bounds for Certain Parameterized NP-Hard Problems. IEEE Conference on Computational Complexity 2004: 150-160
88		Michael R. Fellows, Stefan Szeider, Graham Wrightson: On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234
87		Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw: Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. IWPEC 2004: 271-280
86		Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle: Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244
85		Benny Chor, Mike Fellows, David W. Juedes: Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. WG 2004: 257-269
84		Jochen Alber, Michael R. Fellows, Rolf Niedermeier: Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004)
83		John A. Ellis, Hongbing Fan, Michael R. Fellows: The dominating set problem is fixed parameter tractable for graphs of bounded genus. J. Algorithms 52(2): 152-168 (2004)
	2003
82		Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248
81		Michael R. Fellows: New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. WADS 2003: 505-520
80		Michael R. Fellows: Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. WG 2003: 1-12
79		Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond: An FPT Algorithm for Set Splitting. WG 2003: 180-191
78		Tim Bell, Harold W. Thimbleby, Mike Fellows, Ian H. Witten, Neal Koblitz, Matthew Powell: Explaining cryptographic systems. Computers & Education 40(3): 199-215 (2003)
77		Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electr. Notes Theor. Comput. Sci. 78: (2003)
76		Michael R. Fellows, Michael T. Hallett, Ulrike Stege: Analogs & duals of the MAST problem for sequences & trees. J. Algorithms 49(1): 192-216 (2003)
75		Jianer Chen, Michael R. Fellows: Foreword from the guest editors. J. Comput. Syst. Sci. 67(4): 653 (2003)
74		Michael R. Fellows, Catherine McCartin: On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 2(298): 317-324 (2003)
	2002
73		Michael R. Fellows, Jens Gramm, Rolf Niedermeier: On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273
72		Jochen Alber, Michael R. Fellows, Rolf Niedermeier: Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. SWAT 2002: 150-159
71		John A. Ellis, Hongbing Fan, Michael R. Fellows: The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. SWAT 2002: 180-189
70		Michael R. Fellows, Jens Gramm, Rolf Niedermeier: Parameterized Intractability of Motif Search Problems CoRR cs.CC/0205056: (2002)
69		Jochen Alber, Michael R. Fellows, Rolf Niedermeier: Polynomial Time Data Reduction for Dominating Set CoRR cs.DS/0207066: (2002)
68		Michael R. Fellows: Parameterized Complexity: The Main Ideas and Connections to Practical Computing. Electr. Notes Theor. Comput. Sci. 61: (2002)
	2001
67		Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499
66		Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15
65		Michael R. Fellows: Parameterized Complexity: The Main Ideas and Some Research Frontiers. ISAAC 2001: 291-307
64		Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122
63		Rodney G. Downey, Michael R. Fellows: Index sets and parametric reductions. Arch. Math. Log. 40(5): 329-348 (2001)
62		Michael J. Dinneen, Kevin Cattell, Michael R. Fellows: Forbidden minors to graphs with small feedback sets. Discrete Mathematics 230(1-3): 215-252 (2001)
	2000
61		Michael R. Fellows: Parameterized Complexity: The Main Ideas and Connections to Practical Computing. Experimental Algorithmics 2000: 51-77
60		Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. FSTTCS 2000: 240-251
59		Rodney G. Downey, Michael R. Fellows, Venkatesh Raman: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100(3): 155-167 (2000)
58		Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston: On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000)
57		Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy Warnow: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244(1-2): 167-188 (2000)
	1999
56		Rodney G. Downey, Michael R. Fellows, Ulrike Stege: Computational Tractability: The View From Mars. Bulletin of the EATCS 69: 73-97 (1999)
55		Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle: The Parametrized Complexity of Some Fundamental Problems in Coding Theory. SIAM J. Comput. 29(2): 545-570 (1999)
	1998
54		Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege: Analogs and Duals of teh MAST Problem for Sequences and Trees. ESA 1998: 103-114
53		Michael R. Fellows, Michael T. Hallett, Ulrike Stege: On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356
52		R. Balasubramanian, Michael R. Fellows, Venkatesh Raman: An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. 65(3): 163-168 (1998)
51		Michael R. Fellows, Pavol Hell, Karen Seyffarth: Constructions of large planar networks with given degree and diameter. Networks 32(4): 275-281 (1998)
50		Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan: Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998)
49		Rodney G. Downey, Michael R. Fellows: Threshold Dominating Sets and an Improved Characterization of W[2]. Theor. Comput. Sci. 209(1-2): 123-140 (1998)
	1997
48		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: Advice Classes of Parameterized Tractability. Ann. Pure Appl. Logic 84(1): 119-138 (1997)
47		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the parameterized complexity of short computation and factorization. Arch. Math. Log. 36(4-5): 321-337 (1997)
46		Bruno Courcelle, Rodney G. Downey, Michael R. Fellows: A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. UCS 3(11): 1194-1198 (1997)
	1996
45		Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans: Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391
44		Marco Cesati, Michael R. Fellows: Sparse Parameterized Problems. Ann. Pure Appl. Logic 82(1): 1-15 (1996)
43		Kevin Cattell, Michael J. Dinneen, Michael R. Fellows: A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. Inf. Process. Lett. 57(4): 197-203 (1996)
	1995
42		Kevin Cattell, Michael J. Dinneen, Michael R. Fellows: Obstructions to Within a Few Vertices or Edges of Acyclic. WADS 1995: 415-427
41		Michael R. Fellows, Jan Kratochvíl, Martin Middendorf, Frank Pfeiffer: The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995)
40		Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Logic 73(3): 235-276 (1995)
39		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1): 49-57 (1995)
38		Michael R. Fellows, Pavol Hell, Karen Seyffarth: Large Planar Graphs with Given Diameter and Maximum Degree. Discrete Applied Mathematics 61(2): 133-153 (1995)
37		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP. Inf. Comput. 123(1): 38-49 (1995)
36		Samir Khuller, Balaji Raghavachari, Michael R. Fellows: Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24(4): 859-872 (1995)
35		Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput. 24(4): 873-921 (1995)
34		Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci. 141(1&2): 109-131 (1995)
33		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. 147(1&2): 31-54 (1995)
	1994
32		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30
31		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520
30		Michael R. Fellows, Michael A. Langston: On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. J. Comput. Syst. Sci. 49(3): 769-779 (1994)
29		Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: The Private Neighbor Cube. SIAM J. Discrete Math. 7(1): 41-47 (1994)
	1993
28		Michael R. Fellows, Neal Koblitz: Fixed-Parameter Complexity and Cryptography. AAECC 1993: 121-131
27		Rodney G. Downey, Patricia A. Evans, Michael R. Fellows: Parameterized Learning Complexity. COLT 1993: 51-57
26		Michael R. Fellows, Michael T. Hallett, Harold T. Wareham: DNA Physical Mapping: Three Ways Difficult. ESA 1993: 157-168
25		Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385
	1992
24		Michael R. Fellows, Neal Koblitz: Kid Krypto. CRYPTO 1992: 371-389
23		Rodney G. Downey, Michael R. Fellows: Fixed Parameter Tractability and Completeness. Complexity Theory: Current Research 1992: 191-225
22		Hans L. Bodlaender, Michael R. Fellows, Tandy Warnow: Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283
21		Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson: Parallel Self-Reducibility. ICCI 1992: 67-70
20		Michael R. Fellows, Neal Koblitz: Self-Witnessing Polynomial-Time Complexity and Prime Factorization. Structure in Complexity Theory Conference 1992: 107-110
19		Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability. Structure in Complexity Theory Conference 1992: 36-49
18		Michael R. Fellows, Neal Koblitz: Self-Witnessing Polynomial-Time Complexity and Prime Factorization. Des. Codes Cryptography 2(3): 231-235 (1992)
17		Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton: Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41(2): 218-220 (1992)
16		Michael R. Fellows, Michael A. Langston: On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. SIAM J. Discrete Math. 5(1): 117-126 (1992)
	1991
15		Michael J. Dinneen, Michael R. Fellows, Vance Faber: Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158
14		Michael R. Fellows, Michael A. Langston: Constructivity Issues in Graph Algorithms. Constructivity in Computer Science 1991: 150-158
13		Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer: Induced minors and related problems. Graph Structure Theory 1991: 179-182
12		Karl R. Abrahamson, Michael R. Fellows: Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-564
11		Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret: Constructive complexity. Discrete Applied Mathematics 34(1-3): 3-16 (1991)
	1990
10		Michael R. Fellows: Transversals of Vertex Partitions in Graphs. SIAM J. Discrete Math. 3(2): 206-215 (1990)
	1989
9		Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata: On the Complexity of Fixed Parameter Problems (Extended Abstract) FOCS 1989: 210-215
8		Michael R. Fellows, Michael A. Langston: An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) FOCS 1989: 520-525
7		Michael R. Fellows, Michael A. Langston: On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) STOC 1989: 501-512
6		Daniel J. Kleitman, Michael R. Fellows: Radius and diameter in Manhattan lattices. Discrete Mathematics 73(1-2): 119-125 (1989)
	1988
5		Michael R. Fellows, Michael A. Langston: Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. AWOC 1988: 278-287
4		Michael R. Fellows, Donald K. Friesen, Michael A. Langston: On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988)
3		Michael R. Fellows, Michael A. Langston: Processor Utilization in a Linearly Connected Parallel Processing System. IEEE Trans. Computers 37(5): 594-603 (1988)
2		Michael R. Fellows, Michael A. Langston: Nonconstructive tools for proving polynomial-time decidability. J. ACM 35(3): 727-739 (1988)
	1987
1		Michael R. Fellows, Michael A. Langston: Nonconstructive Advances in Polynomial-Time Complexity. Inf. Process. Lett. 26(3): 155-162 (1987)

Coauthor Index

1	Karl R. Abrahamson	[9] [11] [12] [21] [25] [40]
2	Faisal N. Abu-Khzam	[92] [111]
3	Jochen Alber	[64] [69] [72] [84] [94]
4	R. Balasubramanian	[52]
5	Timothy C. Bell (Tim Bell)	[78]
6	Nadja Betzler	[128] [129] [142]
7	Hans L. Bodlaender	[22] [32] [33] [39] [45] [57] [82] [108] [115] [123] [127] [132]
8	Kevin Burrage	[106]
9	Liming Cai	[31] [37] [47] [48] [110]
10	Lowell Campbell	[17]
11	Gunnar E. Carlsson	[17]
12	Kevin Cattell	[42] [43] [58] [62]
13	Marco Cesati	[44]
14	Jianer Chen	[31] [37] [47] [48] [75] [89] [95]
15	Benny Chor	[85] [89] [95] [116]
16	Rebecca L. Collins	[92]
17	Bruno Courcelle	[46]
18	Frank K. H. A. Dehne	[79] [87] [93] [98] [104] [109]
19	Michael J. Dinneen	[15] [17] [42] [43] [58] [62]
20	Michael Dom	[134]
21	Rodney G. Downey (Rod Downey)	[19] [23] [25] [27] [31] [32] [33] [34] [35] [37] [39] [40] [46] [47] [48] [49] [50] [55] [56] [58] [59] [63] [77] [93] [107] [118] [119] [127]
22	Vida Dujmovic	[66] [67] [102] [121]
23	John A. Ellis	[9] [71] [83]
24	Vladimir Estivill-Castro	[77] [99] [106]
25	Patricia A. Evans	[27] [45]
26	Vance Faber	[15] [17]
27	Hongbing Fan	[64] [71] [83] [94]
28	Henning Fernau	[64] [94] [104] [130]
29	Guillaume Fertin	[112]
30	Fedor V. Fomin	[117] [120] [138] [139]
31	Gerd Fricke	[29]
32	Donald K. Friesen	[4]
33	Jens Gramm	[70] [73] [101]
34	Jiong Guo	[129] [133] [135] [136] [141] [142]
35	Michael T. Hallett	[26] [39] [53] [54] [57] [66] [67] [76] [102]
36	Tzvika Hartman	[140]
37	Stephen T. Hedetniemi	[29]
38	Pinar Heggernes	[86] [123]
39	Pavol Hell	[38] [51]
40	Danny Hermelin	[112] [124] [127] [131] [140]
41	Xiuzhen Huang	[89] [95]
42	David Pokrass Jacobs	[29]
43	David W. Juedes	[85] [89] [95] [110]
44	Iyad A. Kanj	[89] [95]
45	Samir Khuller	[36]
46	Matthew Kitching	[66] [67] [102] [121]
47	Daniel J. Kleitman	[6]
48	Christian Knauer	[90] [122]
49	Neal Koblitz	[18] [20] [24] [28] [78]
50	Christian Komusiewicz	[128] [141]
51	Chantal Korostensky	[54]
52	Jan Kratochvíl	[13] [41]
53	Gad M. Landau	[140]
54	Michael A. Langston	[1] [2] [3] [4] [5] [7] [8] [11] [14] [16] [17] [30] [58] [92] [98] [99] [106] [108] [109] [111] [113] [115] [119]
55	Giuseppe Liotta	[66] [67] [102] [121]
56	Daniel Lokshtanov	[117] [120] [126] [138] [139]
57	Elena Losievskaja	[120] [139]
58	Shev Mac	[106]
59	Federico Mancini	[123]
60	Manuel E. Mata	[9]
61	Catherine McCartin	[60] [66] [67] [74] [102] [107] [118] [121]
62	Daniel Meister	[125]
63	Martin Middendorf	[41]
64	Matthias Middendorf	[13]
65	Neeldhara Misra	[126]
66	James W. Moore	[17]
67	Bernard M. E. Moret	[11]
68	Hannes Moser	[133] [135] [136]
69	Moritz Müller	[124]
70	Andrew P. Mullhaupt	[17]
71	Rolf Niedermeier	[64] [69] [70] [72] [73] [84] [94] [101] [128] [129] [133] [135] [136] [141] [142]
72	Naomi Nishimura	[66] [67] [90] [102] [121] [122]
73	Charis Papadopoulos	[123]
74	Frank Pfeiffer	[13] [41]
75	Matthew Powell	[78]
76	Elena Prieto	[77] [104]
77	Mark A. Ragan	[108] [115] [116]
78	Prabhakar Ragde	[66] [67] [90] [102] [121] [122]
79	Balaji Raghavachari	[36]
80	Venkatesh Raman	[52] [59]
81	Igor Razgon	[116]
82	Kenneth W. Regan	[50]
83	Frances A. Rosamond	[60] [64] [66] [67] [77] [79] [86] [87] [90] [94] [96] [97] [98] [99] [102] [103] [104] [106] [108] [109] [110] [113] [114] [115] [116] [117] [118] [120] [121] [122] [123] [124] [125] [126] [129] [131] [134] [138] [139] [140] [142]
84	Udi Rotics	[96] [97] [103]
85	Liat Rozenberg	[140]
86	Saket Saurabh	[117] [120] [126] [138] [139]
87	Harlan B. Sexton	[17]
88	Karen Seyffarth	[38] [51]
89	Peter Shaw	[87] [113]
90	Christian Sloper	[86]
91	Sagi Snir	[116]
92	R. Sritharan	[125]
93	Ulrike Stege	[53] [54] [56] [60] [64] [76] [90] [94] [122]
94	Kim Stevens	[98] [109]
95	Matthew Suderman (Matthew J. Suderman)	[66] [67] [102]
96	W. Henry Suters	[92] [111]
97	Christopher T. Symons	[92]
98	Stefan Szeider	[88] [96] [97] [100] [103] [117]
99	Jan Arne Telle	[86] [125]
100	Dimitrios M. Thilikos	[82] [90] [122] [132]
101	Harold W. Thimbleby	[78]
102	Carsten Thomassen	[117]
103	Johannes Uhlmann	[141]
104	Alexander Vardy	[55]
105	Stéphane Vialette	[112] [131]
106	Yngve Villanger	[138]
107	Todd Wareham (Harold T. Wareham)	[26] [32] [33] [39] [57]
108	Tandy Warnow	[22] [57]
109	Mark Weyer	[108] [115]
110	Sue Whitesides	[66] [67] [90] [102] [121] [122]
111	Geoff Whittle (Geoffrey P. Whittle)	[55]
112	Christopher B. Wilson	[21]
113	Ian H. Witten	[78]
114	David R. Wood	[66] [67] [102] [121]
115	Graham Wrightson	[88] [100]
116	Ge Xia	[89] [95]

Colors in the list of coauthors