dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Michael R. Fellows Home Page Coauthor index pubzone.org

Mike Fellows

The University of Newcastle, NSW, Australia

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
179Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar: The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62(1-2): 564-594 (2012)
178Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Danny Hermelin, Frances A. Rosamond: Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1): 3-18 (2012)
177Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger: Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3): 707-719 (2012)
176Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012)
2011
175Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Recent Developments in the Theory of Pre-processing. FAW-AAIM 2011: 4-5
174Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240
173Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527
172Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Morgan Chopin, Michael R. Fellows: Parameterized Complexity of the Firefighter Problem. ISAAC 2011: 643-652
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61(2): 362-388 (2011)
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe: Control Complexity in Bucklin and Fallback Voting CoRR abs/1103.2230: (2011)
169Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Henning Fernau: Facility location problems: A parameterized view. Discrete Applied Mathematics 159(11): 1118-1130 (2011)
168Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Fedor V. Fomin, Gregory Gutin: Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1): 1 (2011)
167Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-based data clustering with overlaps. Discrete Optimization 8(1): 2-17 (2011)
166Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1296-1308 (2011)
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. IEEE/ACM Trans. Comput. Biology Bioinform. 8(6): 1692-1699 (2011)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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. Inf. Comput. 209(2): 143-153 (2011)
163Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011)
162Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77(6): 1141-1158 (2011)
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. TOCT 2(2): 5 (2011)
2010
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu: A Linear Kernel for Co-Path/Cycle Packing. AAIM 2010: 90-102
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh: Determining the Winner of a Dodgson Election is Hard. FSTTCS 2010: 459-468
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. IPEC 2010: 123-134
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu: Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG 2010: 123-134
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Erdélyi, Michael R. Fellows: Parameterized Control Complexity in Fallback Voting CoRR abs/1004.3659: (2010)
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers CoRR abs/1007.2021: (2010)
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Iyad A. Kanj: The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76(8): 727-740 (2010)
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010)
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond: W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010)
2009
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. IWOCA 2009: 2-10
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý: What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Danny Hermelin, Frances A. Rosamond: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Dom, Michael R. Fellows, Frances A. Rosamond: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Iyad A. Kanj: The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR abs/0902.2149: (2009)
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu: Abstract Milling with Turn Costs CoRR abs/0912.1050: (2009)
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009)
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-Width is NP-Complete. SIAM J. Discrete Math. 23(2): 909-939 (2009)
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009)
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45(4): 822-848 (2009)
2008
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Henning Fernau: Facility Location Problems: A Parameterized View. AAIM 2008: 188-199
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVida 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)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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)
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenny 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
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Frances A. Rosamond: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE 2007: 268-277
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw: Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFaisal 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)
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLiming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond: The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41(3): 459-477 (2007)
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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
109no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Kernelization for Convex Recoloring. ACiD 2006: 23-35
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows, Catherine McCartin: Parameterized Approximation Problems. IWPEC 2006: 121-129
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin 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
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: The Lost Continent of Polynomial Time: Preprocessing and Kernelization. IWPEC 2006: 276-277
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVida 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)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jens Gramm, Rolf Niedermeier: On The Parameterized Intractability Of Motif Search Problems. Combinatorica 26(2): 141-167 (2006)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Stefan Szeider, Graham Wrightson: On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006)
2005
100no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond: FPT is P-Time Extremal Structure I. ACiD 2005: 1-41
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer 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)
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen 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
94no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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
93no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFaisal 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
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. ESA 2004: 1-2
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer 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
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Stefan Szeider, Graham Wrightson: On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle: Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenny 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
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Alber, Michael R. Fellows, Rolf Niedermeier: Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn 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
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. WADS 2003: 505-520
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. WG 2003: 1-12
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond: An FPT Algorithm for Set Splitting. WG 2003: 180-191
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTim Bell, Harold W. Thimbleby, Mike Fellows, Ian H. Witten, Neal Koblitz, Matthew Powell: Explaining cryptographic systems. Computers & Education 40(3): 199-215 (2003)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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: 209-222 (2003)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael T. Hallett, Ulrike Stege: Analogs & duals of the MAST problem for sequences & trees. J. Algorithms 49(1): 192-216 (2003)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer Chen, Michael R. Fellows: Foreword from the guest editors. J. Comput. Syst. Sci. 67(4): 653 (2003)
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Catherine McCartin: On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 2(298): 317-324 (2003)
2002
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTim Bell, Ian H. Witten, Michael R. Fellows: Computer Science Unplugged - an enrichment and extension programme for primary-aged children. csunplugged.org 2002: I-IV, 1-105
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jens Gramm, Rolf Niedermeier: On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Alber, Michael R. Fellows, Rolf Niedermeier: Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. SWAT 2002: 150-159
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn A. Ellis, Hongbing Fan, Michael R. Fellows: The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. SWAT 2002: 180-189
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jens Gramm, Rolf Niedermeier: Parameterized Intractability of Motif Search Problems CoRR cs.CC/0205056: (2002)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Alber, Michael R. Fellows, Rolf Niedermeier: Polynomial Time Data Reduction for Dominating Set CoRR cs.DS/0207066: (2002)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Parameterized Complexity: The Main Ideas and Connections to Practical Computing. Electr. Notes Theor. Comput. Sci. 61: 1-19 (2002)
2001
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVida 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
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVida 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
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Parameterized Complexity: The Main Ideas and Some Research Frontiers. ISAAC 2001: 291-307
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen 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
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows: Index sets and parametric reductions. Arch. Math. Log. 40(5): 329-348 (2001)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Dinneen, Kevin Cattell, Michael R. Fellows: Forbidden minors to graphs with small feedback sets. Discrete Mathematics 230(1-3): 215-252 (2001)
2000
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Parameterized Complexity: The Main Ideas and Connections to Practical Computing. Experimental Algorithmics 2000: 51-77
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows, Venkatesh Raman: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100(3): 155-167 (2000)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin 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)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
56no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows, Ulrike Stege: Computational Tractability: The View From Mars. Bulletin of the EATCS 69: 73-97 (1999)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege: Analogs and Duals of the MAST Problem for Sequences and Trees. ESA 1998: 103-114
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael T. Hallett, Ulrike Stege: On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Balasubramanian, Michael R. Fellows, Venkatesh Raman: An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. 65(3): 163-168 (1998)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Pavol Hell, Karen Seyffarth: Constructions of large planar networks with given degree and diameter. Networks 32(4): 275-281 (1998)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows, Kenneth W. Regan: Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLiming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: Advice Classes of Parameterized Tractability. Ann. Pure Appl. Logic 84(1): 119-138 (1997)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLiming 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)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno 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
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Patricia A. Evans: Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarco Cesati, Michael R. Fellows: Sparse Parameterized Problems. Ann. Pure Appl. Logic 82(1): 1-15 (1996)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin 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
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin Cattell, Michael J. Dinneen, Michael R. Fellows: Obstructions to Within a Few Vertices or Edges of Acyclic. WADS 1995: 415-427
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jan Kratochvíl, Martin Middendorf, Frank Pfeiffer: The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl 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)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Pavol Hell, Karen Seyffarth: Large Planar Graphs with Given Diameter and Maximum Degree. Discrete Applied Mathematics 61(2): 133-153 (1995)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLiming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP. Inf. Comput. 123(1): 38-49 (1995)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput. 24(4): 873-921 (1995)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney 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)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLiming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. J. Comput. Syst. Sci. 49(3): 769-779 (1994)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: The Private Neighbor Cube. SIAM J. Discrete Math. 7(1): 41-47 (1994)
1993
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Neal Koblitz: Fixed-Parameter Complexity and Cryptography. AAECC 1993: 121-131
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Patricia A. Evans, Michael R. Fellows: Parameterized Learning Complexity. COLT 1993: 51-57
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael T. Hallett, Harold T. Wareham: DNA Physical Mapping: Three Ways Difficult. ESA 1993: 157-168
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385
1992
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLS. Rao Kosaraju, Mike Fellows, Avi Wigderson, John A. Ellis: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada ACM 1992
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Neal Koblitz: Kid Krypto. CRYPTO 1992: 371-389
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows: Fixed Parameter Tractability and Completeness. Complexity Theory: Current Research 1992: 191-225
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Tandy Warnow: Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson: Parallel Self-Reducibility. ICCI 1992: 67-70
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Neal Koblitz: Self-Witnessing Polynomial-Time Complexity and Prime Factorization. Structure in Complexity Theory Conference 1992: 107-110
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability. Structure in Complexity Theory Conference 1992: 36-49
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Neal Koblitz: Self-Witnessing Polynomial-Time Complexity and Prime Factorization. Des. Codes Cryptography 2(3): 231-235 (1992)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLowell 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Dinneen, Michael R. Fellows, Vance Faber: Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: Constructivity Issues in Graph Algorithms. Constructivity in Computer Science 1991: 150-158
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer: Induced minors and related problems. Graph Structure Theory 1991: 179-182
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl R. Abrahamson, Michael R. Fellows: Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-564
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret: Constructive complexity. Discrete Applied Mathematics 34(1-3): 3-16 (1991)
1990
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows: Transversals of Vertex Partitions in Graphs. SIAM J. Discrete Math. 3(2): 206-215 (1990)
1989
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata: On the Complexity of Fixed Parameter Problems (Extended Abstract) FOCS 1989: 210-215
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) STOC 1989: 501-512
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Kleitman, Michael R. Fellows: Radius and diameter in Manhattan lattices. Discrete Mathematics 73(1-2): 119-125 (1989)
1988
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. AWOC 1988: 278-287
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Donald K. Friesen, Michael A. Langston: On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: Processor Utilization in a Linearly Connected Parallel Processing System. IEEE Trans. Computers 37(5): 594-603 (1988)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: Nonconstructive tools for proving polynomial-time decidability. J. ACM 35(3): 727-739 (1988)
1987
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Michael A. Langston: Nonconstructive Advances in Polynomial-Time Complexity. Inf. Process. Lett. 26(3): 155-162 (1987)

