1. Berry, A., Golumbic, M., & Lipshteyn, M. (2004). Two tricks to triangulate chordal probe graphs in polynomial time. In Proc. of the 12th ACM-SIAM symp. on discrete algorithms (SODA04). Association for Computing Machinery.
2. Bogart, K., Rabinovitch, I., & Trotter, W.T. (1976). A bound on the dimension of interval orders. Journal of Combinatorial Theory A, 21, 219–238.
3. Boland, J. & Lekkerkerker, C. (1962). Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae, 51, 45–64.
4. Brown, D. & Langley, L. (2006). Probe interval graphs and orders. In Thirty-Sixth International Southeastern Conference on Combinatorics, Graph Theory, and Computing.
5. Brown, D. & Lundgren, J. (2006). Bipartite probe interval graphs, interval point bigraphs, and circular arc graphs. Australasian Journal of Combinatorics, 35, 221–236.