Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Counting H-colorings of partial k-trees
Theoretical Computer Science
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Partitioning graphs into generalized dominating sets
Nordic Journal of Computing
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Generalized H-Coloring of Graphs
ISAAC '00 Proceedings of the 11th International Conference 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
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th 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
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
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
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)
Trees with Equal Domination and Restrained Domination Numbers
Journal of Global Optimization
Parameterized power domination complexity
Information Processing Letters
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Extension problems with degree bounds
Discrete Applied Mathematics
Partitioning graphs of supply and demand
Discrete Applied Mathematics
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
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)
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Parameterized power domination complexity
Information Processing Letters
Treewidth computations I. Upper bounds
Information and Computation
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Computational complexity of generalized domination: a complete dichotomy for chordal graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Generalized domination in degenerate graphs: a complete dichotomy of computational complexity
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Total restrained domination in claw-free graphs with minimum degree at least two
Discrete Applied Mathematics
Restrained domination in cubic graphs
Journal of Combinatorial Optimization
Total restrained domination in graphs
Computers & Mathematics with Applications
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Enumerate and expand: new runtime bounds for vertex cover variants
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Approximation algorithms for unit disk graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Algorithms for graphs embeddable with few crossings per edge
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the complexity of the bondage and reinforcement problems
Journal of Complexity
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics
Two birds with one stone: the best of branchwidth and treewidth with one algorithm
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Graph classes with structured neighborhoods and algorithmic applications
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
NP-completeness and APX-completeness of restrained domination in graphs
Theoretical Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
On the Grundy number of graphs with few P4's
Discrete Applied Mathematics
Fundamenta Informaticae
An incremental distributed algorithm for a partial Grundy coloring of graphs
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Maximum sizes of graphs with given restrained domination numbers
Discrete Applied Mathematics
Algorithmic aspect of stratified domination in graphs
Information Processing Letters
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
Graph classes with structured neighborhoods and algorithmic applications
Theoretical Computer Science
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science
Hi-index | 0.01 |
In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible as solutions for practical applications.We give a precise characterization of vertex partitioning problems, which include domination, coloring and packing problems, and their variants. Several new graph parameters are introduced as generalizations of classical parameters. This characterization provides a basis for a taxonomy of a large class of problems, facilitating their common algorithmic treatment and allowing their uniform complexity classification.We present a design methodology of practical solution algorithms for generally $\NP$-hard problems when restricted to partial k-trees (graphs with treewidth bounded by k). This "practicality" accounts for dependency on the parameter k of the computational complexity of the resulting algorithms.By adapting the algorithm design methodology on partial k-trees to vertex partitioning problems, we obtain the first algorithms for these problems with reasonable time complexity as a function of treewidth. As an application of the methodology, we give the first polynomial-time algorithm on partial k-trees for computation of the Grundy number.