Coauthor Index

1Karl R. Abrahamson [9] [11] [12] [21] [26] [40]
2Faisal N. Abu-Khzam [93] [112]
3Jochen Alber [64] [69] [72] [85] [95]
4R. Balasubramanian [52]
5Cristina Bazgan [172]
6Timothy C. Bell (Tim Bell) [74] [79]
7Nadja Betzler [129] [130] [133] [151] [166]
8René van Bevern [166]
9Hans L. Bodlaender [22] [33] [34] [39] [45] [57] [83] [109] [116] [124] [128] [136] [137] [153] [171]
10Kevin Burrage [107]
11Liming Cai [32] [37] [47] [48] [111]
12Lowell Campbell [17]
13Gunnar E. Carlsson [17]
14Kevin Cattell [42] [43] [58] [62]
15Marco Cesati [44]
16Jianer Chen [32] [37] [47] [48] [76] [90] [96]
17Zhi-Zhong Chen [160]
18Morgan Chopin [172]
19Benny Chor [86] [90] [96] [117]
20Rebecca L. Collins [93]
21Bruno Courcelle [46]
22Robert Crowston [174]
23Frank K. H. A. Dehne (Frank Dehne) [80] [88] [94] [99] [105] [110]
24Michael J. Dinneen [15] [17] [42] [43] [58] [62]
25Michael Dom [141] [179]
26Rodney G. Downey (Rod Downey) [19] [23] [26] [28] [32] [33] [34] [35] [36] [37] [39] [40] [46] [47] [48] [49] [50] [55] [56] [58] [59] [63] [78] [94] [108] [119] [120] [128] [136]
27Vida Dujmovic [66] [67] [103] [122]
28John A. Ellis [9] [25] [71] [84]
29Rosa Enciso [145]
30Gábor Erdélyi [156] [170]
31Vladimir Estivill-Castro [78] [100] [107]
32Patricia A. Evans [28] [45]
33Vance Faber [15] [17]
34Hongbing Fan [64] [71] [84] [95]
35Henning Fernau [64] [95] [105] [131] [169]
36Guillaume Fertin [113] [163]
37Jörg Flum [152]
38Fedor V. Fomin [118] [121] [147] [148] [164] [168] [177]
39Gerd Fricke [30]
40Tobias Friedrich [173]
41Donald K. Friesen [4]
42Bin Fu [160]
43Serge Gaspers [155] [158] [176]
44Panos Giannopoulos [138] [157]
45Jens Gramm [70] [73] [102]
46Jiong Guo [130] [133] [139] [140] [142] [143] [145] [150] [151] [154] [161] [162] [167]
47Gregory Gutin [168] [174]
48Michael T. Hallett [27] [39] [53] [54] [57] [66] [67] [77] [103]
49Tzvika Hartman [149] [165]
50Stephen T. Hedetniemi [30]
51Pinar Heggernes [87] [124] [153]
52Pavol Hell [38] [51]
53Danny Hermelin [113] [125] [128] [134] [136] [144] [149] [152] [163] [165] [173] [178]
54Xiuzhen Huang [90] [96]
55David Pokrass Jacobs [30]
56Bart M. P. Jansen [159]
57Haitao Jiang [160]
58Mark Jones [174]
59David W. Juedes [86] [90] [96] [111]
60Iyad A. Kanj [90] [96] [140] [145] [154]
61Matthew Kitching [66] [67] [103] [122]
62Daniel J. Kleitman [6]
63Christian Knauer [91] [123] [138] [157]
64Neal Koblitz [18] [20] [24] [29] [79]
65Christian Komusiewicz [129] [150] [166] [167]
66Chantal Korostensky [54]
67S. Rao Kosaraju [25]
68Jan Kratochvíl [13] [41]
69Gad M. Landau [149] [165]
70Michael A. Langston [1] [2] [3] [4] [5] [7] [8] [11] [14] [16] [17] [31] [58] [93] [99] [100] [107] [109] [110] [112] [114] [116] [120] [171]
71Giuseppe Liotta [66] [67] [103] [122]
72Yang Liu [160]
73Daniel Lokshtanov [118] [121] [127] [132] [147] [148] [159] [164] [177]
74Elena Losievskaja [121] [148]
75Shev MacNamara (Shev Mac) [107]
76Federico Mancini [124] [153]
77Manuel E. Mata [9]
78Catherine McCartin [60] [66] [67] [75] [103] [108] [119] [122]
79Daniel Meister [126]
80Martin Middendorf [41]
81Matthias Middendorf [13]
82Neeldhara Misra [127] [132]
83Matthias Mnich [132]
84James W. Moore [17]
85Bernard M. E. Moret [11]
86Hannes Moser [139] [142] [143] [161] [162]
87Moritz Müller [125] [152]
88Andrew P. Mullhaupt [17]
89Nina Narodytska [173]
90Rolf Niedermeier [64] [69] [70] [72] [73] [85] [95] [102] [129] [130] [133] [139] [142] [143] [150] [151] [161] [162] [166] [167]
91Naomi Nishimura [66] [67] [91] [103] [122] [123]
92Charis Papadopoulos [124] [153]
93Christophe Paul [138] [157]
94Frank Pfeiffer [13] [41]
95Matthew Powell [79]
96Elena Prieto [78] [105]
97Mark A. Ragan [109] [116] [117] [171]
98Prabhakar Ragde [66] [67] [91] [103] [122] [123]
99Venkatesh Raman [52] [59]
100Igor Razgon [117]
101Kenneth W. Regan [50]
102Frances A. Rosamond [60] [64] [66] [67] [78] [80] [87] [88] [91] [95] [97] [98] [99] [100] [103] [104] [105] [107] [109] [110] [111] [114] [115] [116] [117] [118] [119] [121] [122] [123] [124] [125] [126] [127] [130] [132] [133] [134] [135] [138] [141] [144] [145] [147] [148] [149] [151] [152] [153] [155] [157] [158] [159] [164] [165] [171] [173] [174] [176] [177] [178] [179]
103Jörg Rothe [170]
104Udi Rotics [97] [98] [104] [135]
105Liat Rozenberg [149] [165]
106Saket Saurabh [118] [121] [127] [132] [147] [148] [159] [164] [177]
107Lena Schend (Lena Piras) [170]
108Harlan B. Sexton [17]
109Karen Seyffarth [38] [51]
110Peter Shaw [88] [114]
111Somnath Sikdar [179]
112Christian Sloper [87]
113Sagi Snir [117]
114R. Sritharan [126]
115Ulrike Stege [53] [54] [56] [60] [64] [77] [91] [95] [123]
116Kim Stevens [99] [110]
117Ondrej Suchý [145]
118Matthew Suderman (Matthew J. Suderman) [66] [67] [103]
119W. Henry Suters [93] [112]
120Christopher T. Symons [93]
121Stefan Szeider [89] [97] [98] [101] [104] [118] [135] [164]
122Jan Arne Telle [87] [126]
123Dimitrios M. Thilikos [83] [91] [123] [137]
124Harold W. Thimbleby [79]
125Stéphan Thomassé [174]
126Carsten Thomassen [118] [164]
127Johannes Uhlmann [150] [167]
128Alexander Vardy [55]
129Stéphane Vialette [113] [134] [163]
130Yngve Villanger [147] [177]
131Lusheng Wang [160]
132Todd Wareham (Harold T. Wareham) [27] [33] [34] [39] [57]
133Tandy Warnow [22] [57]
134Mark Weyer [109] [116] [171]
135Sue Whitesides [66] [67] [91] [103] [122] [123] [138] [157]
136Geoff Whittle (Geoffrey P. Whittle) [55]
137Avi Wigderson [25]
138Christopher B. Wilson [21]
139Ian H. Witten [74] [79]
140David R. Wood [66] [67] [103] [122]
141Graham Wrightson [89] [101]
142Ge Xia [90] [96]
143Anders Yeo [174]
144Nathan Yu [138] [157]
145Binhai Zhu [160]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page