The PIGs Full Monty ??? A Floor Show of Minimal Separators, Proceedings of 22nd Symposium on Theoretical Aspects of Computer Science (STACS), pp.521-532, 2005. ,
DOI : 10.1007/978-3-540-31856-9_43
Probe interval bigraphs, 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics, 2005. ,
DOI : 10.1016/j.endm.2005.05.027
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs, Proceedings of the 11th International Computing and Combinatorics Conference (COCOON), pp.808-817, 2005. ,
DOI : 10.1007/11533719_82
Split graphs, Proc. 8th southeast. Conf. on Combinatorics, graph theory, and computing; Baton Rouge, pp.311-315, 1977. ,
Chordal probe graphs, Discrete Applied Mathematics, vol.143, issue.1-3, pp.221-237, 2004. ,
DOI : 10.1016/j.dam.2003.12.009
URL : https://hal.archives-ouvertes.fr/hal-00678308
The splittance of a graph, Combinatorica, vol.32, issue.3, pp.275-284, 1981. ,
DOI : 10.1007/BF02579333
Slim graphs. Graphs Comb, pp.149-157, 1989. ,
On slim graphs, even pairs, and star-cutsets, Discrete Mathematics, vol.105, issue.1-3, pp.93-102, 1992. ,
DOI : 10.1016/0012-365X(92)90134-2
A polynomial time recognition algorithm for probe interval graphs, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithmsSIAM), pp.477-486, 2001. ,
Construction of probe interval models, Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithmsSIAM), pp.866-875, 2002. ,
On probe interval graphs, Discrete Applied Mathematics, vol.88, issue.1-3, pp.315-324, 1998. ,
DOI : 10.1016/S0166-218X(98)00077-8
2-Tree probe interval graphs have a large obstruction set, Discrete Applied Mathematics, vol.150, issue.1-3, pp.216-231, 2005. ,
DOI : 10.1016/j.dam.2004.06.015
Cycle free probe interval graphs, Congr. Numerantium, vol.140, pp.33-42, 1999. ,
Probe interval graphs and its application to physical mapping of DNA. Unpublished, 1994. ,