Michael R. Fellows

Frances A. Rosamond

Peter Shaw

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Sue Whitesides

Proceedings of the Algorithms, 2004

A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

Tight Lower Bounds for Certain Parameterized NP-Hard Problems.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.

[BibT_eX]

Christopher T. Symons

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

On the parametric complexity of schedules to minimize tardy tasks.

[BibT_eX]

[DOI]

Catherine McCartin

Theor. Comput. Sci., 2003

Foreword from the guest editors.

[BibT_eX]

[DOI]

Jianer Chen

J. Comput. Syst. Sci., 2003

Analogs & duals of the MAST problem for sequences & trees.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.

[BibT_eX]

[DOI]

Vladimir Estivill-Castro

Elena Prieto-Rodriguez

Frances A. Rosamond

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

Explaining cryptographic systems.

[BibT_eX]

[DOI]

Comput. Educ., 2003

Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

An FPT Algorithm for Set Splitting.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Frances A. Rosamond

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.

[BibT_eX]

[DOI]

John A. Ellis

Hongbing Fan

Proceedings of the Algorithm Theory, 2002

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.

[BibT_eX]

[DOI]

Jochen Alber

Rolf Niedermeier

Proceedings of the Algorithm Theory, 2002

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.

[BibT_eX]

[DOI]

Jens Gramm

Rolf Niedermeier

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Computer Science Unplugged - an enrichment and extension programme for primary-aged children.

[BibT_eX]

[DOI]

Tim Bell

Ian H. Witten

csunplugged.org, 2002

2001

Forbidden minors to graphs with small feedback sets.

[BibT_eX]

[DOI]

Kevin Cattell

Discret. Math., 2001

Index sets and parametric reductions.

[BibT_eX]

[DOI]

Arch. Math. Log., 2001

Refined Search Tree Technique for DOMINATING SET on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Parameterized Complexity: The Main Ideas and Some Research Frontiers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

On computing graph minor obstruction sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The complexity of irredundant sets parameterized by size.

[BibT_eX]

[DOI]

Venkatesh Raman

Discret. Appl. Math., 2000

Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Parameterized Complexity: The Main Ideas and Connections to Practical Computing.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithmics, 2000

1999

Parameterized Complexity

[BibT_eX]

[DOI]

Monographs in Computer Science, Springer, ISBN: 038794883X, 1999

The Parametrized Complexity of Some Fundamental Problems in Coding Theory.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Computational Tractability: The View From Mars.

[BibT_eX]

Bull. EATCS, 1999

1998

Parameterized Circuit Complexity and the W Hierarchy.

[BibT_eX]

[DOI]

Kenneth W. Regan

Theor. Comput. Sci., 1998

Threshold Dominating Sets and an Improved Characterization of W[2].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Constructions of large planar networks with given degree and diameter.

[BibT_eX]

[DOI]

Pavol Hell

Karen Seyffarth

Networks, 1998

An Improved Fixed-Parameter Algorithm for Vertex Cover.

[BibT_eX]

[DOI]

R. Balasubramanian

Venkatesh Raman

Inf. Process. Lett., 1998

On the Multiple Gene Duplication Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Analogs and Duals of the MAST Problem for Sequences and Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.

[BibT_eX]

[DOI]

Bruno Courcelle

J. Univers. Comput. Sci., 1997

Advice Classes of Parameterized Tractability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

On the parameterized complexity of short computation and factorization.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

Parameterized complexity: A framework for systematically confronting computational intractability.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Vertex transversals that dominate.

[BibT_eX]

[DOI]

Noga Alon

Donovan R. Hare

J. Graph Theory, 1996

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.

[BibT_eX]

[DOI]

Kevin Cattell

Inf. Process. Lett., 1996

Sparse Parameterized Problems.

[BibT_eX]

[DOI]

Marco Cesati

Ann. Pure Appl. Log., 1996

The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1].

[BibT_eX]

Udayan Taylor

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

Descriptive complexity and the W hierarchy.

[BibT_eX]

[DOI]

Kenneth W. Regan

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

Finite-State Computability of Annotations of Strings and Trees.

[BibT_eX]

[DOI]

Patricia A. Evans

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

Fixed-Parameter Tractability and Completeness II: On Completeness for W[1].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Fixed-Parameter Tractability and Completeness I: Basic Results.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

W[2]-hardness of precedence constrained K-processor scheduling.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

On the Structure of Parameterized Problems in NP.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Large Planar Graphs with Given Diameter and Maximum Degree.

[BibT_eX]

[DOI]

Pavol Hell

Karen Seyffarth

Discret. Appl. Math., 1995

Parameterized complexity analysis in computational biology.

[BibT_eX]

[DOI]

Comput. Appl. Biosci., 1995

Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

The Complexity of Induced Minors and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 1995

Obstructions to Within a Few Vertices or Edges of Acyclic.

[BibT_eX]

[DOI]

Kevin Cattell

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

The Private Neighbor Cube.

[BibT_eX]

[DOI]

Gerd Fricke

Stephen T. Hedetniemi

David Pokrass Jacobs

SIAM J. Discret. Math., 1994

On Search, Decision, and the Efficiency of Polynomial-Time Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

On the Structure of Parameterized Problems in NP (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

The Parameterized Complexity of Some Problems in Logic and Linguistics.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

The Parameterized Complexity of Sequence Alignment and Consensus.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Fixed-Parameter Intractability II (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

DNA Physical Mapping: Three Ways Difficult.

[BibT_eX]

[DOI]

Harold T. Wareham

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Parameterized Learning Complexity.

[BibT_eX]

[DOI]

Patricia A. Evans

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Fixed-Parameter Complexity and Cryptography.

[BibT_eX]

[DOI]

Neal Koblitz

Proceedings of the Applied Algebra, 1993

1992

Small Diameter Symmetric Networks from Linear Groups.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Parallel Self-Reducibility.

[BibT_eX]

Christopher B. Wilson

Proceedings of the Computing and Information, 1992

Two Strikes Against Perfect Phylogeny.

[BibT_eX]

[DOI]

Tandy J. Warnow

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Implementing the Standards: Let's Focus on the First Four.

[BibT_eX]

[DOI]

Nancy Casey

Proceedings of the Discrete Mathematics in the Schools, 1992

Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy.

[BibT_eX]

Proceedings of the Complexity Theory: Current Research, 1992

Kid Krypto.

[BibT_eX]

[DOI]

Neal Koblitz

Proceedings of the Advances in Cryptology, 1992

Self-Witnessing Polynomial-Time Complexity and Prime Factorization.

[BibT_eX]

[DOI]

Neal Koblitz

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

Fixed-Parameter Intractability.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

Fast search algorithms for layout permutation problems.

[BibT_eX]

[DOI]

Integr., 1991

Constructive complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Perfect domination.

[BibT_eX]

[DOI]

Mark N. Hoover

Australas. J Comb., 1991

On the complexity and combinatorics of covering finite complexes.

[BibT_eX]

[DOI]

James Abello

John Stillwell

Australas. J Comb., 1991

Induced minors and related problems.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Finite automata, bounded treewidth, and well-quasiordering.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Constructivity Issues in Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Constructivity in Computer Science, 1991

Algebraic Constructions of Efficient Broadcast Networks.

[BibT_eX]

[DOI]

Vance Faber

Proceedings of the Applied Algebra, 1991

1990

Transversals of Vertex Partitions in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

1989

Radius and diameter in Manhattan lattices.

[BibT_eX]

[DOI]

Daniel J. Kleitman

Discret. Math., 1989

On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On the Complexity of Fixed Parameter Problems (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation.

[BibT_eX]

[DOI]

Nancy G. Kinnersley

Proceedings of the Computers and Mathematics, 1989

1988

Processor Utilization in a Linearly Connected Parallel Processing System.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1988

Nonconstructive tools for proving polynomial-time decidability.

[BibT_eX]

[DOI]

J. ACM, 1988

On Finding Optimal and Near-Optimal Lineal Spanning Trees.

[BibT_eX]

[DOI]

Donald K. Friesen

Algorithmica, 1988

Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Nonconstructive Advances in Polynomial-Time Complexity.

[BibT_eX]

[DOI]