A dynamic programming approach to the dominating set problem on k trees
SIAM Journal on Algebraic and Discrete Methods
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Discrete Applied Mathematics
Clique transversal and clique independence on comparability graphs
Information Processing Letters
On the structure of graphs with few P4s
Discrete Applied Mathematics
Graph classes: a survey
Graph Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic Programming on Distance-Hereditary Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
-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
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
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
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.01 |
A maximum clique transversal set in a graph G is a set S of vertices such that every maximum clique of G contains at least a vertex in S. Clearly, removing a maximum clique transversal set reduces the clique number of a graph. We study algorithmic aspects of the problem, given a graph, to find a maximum clique transversal set of minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results.We also examine some other graph classes: subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few P4s, comparability graphs, and distance hereditary graphs.