Incremental modular decomposition
Journal of the ACM (JACM)
Decomposition of k-ary relations
Discrete Mathematics
P4-trees and substitution decomposition
Discrete Applied Mathematics
A k-structure generalization of the theory of 2-structures
Theoretical Computer Science
Efficient and practical modular decomposition
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Recognition and Isomorphism of Two Dimensional Partial Orders
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical 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
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
Parallel algorithms for P4-comparability graphs
Journal of Algorithms
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Enumeration aspects of maximal cliques and bicliques
Discrete Applied Mathematics
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Discrete Applied Mathematics
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Collective tree spanners and routing in AT-free related graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |