Incremental modular decomposition
Journal of the ACM (JACM)
Theory of 2-structures. Part II: representation through labeled tree families
Theoretical Computer Science
P4-trees and substitution decomposition
Discrete Applied Mathematics
Circular permutation graph family with applications
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
A k-structure generalization of the theory of 2-structures
Theoretical Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
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
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th 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
Recognition and Orientation Algorithms for P4-Comparability Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A note on transitive orientations with maximum sets of sources and sinks
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
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)
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel algorithms for P4-comparability graphs
Journal of Algorithms
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
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)
The complexity of modular decomposition of boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
List matrix partitions of chordal graphs
Theoretical Computer Science - Graph colorings
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
The pair completion algorithm for the homogeneous set sandwich problem
Information Processing Letters
Enumerating consistent metaquery instantiations
AI Communications
On transitive orientations with restricted covering graphs
Information Processing Letters
Note: Matching cutsets in graphs of diameter 2
Theoretical Computer Science
The complexity of modular decomposition of Boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
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)
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
Information Processing Letters
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
The possible cardinalities of global secure sets in cographs
Theoretical 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
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Recognizing HHD-free and welsh-powell opposition graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Graph-based data clustering with overlaps
Discrete Optimization
The facets of the polytope of modules of a graph
Operations Research Letters
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
Theoretical Computer Science
A Characterization of b-Perfect Graphs
Journal of Graph Theory
Minimal separators in extended P4-laden graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |