This paper is cited by
Jonathan Roy Backer,
On the square of AT-free graphs ,
Thesis of M.Sc. Degrees, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, Fall 2002.
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul,
A simple linear time LexBFS cograph recognition algorithm ,
Proceedings of 29th International Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2003) Elspeet, The Netherlands, June 19-21, 2003,
Lecture Notes in Computer Science Vol. 2880, pp. 119-130.
Jou-Ming Chang,
Induced matchings in asteroidal triple-free graphs ,
Discrete Applied Mathematics 132 (2003) 67-78.
(*)
Derek G. Corneil,
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs ,
Discrete Applied Mathematics 138 (2004) 371-379.
(*)
Hamid Zarrabi-Zadeh,
A LexBFS algorithm for proper interval graph recognition ,
Technique Report, School of Computer Science, University of Waterloo.
Derek G. Corneil,
Lexicographic breadth first search --- A survey ,
Proceedings of 30th International Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2003) Bad Honnef, Germany, June 21-23, 2004,
Lecture Notes in Computer Science Vol. 3353, pp. 1-19.
Pavol Hell, Jing Huang,
Certifying lexbfs recognition algorithms for proper interval graphs and proper interval bigraphs ,
SIAM Journal on Discrete Mathematics 18 (2005) 554-570.
(*)
Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan,
Generalized powers of graphs and their algorithmic use ,
Proceedings of 10th ScandinavianWorkshop on Algorithm Theory
(SWAT 2006) Riga, Latvia, July 6-8, 2006,
Lecture Notes in Computer Science Vol. 4059, pp. 423-434.
Stefan Felsner, Johan Nilsson,
On the order dimension of outerplanar maps ,
Manuscript.
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul,
A simple linear time LexBFS cograph recognition algorithm ,
SIAM Journal on Discrete Mathematics 22 (2008) 1277-1296.
(*)
Jonathan Backer,
Separator orders in interval, cocomparability, and AT-free graphs ,
Discrete Applied Mathematics 159 (2011) 717-726.
(*)
Peng Li, Yaokun Wu,
Maximal neighborhood search and rigid interval graphs ,
Journal of Graph Algorithms and Applications 17 (2013) 245-264.
Jou-Ming Chang, Ton Kloks, Hung-Lung Wang,
Gray codes for AT-free orders via antimatroids ,
Proceedings of 26th International Workshop on Combinatorial Algorithms,
(IWOCA 2015) Verona, Italy, Oct. 5-7, 2015,
Lecture Notes in Computer Science Vol. 9538, pp. 77-87.
Jan Gorzny,
On end vertices of search algorithms ,
Master Thesis , University of Victoria, 2015.
Silvio Luiz Bragatto Boss, Jair Donadelli, André Luiz Pires Guedes,
Extensões e caracterizações de buscas para hipergrafos com arestas múltiplas ,
Revista Brasileira de Computação Aplicada, Passo Fundo, 8 (2016) 16-27.
Jan Gorzny, Jing Huang,
End-vertices of LBFS of (AT-free) bigraphs ,
Discrete Applied Mathematics 225 (2017) 87-94.
Jan Gorzny, Jing Huang,
End-vertices of AT-free bigraphs ,
Proceedings of 26th International Conference on Computing and Combinatorics,
(COCOON 2020) Verona, Atlanta, GA, USA, Aug. 29-31, 2020,
Lecture Notes in Computer Science Vol. 12273, pp. 52-63.