Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Linear-time transitive orientation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient and practical modular decomposition
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time recognition of P4-structure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Forbidden subgraph decomposition
Discrete Mathematics
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Decomposing Graphs with Symmetries
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Search in Indecomposable Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
A note on transitive orientations with maximum sets of sources and sinks
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
Discrete Applied Mathematics
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
On variations of P4-sparse graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
A fully dynamic algorithm for modular decomposition and recognition of cographs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
The complexity of modular decomposition of boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
The clique operator on graphs with few P4's
Discrete Applied Mathematics
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Enumerating consistent metaquery instantiations
AI Communications
On transitive orientations with restricted covering graphs
Information Processing Letters
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
Note: Matching cutsets in graphs of diameter 2
Theoretical Computer Science
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Probe threshold and probe trivially perfect graphs
Theoretical Computer Science
The complexity of modular decomposition of Boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
The clique operator on graphs with few P4's
Discrete Applied Mathematics
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
The multiple domination and limited packing problems in graphs
Information Processing Letters
The possible cardinalities of global secure sets in cographs
Theoretical Computer Science
A fully dynamic algorithm for the recognition of P4-sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Homogeneity vs. adjacency: generalising some graph decomposition algorithms
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Computing common intervals of K permutations, with applications to modular decomposition of graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On indecomposability preserving elimination sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Revisiting t. uno and m. yagiura's algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Bimodular decomposition of bipartite graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
The facets of the polytope of modules of a graph
Operations Research Letters
On the recognition of k-equistable graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On minimal forbidden subgraph characterizations of balanced graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |