Parameterized Complexity

Authors:
Rodney G. Downey;M. R. Fellows
Affiliations:
-;-
Venue:
Parameterized Complexity
Year:
2012

Citing 0
Cited 791

Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A polynomial approximation algorithm for the minimum fill-in problem

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The parameterized complexity of database queries

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Monotonic reductions, representative equivalence, and compilation of intractable problems

Journal of the ACM (JACM)
Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Rationality in algebras with a series operation

Information and Computation
Optimally cutting a surface into a disk

Proceedings of the eighteenth annual symposium on Computational geometry
Fixed-parameter complexity in AI and nonmonotonic reasoning

Artificial Intelligence
Perfect code is W[1]-complete

Information Processing Letters
Fixed-parameter complexity of semantics for logic programs

ACM Transactions on Computational Logic (TOCL)
Query evaluation via tree-decompositions

Journal of the ACM (JACM)
Solving multi-granularity temporal constraint networks

Artificial Intelligence
Parameterized complexity of finding subgraphs with hereditary properties

Theoretical Computer Science
Directional Type Checking for Logic Programs: Beyond Discriminative Types

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Fixed-Parameter Complexity of Semantics for Logic Programs

Proceedings of the 17th International Conference on Logic Programming
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Improved Parameterized Algorithms for Planar Dominating Set

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Parameterized Counting Problems

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Coping with the NP-Hardness of the Graph Bandwidth Problem

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Call Control with k Rejections

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Exact Solutions for CLOSEST STRING and Related Problems

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Parameterized Complexity: The Main Ideas and Some Research Frontiers

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Approximation Algorithms for Some Parameterized Counting Problems

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Improved Tree Decomposition Based Algorithms for Domination-like Problems

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Generalized Model-Checking Problems for First-Order Logic

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Parametric Analysis of the State Explosion Problem in Model Checking

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Describing Parameterized Complexity Classes

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking over Locally Tree-Decomposable Classes

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Parameterized Complexity of Finding Subgraphs with Hereditary Properties

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Graph Separators: A Parameterized View

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata

HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Some Prospects for Efficient Fixed Parameter Algorithms

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Bandwidth of Split and Circular Permutation Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Separator Algorithms: A Refined Analysis

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Identification of Function Distinguishable Languages

ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Minimum Quartet Inconsistency Is Fixed Parameter Tractable

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Descriptive and Parameterized Complexity

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Analogs and Duals of teh MAST Problem for Sequences and Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On the Parameterized Complexity of Layered Graph Drawing

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Covering Things with Things

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
New Upper Bounds for MaxSat

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Existential Locality Theorem

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Preprocessing of intractable problems

Information and Computation
Computing small partial coverings

Information Processing Letters
On the parametric complexity of schedules to minimize tardy tasks

Theoretical Computer Science - Australasian computer science
Identification of function distinguishable languages

Theoretical Computer Science
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications

Theoretical Computer Science
Parameterized complexity of vertex colouring

Discrete Applied Mathematics
On the complexity of intersecting finite state automata and NL versus NP

Theoretical Computer Science
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Fixed-parameter tractability of disjunction-free default reasoning

Journal of Computer Science and Technology
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
An efficient fixed-parameter algorithm for 3-hitting set

Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Discrete Applied Mathematics - The renesse issue on satisfiability
On the complexity of finding common approximate substrings

Theoretical Computer Science
Describing parameterized complexity classes

Information and Computation
Identifying Terminal Distinguishable Languages

Annals of Mathematics and Artificial Intelligence
Algorithms for graphs with small octopus

Discrete Applied Mathematics
The turing way to parameterized complexity

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Decidability of bounded second order unification

Information and Computation
Existential second-order logic over graphs: Charting the tractability frontier

Journal of the ACM (JACM)
Computing crossing numbers in quadratic time

Journal of Computer and System Sciences - STOC 2001
Computing large and small stable models

Theory and Practice of Logic Programming
A fixed-parameter tractable algorithm for matrix domination

Information Processing Letters
Linear FPT reductions and computational lower bounds

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

Journal of Algorithms
Hard problems in similarity searching

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Theoretical Computer Science
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Journal of Computer and System Sciences
On preservation under homomorphisms and unions of conjunctive queries

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Embeddings of k-connected graphs of pathwidth k

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Refined memorization for vertex cover

Information Processing Letters
Computing cores for data exchange: new algorithms and practical solutions

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Two algorithms for general list matrix partitions

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

ACM Transactions on Algorithms (TALG)
The NP-completeness column

ACM Transactions on Algorithms (TALG)
The intractability of computing the Hamming distance

Theoretical Computer Science
Polynomial and APX-hard cases of the individual haplotyping problem

Theoretical Computer Science - Pattern discovery in the post genome
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
Tight lower bounds for certain parameterized NP-hard problems

Information and Computation
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Confronting hardness using a hybrid approach

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A refined search tree technique for Dominating Set on planar graphs

Journal of Computer and System Sciences
Minimum-Flip Supertrees: Complexity and Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A fixed-parameter tractability result for multicommodity demand flow in trees

Information Processing Letters
Compatibility of unrooted phylogenetic trees is FPT

Theoretical Computer Science - Parameterized and exact computation
Simplifying the weft hierarchy

Theoretical Computer Science - Parameterized and exact computation
On miniaturized problems in parameterized complexity theory

Theoretical Computer Science - Parameterized and exact computation
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

Theoretical Computer Science - Parameterized and exact computation
On finding short resolution refutations and small unsatisfiable subsets

Theoretical Computer Science - Parameterized and exact computation
Chordless paths through three vertices

Theoretical Computer Science - Parameterized and exact computation
Parameterized graph separation problems

Theoretical Computer Science - Parameterized and exact computation
Parameterized coloring problems on chordal graphs

Theoretical Computer Science - Parameterized and exact computation
Moving policies in cyclic assembly line scheduling

Theoretical Computer Science - Parameterized and exact computation
The first order definability of graphs with separators via the Ehrenfeucht game

Theoretical Computer Science - Game theory meets theoretical computer science
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The minimum weight triangulation problem with few inner points

Computational Geometry: Theory and Applications
Reducing to independent set structure: the case of k-internal spanning tree

Nordic Journal of Computing
Consistent query answering in databases

ACM SIGMOD Record
A parametric analysis of the state-explosion problem in model checking

Journal of Computer and System Sciences
The recognizability of sets of graphs is a robust property

Theoretical Computer Science
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
A polynomial algorithm for codes based on directed graphs

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Faster fixed parameter tractable algorithms for finding feedback vertex sets

ACM Transactions on Algorithms (TALG)
Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope

Information Processing Letters
LTL Over integer periodicity constraints

Theoretical Computer Science
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The complexity of homomorphism and constraint satisfaction problems seen from the other side

Journal of the ACM (JACM)
A survey on knowledge compilation

AI Communications
The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata
On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]

Theoretical Computer Science - Algorithmic applications in management
Strong computational lower bounds via parameterized complexity

Journal of Computer and System Sciences
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Exact algorithms and applications for Tree-like Weighted Set Cover

Journal of Discrete Algorithms
Online promise problems with online width metrics

Journal of Computer and System Sciences
Polynomial time approximation schemes and parameterized complexity

Discrete Applied Mathematics
Vertex-minors, monadic second-order logic, and a conjecture by Seese

Journal of Combinatorial Theory Series B
Longest common subsequence problem for unoriented and cyclic strings

Theoretical Computer Science
The Embedding Problem for Switching Classes of Graphs

Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Configurations with few crossings in topological graphs

Computational Geometry: Theory and Applications
Invitation to data reduction and problem kernelization

ACM SIGACT News
Quickly deciding minor-closed parameters in general graphs

European Journal of Combinatorics
Tree-edges deletion problems with bounded diameter obstruction sets

Discrete Applied Mathematics
A logical approach to multicut problems

Information Processing Letters
Optimal Solutions for the Closest-String Problem via Integer Programming

INFORMS Journal on Computing
Algorithms for computing parameters of graph-based extensions of BCH codes

Journal of Discrete Algorithms
Interval completion with few edges

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computing crossing number in linear time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Attribute grammars for scalable query processing on XML streams

The VLDB Journal — The International Journal on Very Large Data Bases
Monadic datalog over finite structures with bounded treewidth

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Genus characterizes the complexity of certain graph problems: Some tight results

Journal of Computer and System Sciences
Satisfiability of mixed Horn formulas

Discrete Applied Mathematics
Traversing the machining graph

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
First-order queries on structures of bounded degree are computable with constant delay

ACM Transactions on Computational Logic (TOCL)
The relative clique-width of a graph

Journal of Combinatorial Theory Series B
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG

Information Processing Letters
Parameterized complexity of the induced subgraph problem in directed graphs

Information Processing Letters
Visualizing SAT Instances and Runs of the DPLL Algorithm

Journal of Automated Reasoning
An exact algorithm for the minimum dominating clique problem

Theoretical Computer Science
On the fixed-parameter tractability of parameterized model-checking problems

Information Processing Letters
Catalan structures and dynamic programming in H-minor-free graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fundamental study: The modular decomposition of countable graphs. Definition and construction in monadic second-order logic

Theoretical Computer Science
A more efficient algorithm for perfect sorting by reversals

Information Processing Letters
Enhancing DLV instantiator by backjumping techniques

Annals of Mathematics and Artificial Intelligence
The complexity of fixed-parameter problems: guest column

ACM SIGACT News
Fixed parameter algorithms for one-sided crossing minimization revisited

Journal of Discrete Algorithms
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs

Journal of Discrete Algorithms
Infeasibility of instance compression and succinct PCPs for NP

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Every minor-closed property of sparse graphs is testable

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Convex recolorings of strings and trees: Definitions, hardness results and algorithms

Journal of Computer and System Sciences
Hardness of optimal spaced seed design

Journal of Computer and System Sciences
Efficient algorithms for counting parameterized list H-colorings

Journal of Computer and System Sciences
Delegation and satisfiability in workflow systems

Proceedings of the 13th ACM symposium on Access control models and technologies
Tractable cases of the extended global cardinality constraint

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Parameterized complexity of the clique partition problem

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
The parameterized complexity of regular subgraph problems and generalizations

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Seeing the trees and their branches in the network is hard

Theoretical Computer Science
On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Discrete Applied Mathematics
Computational aspects of monotone dualization: A brief survey

Discrete Applied Mathematics
Red-blue covering problems and the consecutive ones property

Journal of Discrete Algorithms
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Data reduction and exact algorithms for clique cover

Journal of Experimental Algorithmics (JEA)
Partial vs. Complete Domination: t-Dominating Set

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Parameterized Learnability of k-Juntas and Related Problems

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Fixed-Parameter Algorithms for Kemeny Scores

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Copeland Voting Fully Resists Constructive Control

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Facility Location Problems: A Parameterized View

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Minimum Leaf Out-Branching Problems

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Improved Parameterized Algorithms for Weighted 3-Set Packing

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Parameterized Computational Complexity of Dodgson and Young Elections

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Structural Tractability of Propagated Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Minimum Common String Partition Parameterized

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Finding the Rare Cube

ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences
The minimum spanning strong subdigraph problem is fixed parameter tractable

