A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel algorithms for P4-comparability graphs
Journal of Algorithms
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
A note on computing set overlap classes
Information Processing Letters
Theoretical Computer Science
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
NLC-2 graph recognition and isomorphism
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Dynamic distance hereditary graphs using split decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Using split composition to extend distance-hereditary graphs in a generative way
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Consecutive ones property testing: cut or swap
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Homogeneity vs. adjacency: generalising some graph decomposition algorithms
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Revisiting t. uno and m. yagiura's algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Bimodular decomposition of bipartite graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Coloring a graph using split decomposition
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
An adaptive parallel hierarchical clustering algorithm
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Journal of Discrete Algorithms
Future Generation Computer Systems
| Hi-index | 0.00 |