On generating all maximal independent sets
Information Processing Letters
Stability in circular arc graphs
Journal of Algorithms
On diameters and radii of bridged graphs
Discrete Mathematics
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Applied Mathematics
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Stable sets in certain P6-free graphs
Discrete Applied Mathematics
Weakly chordal graph algorithms via handles
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A note on &agr;-redundant vertices in graphs
Discrete Applied Mathematics
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing
Domination in Convex Bipartite and Convex-round Graphs
Domination in Convex Bipartite and Convex-round Graphs
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics
On easy and hard hereditary classes of graphs with respect to the independent set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Augmenting graphs for independent sets
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
On clique separators, nearly chordal graphs, and the maximum weight stable set problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
Independent Sets of Maximum Weight in Apple-Free Graphs
SIAM Journal on Discrete Mathematics
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Journal of Discrete Algorithms
Maximum weight independent sets in hole- and dart-free graphs
Discrete Applied Mathematics
Maximum weight independent sets in (P6,co-banner)-free graphs
Information Processing Letters
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
| Hi-index | 5.23 |
Clique separators in graphs are a helpful tool used by Tarjan as a divide-and-conquer approach for solving various graph problems such as the Maximum Weight Stable Set (MWS) Problem, Maximum Clique, Graph Coloring and Minimum Fill-in, but few examples of graph classes having clique separators are known. We use this method to solve MWS in polynomial time for two classes where the unweighted Maximum Stable Set (MS) Problem is solvable in polynomial time by augmenting techniques but the complexity of the MWS problem was open. Another example, namely a result by Alekseev for the MWS problem on a subclass of P"5-free graphs obtained by clique separators, can be improved by our techniques. We also combine clique separators with decomposition by homogeneous sets in graphs and use the following notion: A graph is nearly@P if for each of its vertices, the subgraph induced by the set of its nonneighbors has property @P. We deal with the cases @P@?{chordal,perfect}. This also simplifies a result obtained by a method called struction.