Francis, Mathew; Hell, Pavol; Stacho, Juraj Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. (English) Zbl 1371.05244 Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1708-1727 (2015). Cited in 6 Documents MSC: 05C75 Structural characterization of families of graphs 05C85 Graph algorithms (graph-theoretic aspects) 68Q25 Analysis of algorithms and problem complexity 68W05 Nonnumerical algorithms PDFBibTeX XMLCite \textit{M. Francis} et al., in: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4--6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1708--1727 (2015; Zbl 1371.05244) Full Text: DOI arXiv