An O(n2) algorithm for undirected split decomposition

Algorithms for maximum weight induced paths

Information Processing Letters

Solving some NP-complete problems using split decomposition

Discrete Applied Mathematics

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

Reduced clique graphs of chordal graphs

European Journal of Combinatorics

Coloring a graph using split decomposition

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs

Discrete Applied Mathematics

Polynomial-time recognition of clique-width ≤3 graphs

Discrete Applied Mathematics

Reconstruction algorithm for permutation graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Detecting 2-joins faster

Journal of Discrete Algorithms