ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Learning Markov networks: maximum bounded tree-width graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Decomposable negation normal form
Journal of the ACM (JACM)
The complexity of the Kn,n-problem for node replacement graph languages
Information and Computation
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Listing all potential maximal cliques of a graph
Theoretical Computer Science
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
Counting H-colorings of partial k-trees
Theoretical Computer Science
Exploiting structure in quantified formulas
Journal of Algorithms
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Maximum likelihood bounded tree-width Markov networks
Artificial Intelligence
On the complexity of the maximum cut problem
Nordic Journal of Computing
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
Discrete Mathematics
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Deciding Clique-Width for Graphs of Bounded Tree-Width
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A Class of Solvable Consistent Labeling Problems
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
On the Complements of Partial k-Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Finding Independent Spanning Trees in Partial k-Trees
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
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
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Independent Sets in Map Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms for the Multicolorings of Partial k-Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Subcolorings: Complexity and Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Relationship between Clique-Width and Treewidth
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Second-Order Logic over Strings: Regular and Non-regular Fragments
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Parameterized Complexity of Layered Graph Drawing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On Tractable Queries and Constraints
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
An Existential Locality Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Existential second-order logic over graphs: Charting the tractability frontier
Journal of the ACM (JACM)
On colorings of squares of outerplanar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
Information Processing Letters
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
Journal of Logic, Language and Information
Tree decompositions with small cost
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)
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Journal of Combinatorial Theory Series B
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Islands of Tractability for Parsimony Haplotyping
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Cutwidth I: a linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Journal of Computer and System Sciences
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
An exact method for graph coloring
Computers and Operations Research
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
Compatibility of unrooted phylogenetic trees is FPT
Theoretical Computer Science - Parameterized and exact computation
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Improved bottleneck domination algorithms
Discrete Applied Mathematics
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Islands of Tractability for Parsimony Haplotyping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the colored Tutte polynomial of a graph of bounded treewidth
Discrete Applied Mathematics
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Online promise problems with online width metrics
Journal of Computer and System Sciences
Achievable sets, brambles, and sparse treewidth obstructions
Discrete Applied Mathematics
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Combinatorial Theory Series B
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Spanners for bounded tree-length graphs
Theoretical Computer Science
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Case-factor diagrams for structured probabilistic modeling
Journal of Computer and System Sciences
Combinatorial auctions with tractable winner determination
ACM SIGecom Exchanges
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graph bipartization in linear time
Discrete Applied Mathematics
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tractable cases of the extended global cardinality constraint
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Efficient First-Order Model-Checking Using Short Labels
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Treewidth and logical definability of graph products
Theoretical Computer Science
The Valve Location Problem in Simple Network Topologies
Graph-Theoretic Concepts in Computer Science
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
An exact almost optimal algorithm for target set selection in social networks
Proceedings of the 10th ACM conference on Electronic commerce
Algorithms for graphs of bounded treewidth via orthogonal range searching
Computational Geometry: Theory and Applications
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
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
Belief Revision with Bounded Treewidth
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Tree Projections: Game Characterization and Computational Aspects
Graph Theory, Computational Intelligence and Thought
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Compiling knowledge into decomposable negation normal form
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
On problems without polynomial kernels
Journal of Computer and System Sciences
Algorithms for propositional model counting
Journal of Discrete Algorithms
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
A structural approach to reasoning with quantified Boolean formulas
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval 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)
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics
Note: On the colored Tutte polynomial of a graph of bounded treewidth
Discrete Applied Mathematics
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Treewidth computations I. Upper bounds
Information and Computation
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
On the complexity of computing treelength
Discrete Applied Mathematics
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Determining the smallest k such that G is k-outerplanar
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
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
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
dRDF: entailment for domain-restricted RDF
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Optimization and recognition for K5-minor free graphs in linear time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
GRN model of probabilistic databases: construction, transition and querying
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
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
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Completing networks using observed data
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
The Valve Location Problem in Simple Network Topologies
INFORMS Journal on Computing
Discrete Applied Mathematics
Vertex-bipartition method for colouring minor-closed classes of graphs
Combinatorics, Probability and Computing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic (TOCL)
Algorithms and theory of computation handbook
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Improved algorithm for the half-disjoint paths problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Spanners of bounded degree graphs
Information Processing Letters
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
Mining graphs with constraints on symmetry and diameter
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Complexity results for the spanning tree congestion problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Approximation algorithms for domination search
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Grammar factorization by tree decomposition
Computational Linguistics
Treewidth computations II. Lower bounds
Information and Computation
Characterization of graphs and digraphs with small process numbers
Discrete Applied Mathematics
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
The complexity status of problems related to sparsest cuts
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Complexity of most vital nodes for independent set in graphs related to tree structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Exact algorithms for intervalizing colored graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms
Theoretical Computer Science
An experimental evaluation of treewidth at most four reductions
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Journal of Computer and System Sciences
Preprocessing for treewidth: a combinatorial analysis through kernelization
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Guard games on graphs: Keep the intruder out!
Theoretical Computer Science
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
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
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Bounded arboricity to determine the local structure of sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Practical partitioning-based methods for the steiner problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Finding an induced path of given parity in planar graphs in polynomial time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate tree decompositions of planar graphs in linear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A branch and bound algorithm for exact, upper, and lower bounds on treewidth
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Optimal branch-decomposition of planar graphs in O(n3) time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
The complexity of two graph orientation problems
Discrete Applied Mathematics
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Algorithms for finding distance-edge-colorings of graphs
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
Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Efficient parameterized algorithm for biopolymer structure-sequence alignment
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Exact algorithms for graph homomorphisms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On the maximum cardinality search lower bound for treewidth
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The complexity of minimum convex coloring
Discrete Applied Mathematics
Fixed-parameter approximation: conceptual framework and approximability results
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
Guard games on graphs: keep the intruder out!
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Minimal interval completion through graph exploration
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Multicut algorithms via tree decompositions
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Improved steiner tree algorithms for bounded treewidth
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
Combinatorial auctions with restricted complements
Proceedings of the 13th ACM Conference on Electronic Commerce
Parameterized complexity of firefighting revisited
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
Finding good decompositions for dynamic programming on dense graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Some tractable instances of interval data minmax regret problems
Operations Research Letters
Treewidth governs the complexity of target set selection
Discrete Optimization
On shortest disjoint paths in planar graphs
Discrete Optimization
Scheduling of pipelined operator graphs
Journal of Scheduling
A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem
Journal of Mathematical Modelling and Algorithms
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Time and parallelizability results for parity games with bounded treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
New races in parameterized algorithmics
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
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Solving limited memory influence diagrams
Journal of Artificial Intelligence Research
On the complexity of computing treelength
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Minimum weight 2-edge-connected spanning subgraphs in planar 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
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
European Journal of Combinatorics
Computability of width of submodular partition functions
European Journal of Combinatorics
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
MSOL restricted contractibility to planar graphs
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
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Information Processing Letters
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization
Optimal register allocation in polynomial time
CC'13 Proceedings of the 22nd international conference on Compiler Construction
Optimal placement of bank selection instructions in polynomial time
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
Augmenting outerplanar graphs to meet diameter requirements
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
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
Faster algorithms for markov decision processes with low treewidth
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Imbalance is fixed parameter tractable
Information Processing Letters
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Complexity of finding maximum regular induced subgraphs with prescribed degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Parameterized complexity of connected even/odd subgraph problems
Journal of Computer and System Sciences
Improved algorithms to network p-center location problems
Computational Geometry: Theory and Applications
Kernel bounds for path and cycle problems
Theoretical Computer Science
Theoretical Computer Science
Adiabatic quantum programming: minor embedding with hard faults
Quantum Information Processing
Consequence-based and fixed-parameter tractable reasoning in description logics
Artificial Intelligence
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
The complexity of optimal monotonic planning: the bad, the good, and the causal graph
Journal of Artificial Intelligence Research
Digraphs of bounded elimination width
Discrete Applied Mathematics
| Hi-index | 0.02 |
In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth of $G$ is at most $k$ and, if so, finds a tree-decomposition of $G$ with treewidth at most $k$. A consequence is that every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm. Another consequence is that a similar result holds when we look instead for path-decompositions with pathwidth at most some constant $k$.