Discrete Applied Mathematics
ROMAN DOMINATION: a parameterized perspective

International Journal of Computer Mathematics
Logarithmic keying

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A bounded search tree algorithm for parameterized face cover

Journal of Discrete Algorithms
A fixed parameter algorithm for optimal convex partitions

Journal of Discrete Algorithms
On k-connectivity problems with sharpened triangle inequality

Journal of Discrete Algorithms
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints

Journal of Discrete Algorithms
The parameterized complexity of probability amplification

Information Processing Letters
Parameterized approximation of dominating set problems

Information Processing Letters
Closest 4-leaf power is fixed-parameter tractable

Discrete Applied Mathematics
Parameterized algorithmics for linear arrangement problems

Discrete Applied Mathematics
Efficiency in exponential time for domination-type problems

Discrete Applied Mathematics
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
Treewidth and logical definability of graph products

Theoretical Computer Science
A more effective linear kernelization for cluster editing

Theoretical Computer Science
On the pseudo-achromatic number problem

Theoretical Computer Science
Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
A Most General Edge Elimination Polynomial

Graph-Theoretic Concepts in Computer Science
On the Pseudo-achromatic Number Problem

Graph-Theoretic Concepts in Computer Science
Parameterized Complexity for Domination Problems on Degenerate Graphs

Graph-Theoretic Concepts in Computer Science
Parameterized Graph Cleaning Problems

Graph-Theoretic Concepts in Computer Science
Approximability and Parameterized Complexity of Minmax Values

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
A Problem Kernelization for Graph Packing

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the Computational Complexity of Monotone Constraint Satisfaction Problems

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Graph operations characterizing rank-width

Discrete Applied Mathematics
The parameterized complexity of the induced matching problem

Discrete Applied Mathematics
Hybridization in Nonbinary Trees

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Linear CNF formulas and satisfiability

Discrete Applied Mathematics
Modeling and querying probabilistic XML data

ACM SIGMOD Record
Parameterized complexity of finding regular induced subgraphs

Journal of Discrete Algorithms
Algorithms for optimal outlier removal

Journal of Discrete Algorithms
Querying Protein-Protein Interaction Networks

ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Pure Parsimony Xor Haplotyping

ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Linear kernelizations for restricted 3-Hitting Set problems

Information Processing Letters
Parameterized computational complexity of control problems in voting systems

Theoretical Computer Science
On parameterized exponential time complexity

Theoretical Computer Science
Sort and Search: Exact algorithms for generalized domination

Information Processing Letters
How similarity helps to efficiently compute Kemeny rankings

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Running tree automata on probabilistic XML

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A Quadratic Kernel for 3-Set Packing

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On Parameterized Exponential Time Complexity

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Improved Deterministic Algorithms for Weighted Matching and Packing Problems

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On the Tractability of Maximal Strip Recovery

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The status of the P versus NP problem

Communications of the ACM - The Status of the P versus NP Problem
An exact almost optimal algorithm for target set selection in social networks

Proceedings of the 10th ACM conference on Electronic commerce
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

Journal of Experimental Algorithmics (JEA)
Bounded treewidth as a key to tractability of knowledge representation and reasoning

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing Bond Types in Molecule Graphs

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Finding Small 2-Generating Sets

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Graph-Based Data Clustering with Overlaps

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Making Directed Graphs Transitive

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Parameterized graph cleaning problems

Discrete Applied Mathematics
Phase transitions and complexity of weighted satisfiability and other intractable parameterized problems

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Backdoor trees

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
The minimum weight triangulation problem with few inner points

Computational Geometry: Theory and Applications
Constraint satisfaction with bounded treewidth revisited

Journal of Computer and System Sciences
FPT algorithms and kernels for the Directedk- Leaf problem

Journal of Computer and System Sciences
Local search: is brute-force avoidable?

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices

IEEE Transactions on Information Theory
On notions of regularity for data languages

Theoretical Computer Science
The Complexity of Probabilistic Lobbying

ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Balanced vertex-orderings of graphs

Discrete Applied Mathematics
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Embeddings of k-connected graphs of pathwidth k

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Discrete Applied Mathematics
Refined memorization for vertex cover

Information Processing Letters
A fixed-parameter tractability result for multicommodity demand flow in trees

Information Processing Letters
A 4k2 kernel for feedback vertex set

ACM Transactions on Algorithms (TALG)
Treewidth computations I. Upper bounds

Information and Computation
Bounded fixed-parameter tractability and log2n nondeterministic bits

Journal of Computer and System Sciences
On the power of structural decompositions of graph-based representations of constraint problems

Artificial Intelligence
Complexity of the packing coloring problem for trees

Discrete Applied Mathematics
Parameterized algorithms for d-Hitting Set: The weighted case

Theoretical Computer Science
Complexities of the centre and median string problems

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Graph-modeled data clustering: fixed-parameter algorithms for clique generation

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On k-edge-connectivity problems with sharpened triangle inequality

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Genus characterizes the complexity of graph problems: some tight results

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Specifying evolutionary algorithms in XML

IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences
On exact complexity of subgraph homeomorphism

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Approximability and parameterized complexity of consecutive ones submatrix problems

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Kernelizations for parameterized counting problems

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An approximation algorithm based on chain implication for constrained minimum vertex covers in bipartite graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Matched formulas and backdoor sets

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Backdoor sets of quantified boolean formulas

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Graph operations characterizing rank-width and balanced graph expressions

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Segmenting strings homogeneously via trees

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Obtaining a planar graph by vertex deletion

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A lower bound on approximation algorithms for the closest substring problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An exact algorithm based on chain implication for the Min-CVCB problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
On the complexity of some colorful problems parameterized by treewidth

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
A CNF formula hierarchy over the hypercube

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
The parameterized complexity of the unique coverage problem

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Minimum fill-in and treewidth of split+ke and split+kv graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Problem kernels for NP-complete edge deletion problems: split and related graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Better algorithms and bounds for directed maximum leaf problems

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Covering graphs with few complete bipartite subgraphs

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Some tractable instances of interval data minmax regret problems: bounded distance from triviality

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
The buffered work-pool approach for search-tree based optimization algorithms

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
New results on optimizing rooted triplets consistency

Discrete Applied Mathematics
Finding common structured patterns in linear graphs

Theoretical Computer Science
Simple geometrical intersection graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Same-relation constraints

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
dRDF: entailment for domain-restricted RDF

ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
The longest haplotype reconstruction problem revisited

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An O*(3.523k) parameterized algorithm for 3-set packing

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Improved algorithms for bicluster editing

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Speeding up dynamic programming for some NP-hard graph recoloring problems

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Bandwidth of bipartite permutation graphs in polynomial time

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Tree-width in Algebraic Complexity

Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
More efficient algorithms for closest string and substring problems

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Balanced bipartite graph based register allocation for network processors in mobile and wireless networks

Mobile Information Systems - Mobile and Wireless Networks
An improved kernel size for rotation distance in binary trees

Information Processing Letters
Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Proceedings of the forty-second ACM symposium on Theory of computing
Tree-width for first order formulae

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the hardness of approximating stopping and trapping sets

IEEE Transactions on Information Theory
Pure Nash equilibria: complete characterization of hard and easy graphical games

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Parameterizing the winner determination problem for combinatorial auctions

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Monadic datalog over finite structures of bounded treewidth

ACM Transactions on Computational Logic (TOCL)
Solving the Order-Preserving Submatrix Problem via Integer Programming

INFORMS Journal on Computing
A fixed-parameter algorithm for string-to-string correction

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
On the parameterized complexity of some optimization problems related to multiple-interval graphs

Theoretical Computer Science
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic lower bounds for problems parameterized by clique-width

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and kernels

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Solving MAX-r-SAT above a tight lower bound

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the possibility of faster SAT algorithms

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multiple genome alignment based on longest path in directed acyclic graphs

International Journal of Bioinformatics Research and Applications
Satisfiability and Resiliency in Workflow Authorization Systems

ACM Transactions on Information and System Security (TISSEC)
A linear kernel for co-path/cycle packing

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Kernelization for cycle transversal problems

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Efficient exact and approximate algorithms for the complement of maximal strip recovery

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Preprocessing of min ones problems: a dichotomy

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Parameterized algorithms

Algorithms and theory of computation handbook
Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
On problem kernels for possible winner determination under the k-approval protocol

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Parameterized complexity and kernelizability of max ones and exact ones problems

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Solving MINONES-2-SAT as fast as VERTEX COVER

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Exact algorithms for computing the tree edit distance between unordered trees

Theoretical Computer Science
A probabilistic approach to problems parameterized above or below tight bounds

Journal of Computer and System Sciences
On the complexity of some colorful problems parameterized by treewidth

Information and Computation
The zero exemplar distance problem

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Scaffold filling under the breakpoint distance

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Why large CLOSEST STRING instances are easy to solve in practice

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the parameterized complexity of the Multi-MCT and Multi-MCST problems

Journal of Combinatorial Optimization
The complexity of evaluating tuple generating dependencies

Proceedings of the 14th International Conference on Database Theory
On making a distinguished vertex minimum degree by vertex deletion

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
New results on the complexity of the max- and min-rep problems

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Structural properties of hard metric TSP inputs

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On approximating the d-girth of a graph

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Minimum vertex cover in rectangle graphs

Computational Geometry: Theory and Applications
Parameterized complexity of coloring problems: Treewidth versus vertex cover

Theoretical Computer Science
Planning to fold multiple objects from a single self-folding sheet

Robotica
Facility location problems: A parameterized view

Discrete Applied Mathematics
Parameterized algorithms for the independent set problem in some hereditary graph classes

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Parameterized complexity of k-anonymity: hardness and tractability

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Exploiting bounded signal flow for graph orientation based on cause-effect pairs

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Characterizing problems for realizing policies in self-adaptive and self-managing systems

Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Contracting planar graphs to contractions of triangulations

Journal of Discrete Algorithms
Parameterized complexity of even/odd subgraph problems

Journal of Discrete Algorithms
Breaking the 2n-barrier for Irredundance: Two lines of attack

Journal of Discrete Algorithms
The parameterized complexity of chosen problems for finite automata on trees

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Recognizing shuffled languages

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Subset feedback vertex set is fixed-parameter tractable

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Domination when the stars are out

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Parameterized bounded-depth Frege is not optimal

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Clustering with local restrictions

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Theoretical Computer Science
Exponential and polynomial time algorithms for the minimum common string partition problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On parameterized independent feedback vertex set

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Feedback vertex set in mixed graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Multicut in trees viewed through the eyes of vertex cover

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Parameterized reductions and algorithms for another vertex cover generalization

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Parity games on graphs with medium tree-width

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Kernelization: an overview

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
The effect of homogeneity on the complexity of k-anonymity

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Data reduction for graph coloring problems

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A new bound for 3-satisfiable maxsat and its algorithmic application

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Polynomial kernels for proper interval completion and related problems

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Parameterized complexity of vertex deletion into perfect graph classes

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Guard games on graphs: Keep the intruder out!

Theoretical Computer Science
Parameterized complexity results for 1-safe Petri nets

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Isomorphism of (mis)labeled graphs

ESA'11 Proceedings of the 19th European conference on Algorithms
Paths, flowers and vertex cover

ESA'11 Proceedings of the 19th European conference on Algorithms
Hitting and harvesting pumpkins

ESA'11 Proceedings of the 19th European conference on Algorithms
Complexity issues for preorders on finite labeled forests

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Tractable triangles

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The parameterized complexity of local consistency

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Automata for monadic second-order model-checking

RP'11 Proceedings of the 5th international conference on Reachability problems
How hard is it to bribe the judges? a study of the complexity of bribery in judgment aggregation

ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Bandwidth on AT-free graphs

Theoretical Computer Science
Dominating set is fixed parameter tractable in claw-free graphs

Theoretical Computer Science
Haplotype Inference Constrained by Plausible Haplotype Data

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Routing multi-class traffic flows in the plane

Computational Geometry: Theory and Applications
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching

ACM Transactions on Algorithms (TALG)
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees

ACM Transactions on Algorithms (TALG)
On Bounded-Degree Vertex Deletion parameterized by treewidth

Discrete Applied Mathematics
On bounded block decomposition problems for under-specified systems of equations

Journal of Computer and System Sciences
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Journal of Computer and System Sciences
A three-string approach to the closest string problem

Journal of Computer and System Sciences
Editing graphs to satisfy degree constraints: A parameterized approach

Journal of Computer and System Sciences
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing

SIAM Journal on Discrete Mathematics
Constraint satisfaction with bounded treewidth revisited

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Chordal deletion is fixed-parameter tractable

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Divide-and-color

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Computing graph polynomials on graphs of bounded clique-width

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Kernels for the vertex cover problem on the preferred attachment model

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Enumerate and expand: improved algorithms for connected vertex cover and tree cover

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Linear kernels for (connected) dominating set on H-minor-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Compression via matroids: a randomized polynomial kernel for odd cycle transversal

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Weak compositions and their applications to polynomial lower bounds for kernelization

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Subexponential parameterized algorithm for minimum fill-in

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximability of minimum AND-Circuits

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Triangles, 4-cycles and parameterized (in-)tractability

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Minimum membership set covering and the consecutive ones property

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
From a zoo to a zoology: descriptive complexity for graph polynomials

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A new approach for solving the maximum clique problem

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Solving the maximum agreement subtree and the maximum compatible tree problems on many bounded degree trees

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Improved exact exponential algorithms for vertex bipartization and other problems

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Search vs. symbolic techniques in satisfiability solving

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Worst case bounds for some NP-Complete modified Horn-SAT problems

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Preservation under extensions on well-behaved finite structures

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient approximation schemes for geometric problems?

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Kernelization as heuristic structure for the vertex cover problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
MSO queries on tree decomposable structures are computable with linear delay

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A new approach and faster exact methods for the maximum common subgraph problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
W-hardness under linear FPT-reductions: structural properties and further applications

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Graph searching and search time

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Nonblocker: parameterized algorithmics for minimum dominating set

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Roman domination: a parameterized perspective

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
The complexity of problems on implicitly represented inputs

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Lower bounds and parameterized approach for longest common subsequence

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Reconstructing evolution of natural languages: complexity and parameterized algorithms

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Equivalence checking of circuits with parameterized specifications

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Two-Layer planarization: improving on parameterized algorithmics

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fixed-Parameter tractable algorithms for testing upward planarity

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Slightly superexponential parameterized problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On graph crossing number and edge planarization

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On product covering in supply chain models: natural complete problems for W[3] and W[4]

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Hardness of optimal spaced seed design

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Comparing trees via crossing minimization

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterized algorithms for HITTING SET: the weighted case

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Fixed-parameter tractable generalizations of cluster editing

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The linear arrangement problem parameterized above guaranteed value

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A parameterized view on matroid optimization problems

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The structure of tractable constraint satisfaction problems

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Improved parameterized upper bounds for vertex cover

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Guarantees for the success frequency of an algorithm for finding dodgson-election winners

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Querying and embedding compressed texts

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Parametric duality and kernelization: lower bounds and upper bounds on kernel size

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Memetic algorithms with partial lamarckism for the shortest common supersequence problem

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Hypertree decompositions: structure, algorithms, and applications

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Fixed-parameter algorithms for protein similarity search under mRnA structure constraints

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On the fixed-parameter enumerability of cluster editing

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Approximation algorithms for unit disk graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized complexity of generalized vertex cover problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Improved fixed-parameter algorithms for two feedback set problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Convex recolorings of strings and trees: definitions, hardness results and algorithms

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient parameterized algorithm for biopolymer structure-sequence alignment

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Efficient algorithms for the longest path problem

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the hardness of losing weight

ACM Transactions on Algorithms (TALG)
Graph-based coalitional games: an analysis via characteristics

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
A comparison of evolutionary approaches to the shortest common supersequence problem

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Algorithm engineering for optimal graph bipartization

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Isomorphism for graphs of bounded feedback vertex set number

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Systems of linear equations over F2 and problems parameterized above average

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Polynomial kernels for hard problems on disk graphs

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding k disjoint triangles in an arbitrary graph

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Exact (exponential) algorithms for the dominating set problem

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Linear kernels in linear time, or how to save k colors in O(n2) steps

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Mod/Resc Parsimony Inference: Theory and application

