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
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Linear-time transitive orientation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Reconstruction algorithm for permutation graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Hi-index | 0.00 |