Incremental modular decomposition
Journal of the ACM (JACM)
An O(n2) time algorithm for the 2-chain cover problem and related problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Transitive orientation in 0(n2) time
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
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)
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
Discrete Applied Mathematics
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
The number of plane diagrams of a lattice
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
| Hi-index | 0.00 |