1. Bogart, K.P., West, D.B.: A short proof that “proper=unit”. Discret. Math. 201, 21–23 (1999)
2. Corneil, D.G.: A simple 3-sweep LBFS algorithm for recognition of unit interval graphs. Discret. Appl. Math. 138, 371–379 (2004)
3. Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? (Extended abstract). In: Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 175–180 (1998)
4. Das, A.K., Sahu, R.: A characterization of unit interval bigraphs of open and closed intervals. J. Graph Theory (under revision)
5. Das, A.K., Das, S., Sen, M.: Forbidden substructure for interval digraphs/bigraphs. Discret. Math. 339, 1028–1051 (2016)