Corneil, Derek G.; Dusart, Jérémie; Habib, Michel; Köhler, Ekkehard On the power of graph searching for cocomparability graphs. (English) Zbl 1333.05285 SIAM J. Discrete Math. 30, No. 1, 569-591 (2016). MSC: 05C85 68R10 06A07 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., SIAM J. Discrete Math. 30, No. 1, 569--591 (2016; Zbl 1333.05285) Full Text: DOI
Corneil, Derek G.; Dusart, Jérémie; Habib, Michel; Mamcarz, Antoine; de Montgolfier, Fabien A tie-break model for graph search. (English) Zbl 1326.05151 Discrete Appl. Math. 199, 89-100 (2016). MSC: 05C85 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 199, 89--100 (2016; Zbl 1326.05151) Full Text: DOI arXiv
Corneil, Derek G.; Stacho, Juraj Vertex ordering characterizations of graphs of bounded asteroidal number. (English) Zbl 1306.05056 J. Graph Theory 78, No. 1, 61-79 (2015). MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{D. G. Corneil} and \textit{J. Stacho}, J. Graph Theory 78, No. 1, 61--79 (2015; Zbl 1306.05056) Full Text: DOI
Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek Practical and efficient split decomposition via graph-labelled trees. (English) Zbl 1303.05191 Algorithmica 69, No. 4, 789-843 (2014). MSC: 05C85 05C70 05C05 05C78 PDFBibTeX XMLCite \textit{E. Gioan} et al., Algorithmica 69, No. 4, 789--843 (2014; Zbl 1303.05191) Full Text: DOI arXiv
Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek Practical and efficient circle graph recognition. (English) Zbl 1303.05190 Algorithmica 69, No. 4, 759-788 (2014). MSC: 05C85 05C70 68P05 68Q25 PDFBibTeX XMLCite \textit{E. Gioan} et al., Algorithmica 69, No. 4, 759--788 (2014; Zbl 1303.05190) Full Text: DOI arXiv
Corneil, Derek G.; Habib, Michel; Lanlignel, Jean-Marc; Reed, Bruce; Rotics, Udi Polynomial-time recognition of clique-width \(\leq 3\) graphs. (English) Zbl 1237.05147 Discrete Appl. Math. 160, No. 6, 834-865 (2012). MSC: 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 160, No. 6, 834--865 (2012; Zbl 1237.05147) Full Text: DOI
Corneil, Derek G.; Köhler, Ekkehard; Lanlignel, Jean-Marc On end-vertices of lexicographic breadth first searches. (English) Zbl 1225.05229 Discrete Appl. Math. 158, No. 5, 434-443 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 158, No. 5, 434--443 (2010; Zbl 1225.05229) Full Text: DOI
Corneil, Derek G. A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. (English) Zbl 1042.05067 Discrete Appl. Math. 138, No. 3, 371-379 (2004). MSC: 05C60 05C85 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil}, Discrete Appl. Math. 138, No. 3, 371--379 (2004; Zbl 1042.05067) Full Text: DOI
Corneil, Derek G.; Dragan, Feodor F.; Köhler, Ekkehard On the power of BFS to determine a graph’s diameter. (English) Zbl 1036.68072 Networks 42, No. 4, 209-222 (2003). MSC: 68R10 05C12 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Networks 42, No. 4, 209--222 (2003; Zbl 1036.68072) Full Text: DOI
Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe Diameter determination on restricted graph families. (English) Zbl 0990.05119 Discrete Appl. Math. 113, No. 2-3, 143-166 (2001). MSC: 05C90 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 113, No. 2--3, 143--166 (2001; Zbl 0990.05119) Full Text: DOI