Information and Computation
Phylogeny- and parsimony-based haplotype inference with constraints

Information and Computation
A strengthened analysis of an algorithm for Dominating Set in planar graphs

Discrete Applied Mathematics
Parameterized complexity of generalized domination problems

Discrete Applied Mathematics
On the model-checking of monadic second-order formulas with edge set quantifications

Discrete Applied Mathematics
Applying modular decomposition to parameterized bicluster editing

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The parameterized complexity of maximality and minimality problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Randomized approximations of parameterized counting problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Greedy localization and color-coding: improved matching and packing algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter approximation: conceptual framework and approximability results

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On parameterized approximability

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
EDGE DOMINATING SET: efficient enumeration-based exact algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed parameter tractability of independent set in segment intersection graphs

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The undirected feedback vertex set problem has a poly(k) kernel

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter tractability results for full-degree spanning tree and its dual

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the effective enumerability of NP problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The parameterized complexity of enumerating frequent itemsets

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Random separation: a new method for solving fixed-cardinality optimization problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Kernels: annotated, proper and induced

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Guard games on graphs: keep the intruder out!

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Kernelization

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Algorithmics – is there hope for a unified theory?

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Solving #SAT using vertex covers

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Finding consistent categorial grammars of bounded value: a parameterized approach

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Fixed-parameter algorithm for general pedigrees with a single pair of sites

ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Parameterized problems on coincidence graphs

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Intuitive algorithms and t-vertex cover

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved steiner tree algorithms for bounded treewidth

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Tree automata and XPath on compressed trees

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Exponential lower bounds on the space complexity of OBDD-Based graph algorithms

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Edge clique partition of k

CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Transaction databases, frequent itemsets, and their condensed representations

KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Important separators and parameterized algorithms

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
List coloring in the absence of a linear forest

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Complexity of splits reconstruction for low-degree trees

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized two-player nash equilibrium

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On the independence number of graphs with maximum degree 3

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Planar k-path in subexponential time and polynomial space

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
From few components to an eulerian graph by adding arcs

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A polynomial time algorithm for bounded directed pathwidth

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Influence of tree topology restrictions on the complexity of haplotyping with missing data

Theoretical Computer Science
Exploiting bounded treewidth with datalog (a survey)

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Efficient algorithms for network localization using cores of underlying graphs

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Generalized above guarantee vertex cover and r-partization

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Comparing and aggregating partial orders with kendall tau distances

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Parameterized algorithms for inclusion of linear matchings

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The parameterized complexity of local search for TSP, more refined

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the parameterized complexity of consensus clustering

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parameterized complexity of the firefighter problem

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A generalization of spira's theorem and circuits with small segregators or separators

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Exact and approximation algorithms for the complementary maximal strip recovery problem

Journal of Combinatorial Optimization
Minimum common string partition revisited

Journal of Combinatorial Optimization
Note: A note on the parameterized complexity of unordered maximum tree orientation

Discrete Applied Mathematics
Augmenting tractable fragments of abstract argumentation

Artificial Intelligence
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number

Journal of Discrete Algorithms
Parameterized complexity of firefighting revisited

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity in multiple-interval graphs: domination

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Contracting graphs to paths and trees

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Increasing the minimum degree of a graph by contractions

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
On polynomial kernels for structural parameterizations of odd cycle transversal

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for path and cycle problems

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Safe approximation and its relation to kernelization

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Tight complexity bounds for FPT subgraph problems parameterized by clique-width

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized maximum path coloring

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Twin-Cover: beyond vertex cover in parameterized algorithmics

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity and fixed-parameter tractability of description logic reasoning

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A parameterized complexity tutorial

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Catalan structures and dynamic programming in H-minor-free graphs

Journal of Computer and System Sciences
Multicut in trees viewed through the eyes of vertex cover

Journal of Computer and System Sciences
On the parameterized complexity of coloring graphs in the absence of a linear forest

Journal of Discrete Algorithms
Parameterized complexity of maxsat above average

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
k-gap interval graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
New lower bound on max cut of hypergraphs with an application to r-set splitting

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A theory and algorithms for combinatorial reoptimization

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem

Journal of Combinatorial Theory Series B
Constraint satisfaction problems: convexity makes all different constraints tractable

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Kernels for global constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Backdoors to tractable answer-set programming

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Augmenting tractable fragments of abstract argumentation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Some tractable instances of interval data minmax regret problems

Operations Research Letters
The traveling salesman problem with few inner points

Operations Research Letters
A polynomial case of the parsimony haplotyping problem

Operations Research Letters
Searching the k-change neighborhood for TSP is W[1]-hard

Operations Research Letters
FPT algorithms for path-transversal and cycle-transversal problems

Discrete Optimization
On the directed Full Degree Spanning Tree problem

Discrete Optimization
Lower bounds on kernelization

Discrete Optimization
On the algorithmic effectiveness of digraph decompositions and complexity measures

Discrete Optimization
Graph-based data clustering with overlaps

Discrete Optimization
Treewidth governs the complexity of target set selection

Discrete Optimization
Parameterized complexity and approximability of the Longest Compatible Sequence problem

Discrete Optimization
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover

Discrete Optimization
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction

Discrete Optimization
Combinatorial approximation algorithms: a comparative review

Operations Research Letters
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover

Theoretical Computer Science
FPT algorithms for Connected Feedback Vertex Set

Journal of Combinatorial Optimization
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem

Journal of the ACM (JACM)
Kernels for packing and covering problems

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Fixed-Parameter tractability of almost CSP problem with decisive relations

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
On editing graphs into 2-club clusters

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Partial degree bounded edge packing problem

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
An algorithmic view on multi-related-segments: a unifying model for approximate common interval

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
Constraint satisfaction problems parameterized above or below tight bounds: a survey

The Multivariate Algorithmic Revolution and Beyond
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond
A parameterized halting problem

The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity

The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves

ACM Transactions on Algorithms (TALG)
Kernelization hardness of connectivity problems in d-degenerate graphs

Discrete Applied Mathematics
Cluster editing with locally bounded modifications

Discrete Applied Mathematics
Communication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width

Discrete Applied Mathematics
Strong backdoors to nested satisfiability

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fixed-parameter tractability of satisfying beyond the number of variables

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Parameterized Bounded-Depth Frege Is not Optimal

ACM Transactions on Computation Theory (TOCT)
Directed subset feedback vertex set is fixed-parameter tractable

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Max-cut parameterized above the edwards-erdős bound

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized approximation via fidelity preserving transformations

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Backdoors to acyclic SAT

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The parameterized complexity of k-edge induced subgraphs

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A tight lower bound for planar multiway cut with fixed number of terminals

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized tractability of multiway cut with parity constraints

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
First-Order and Monadic Second-Order Model-Checking on Ordered Structures

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Lower Bounds for Existential Pebble Games and k-Consistency Tests

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Minimizing rosenthal potential in multicast games

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The good, the bad, and the odd: cycles in answer-set programs

ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
A new view on Rural Postman based on Eulerian Extension and Matching

Journal of Discrete Algorithms
Improved Steiner tree algorithms for bounded treewidth

Journal of Discrete Algorithms
Computing vertex-surjective homomorphisms to partially reflexive trees

Theoretical Computer Science
The parameterized complexity of the shared center problem

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Faster parameterized algorithms for deletion to split graphs

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A single-exponential FPT algorithm for the K4- minor cover problem

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Induced disjoint paths in AT-Free graphs

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Exploiting a hypergraph model for finding golomb rulers

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
New races in parameterized algorithmics

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The robust set problem: parameterized complexity and approximation

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Parameterized study of the test cover problem

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Cluster vertex deletion: a parameterization between vertex cover and clique-width

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Exact combinatorial algorithms and experiments for finding maximum k-plexes

Journal of Combinatorial Optimization
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy

Theoretical Computer Science
On Parameterized Independent Feedback Vertex Set

Theoretical Computer Science
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond

ACM Transactions on Algorithms (TALG)
On notions of regularity for data languages

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On approximating optimal weighted lobbying, and frequency of correctness versus average-case polynomial time

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Efficient parameterized preprocessing for cluster editing

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Satisfiability and resiliency in workflow systems

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Non-breaking similarity of genomes with gene repetitions

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Subexponential parameterized algorithms

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized algorithms for directed maximum leaf problems

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized approximability of the disjoint cycle problem

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear problem kernels for NP-hard problems on planar graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Connected coloring completion for general graphs: algorithms and complexity

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Quadratic kernelization for convex recoloring of trees

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Isolation concepts for enumerating dense subgraphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Improved algorithms for weighted and unweighted set splitting problems

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Improved algorithms for the feedback vertex set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Kernelization and complexity results for connectivity augmentation problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An improved parameterized algorithm for the minimum node multiway cut problem

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Branch and recharge: exact algorithms for generalized domination

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Distributed memorization for the k-vertex cover problem

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Towards more expressive ontology languages: The query answering problem

Artificial Intelligence
A more effective linear kernelization for Cluster Editing

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Completely inapproximable monotone and antimonotone parameterized problems

Journal of Computer and System Sciences
A polynomial kernel for proper interval vertex deletion

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Parameterized complexity of induced h-matching on claw-free graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
FPT algorithms for domination in biclique-free graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Breaking variable symmetry in almost injective problems

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Some definitorial suggestions for parameterized proof complexity

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A polynomial-time algorithm for planar multicuts with few source-sink pairs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
On the space complexity of parameterized problems

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Parameterized algorithmics and computational experiments for finding 2-clubs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Finding dense subgraphs of sparse graphs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
An improved kernel for the undirected planar feedback vertex set problem

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Efficient algorithms for the max k-vertex cover problem

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Clustering with local restrictions

Information and Computation
Structural tractability of enumerating CSP solutions

Constraints
Parameterized top-K algorithms

Theoretical Computer Science
Parameterized algorithms for even cycle transversal

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Bisections above tight lower bounds

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On group feedback vertex set parameterized by the size of the cutset

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized domination in circle graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
How to eliminate a graph

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On the parameterized complexity of finding separators with non-hereditary properties

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A unified adaptive co-identification framework for high-d expression data

PRIB'12 Proceedings of the 7th IAPR international conference on Pattern Recognition in Bioinformatics
Exact exponential algorithms

Communications of the ACM
Placing regenerators in optical networks to satisfy multiple sets of requests

IEEE/ACM Transactions on Networking (TON)
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Theoretical Computer Science
Complex analogies: remarks on the complexity of HDTP

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Constant thresholds can make target set selection tractable

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Obtaining planarity by contracting few edges

Theoretical Computer Science
Extracting minimum-weight tree patterns from a schema with neighborhood constraints

Proceedings of the 16th International Conference on Database Theory
On the independence number of graphs with maximum degree 3

Theoretical Computer Science
Note: Towards optimal kernel for connected vertex cover in planar graphs

Discrete Applied Mathematics
Parallel vertex cover: a case study in dynamic load balancing

AusPDC '11 Proceedings of the Ninth Australasian Symposium on Parallel and Distributed Computing - Volume 118
Parameterized complexity of discrete morse theory

Proceedings of the twenty-ninth annual symposium on Computational geometry
On multiway cut parameterized above lower bounds

ACM Transactions on Computation Theory (TOCT)
The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Parameterized average-case complexity of the hypervolume indicator

Proceedings of the 15th annual conference on Genetic and evolutionary computation
The fine classification of conjunctive queries and parameterized logarithmic space complexity

Proceedings of the 32nd symposium on Principles of database systems
The complexity of mining maximal frequent subgraphs

Proceedings of the 32nd symposium on Principles of database systems
Finding approximate and constrained motifs in graphs

Theoretical Computer Science
Computing socially-efficient cake divisions

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
On manipulation in multi-winner elections based on scoring rules

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem

ACM Transactions on Information and System Security (TISSEC)
Distortion is Fixed Parameter Tractable

ACM Transactions on Computation Theory (TOCT)
Incremental list coloring of graphs, parameterized by conservation

Theoretical Computer Science
Testing first-order properties for subclasses of sparse graphs

Journal of the ACM (JACM)
Parameterized Complexity of DPLL Search Procedures

ACM Transactions on Computational Logic (TOCL)
Finding small separators in linear time via treewidth reduction

ACM Transactions on Algorithms (TALG)
The constrained shortest common supersequence problem

Journal of Discrete Algorithms
Parameterized complexity of k-anonymity: hardness and tractability

Journal of Combinatorial Optimization
Parameterized complexity results for exact bayesian network structure learning

Journal of Artificial Intelligence Research
A polynomial algorithm for codes based on directed graphs

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Most inforbable explanations: finding explanations in bayesian networks that are both probable and informative

ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Local backbones

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Upper and lower bounds for weak backdoor set detection

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Linear kernels and single-exponential algorithms via protrusion decompositions

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
FO model checking of interval graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A refined complexity analysis of degree anonymization in graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Imbalance is fixed parameter tractable

Information Processing Letters
Parameterized complexity of 1-planarity

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
When is weighted satisfiability FPT?

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Parameterized complexity of weak odd domination problems

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
A note on tractability and artificial intelligence

AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
On approximating the d-girth of a graph

Discrete Applied Mathematics
Solving min ones 2-sat as fast as vertex cover

Theoretical Computer Science
Parameterized complexity of connected even/odd subgraph problems

Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Journal of the ACM (JACM)
Multi-tuple deletion propagation: approximations and complexity

Proceedings of the VLDB Endowment
Are there any nicely structured preference profiles nearby?

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On the complexity of global scheduling constraints under structural restrictions

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Parameterized complexity of optimal planning: a detailed map

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Backdoors to abduction

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs

ACM Transactions on Knowledge Discovery from Data (TKDD)
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks

Theoretical Computer Science
Data reduction for graph coloring problems

Information and Computation
Polynomial kernels for Proper Interval Completion and related problems

Information and Computation
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization

Information and Computation
A new bound for 3-satisfiable MaxSat and its algorithmic application

Information and Computation
Parameterized testability

Proceedings of the 5th conference on Innovations in theoretical computer science
Dynamic programming for graphs on surfaces

ACM Transactions on Algorithms (TALG)
The effect of homogeneity on the computational complexity of combinatorial data anonymization

Data Mining and Knowledge Discovery
Clique-width and edge contraction

Information Processing Letters
On the k-edge-incident subgraph problem and its variants

Discrete Applied Mathematics
Preprocessing subgraph and minor problems: When does a small vertex cover help?

Journal of Computer and System Sciences
Improved linear problem kernel for planar connected dominating set

Theoretical Computer Science
Parameterized maximum path coloring

Theoretical Computer Science
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

Theoretical Computer Science
Parameterized complexity of MaxSat Above Average

Theoretical Computer Science
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game

Theoretical Computer Science
Note: Parameterized complexity of k-Chinese Postman Problem

Theoretical Computer Science
Maximum balanced subgraph problem parameterized above lower bound

Theoretical Computer Science
Maximum common induced subgraph parameterized by vertex cover

Information Processing Letters
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks

Theoretical Computer Science
On the approximability of the link building problem

Theoretical Computer Science
On the computation of fully proportional representation

Journal of Artificial Intelligence Research
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond

Journal of Artificial Intelligence Research
Complexity results for rainbow matchings

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

Journal of Computer and System Sciences
Radiation hybrid map construction problem parameterized

Journal of Combinatorial Optimization
Parameterized Domination in Circle Graphs

Theory of Computing Systems
Bribery in voting with CP-nets

Annals of Mathematics and Artificial Intelligence
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey

Annals of Mathematics and Artificial Intelligence
Consequence-based and fixed-parameter tractable reasoning in description logics

Artificial Intelligence
The complexity of optimal monotonic planning: the bad, the good, and the causal graph

Journal of Artificial Intelligence Research
Solving Capacitated Dominating Set by using covering by subsets and maximum matching

Discrete Applied Mathematics

Quantified Score

Hi-index	0.19

Visualization

Abstract

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.