Data structures and network algorithms
Data structures and network algorithms
Introduction to algorithms
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient Parallel Modular Decomposition (Extended Abstract)
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract)
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Linear-time transitive orientation
SODA '97 Proceedings of the eighth 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
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Recognition of P4-Comparability 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
Recognition of some perfectly orderable graph classes
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"
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
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Bimodular decomposition of bipartite graphs
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
| Hi-index | 0.00 |