A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

article published in 2009

A Fixed-Parameter Approach to 2-Layer Planarization

A Linear Kernel for Co-Path/Cycle Packing

A Purely Democratic Characterization of W[1]

A generalization of Nemhauser and Trotterʼs local optimization theorem

A refined search tree technique for Dominating Set on planar graphs

scholarly article by Jochen Alber et al published November 2005 in Journal of Computer and System Sciences

A simple linear-time algorithm for finding path-decompositions of small width

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

Analogs & duals of the MAST problem for sequences & trees

article

Beyond NP-completeness for problems of bounded width (extended abstract)

Clique-Width is NP-Complete

article by Michael R. Fellows et al published January 2009 in SIAM Journal on Discrete Mathematics

Clustering with Partial Information

article published in Lecture Notes in Computer Science

Clustering with partial information

article by Hans L. Bodlaender et al published February 2010 in Theoretical Computer Science

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Constructive complexity

Counting spanning trees in directed regular multigraphs

Crown Structures for Vertex Cover Kernelization

Cutting Up Is Hard To Do

Derivation of algorithms for cutwidth and related graph layout parameters

scholarly article by Hans L. Bodlaender et al published June 2009 in Journal of Computer and System Sciences

Distortion Is Fixed Parameter Tractable

Distortion is Fixed Parameter Tractable

Dynamic dominating set and turbo-charging greedy heuristics

Explaining cryptographic systems

FPT Is Characterized by Useful Obstruction Sets

FPT is characterized by useful obstruction sets

Facility Location Problems: A Parameterized View

Facility location problems: A parameterized view

Fast search algorithms for layout permutation problems

Finite-state computability of annotations of strings and trees (extended abstract)

Fixed-Parameter Algorithms for Kemeny Scores

scholarly article published in Lecture Notes in Computer Science

Fixed-Parameter Tractability and Completeness I: Basic Results

Fixed-parameter algorithms for Kemeny rankings

scholarly article by Nadja Betzler et al published October 2009 in Theoretical Computer Science

Fixed-parameter tractability and completeness II: On completeness for W[1]

Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues

Forbidden minors to graphs with small feedback sets

article published in 2001

Foreword from the guest editors

Graph Layout Problems Parameterized by Vertex Cover

Graph-Based Data Clustering with Overlaps

Graph-based data clustering with overlaps

Haplotype Inference Constrained by Plausible Haplotype Data

article by Michael R. Fellows et al published 2009 in Lecture Notes in Computer Science

Haplotype inference constrained by plausible haplotype data

artículo científico publicado en 2011

Index sets and parametric reductions

Large planar graphs with given diameter and maximum degree

Leaf Powers and Their Properties: Using the Trees

article published in 2008

Local search: Is brute-force avoidable?

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective

article published in 2010

Myhill-Nerode Methods for Hypergraphs

Nonconstructive advances in polynomial-time complexity

article

Nonconstructive tools for proving polynomial-time decidability

On Problems without Polynomial Kernels (Extended Abstract)

On The Parameterized Intractability Of Motif Search Problems*

On finding optimal and near-optimal lineal spanning trees

On finding short resolution refutations and small unsatisfiable subsets

On problems without polynomial kernels

On search, decision, and the efficiency of polynomial-time algorithms

scholarly article by Michael R. Fellows & Michael A. Langston published December 1994 in Journal of Computer and System Sciences

On the Complexity of Some Colorful Problems Parameterized by Treewidth

On the Parameterized Complexity of Layered Graph Drawing

On the Structure of Parameterized Problems in NP

On the complexity of some colorful problems parameterized by treewidth

On the galactic number of a hypercube

On the parameterized complexity of multiple-interval graph problems

On the parametric complexity of schedules to minimize tardy tasks

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Parameterized Approximation via Fidelity Preserving Transformations

Parameterized Complexity

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

Parameterized Complexity of the Firefighter Problem

Parameterized Complexity: The Main Ideas and Some Research Frontiers

Parameterized algorithmics for finding connected motifs in biological networks

artículo científico publicado en 2011

Parameterized approximation of dominating set problems

Parameterized complexity of firefighting

scholarly article by Cristina Bazgan et al published November 2014 in Journal of Computer and System Sciences

Parameterizing by the Number of Numbers

Parameterizing by the Number of Numbers

Polynomial-time data reduction for dominating set

article published in 2004

Processor utilization in a linearly connected parallel processing system

Quadratic Kernelization for Convex Recoloring of Trees

Radius and diameter in Manhattan lattices

Recent Developments in the Theory of Pre-processing

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach

scholarly article by R. Crowston et al published June 2014 in Journal of Computer and System Sciences

Self-witnessing polynomial-time complexity and prime factorization

article

Small diameter symmetric networks from linear groups

Sparse parameterized problems

Special Issue on Parameterized Complexity of Discrete Optimization

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

artículo científico publicado en 2009

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

article published in 2007

The Complexity of Polynomial-Time Approximation

The Parameterized Complexity of Some Minimum Label Problems

The Parameterized Complexity of Stabbing Rectangles

The dominating set problem is fixed parameter tractable for graphs of bounded genus

The parameterized complexity of sequence alignment and consensus

The parameterized complexity of some minimum label problems

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology

article

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

Tractable Parameterizations for the Minimum Linear Arrangement Problem

Train Marshalling Is Fixed Parameter Tractable

Transversals of Vertex Partitions in Graphs

scientific article published in May 1990

Upper and lower bounds for finding connected motifs in vertex-colored graphs

W-Hierarchies Defined by Symmetric Gates

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

article by Hans L. Bodlaender & Michael R. Fellows published September 1995 in Operations Research Letters

Welcome Message from the Program Chairs

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

What Makes Equitable Connected Partition Easy

article by Rosa Enciso et al published 2009 in Lecture Notes in Computer Science

nonblocker: Parameterized Algorithmics for minimum dominating set