The closure of Monadic NP (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Linear-time transitive orientation
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
Polynomial time recognition of P4-structure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
Search in Indecomposable Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note on the homogeneous set sandwich problem
Information Processing Letters
Convex circuit-free coloration of an oriented graph
European Journal of Combinatorics
Critically indecomposable graphs
Discrete Applied Mathematics
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note on the Homogeneous Set Sandwich Problem
Information Processing Letters
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
Conditionally critical indecomposable graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On indecomposability preserving elimination sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Indecomposability graph and indecomposability recognition
European Journal of Combinatorics
Hi-index | 0.04 |