Graph theory with applications to algorithms and computer science
On n-domination, n-dependence and forbidden subgraphs
Graph theory with applications to algorithms and computer science
NP-completeness of edge-colouring some restricted graphs
Discrete Applied Mathematics
Some results concerning the complexity of restricted colorings of graphs
Discrete Applied Mathematics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Restrictions and preassignments in preemptive open shop scheduling
Discrete Applied Mathematics
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Feasible edge colorings of trees with cardinality constraints
Discrete Mathematics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Generalized Coloring for Tree-like Graphs
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Data reduction for graph coloring problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing the tutte polynomial on graphs of bounded clique-width
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Graphs of separability at most 2
Discrete Applied Mathematics
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics
Data reduction for graph coloring problems
Information and Computation
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics
| Hi-index | 0.05 |
We consider both the vertex and the edge versions of three graph partitioning problems. These problems are dominating set, list-q-coloring with costs (fixed number of colors q) and chromatic number. They are all known to be NP-hard in general. We show that all these problems (except edge-coloring) can be solved in polynomial time on graphs with clique-width bounded by some constant k, if the k-expression of the input graph is also given. In particular, we present the first polynomial algorithms (on these classes) for chromatic number, edge-dominating set and list-q-coloring with costs (fixed number of colors q, both vertex and edge versions). For the two list-q-coloring problems with costs, we even have linear algorithms. Since these classes of graphs include classes like P4-sparse graphs, distance hereditary graphs and graphs with bounded treewidth, our algorithms also apply to these graphs.