1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. Parameterized complexity analysis in computational biology;Bodlaender;Comput. Appl. Biosci.,1995
3. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. Syst. Sci.,1976
4. Dynamic representations of interval graphs;Crespelle,2009
5. An O(n2)-time algorithm for the minimal interval completion problem;Crespelle,2010