Soulignac, Francisco J. A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. (English) Zbl 1517.05170 Theor. Comput. Sci. 889, 105-134 (2021). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Theor. Comput. Sci. 889, 105--134 (2021; Zbl 1517.05170) Full Text: DOI arXiv
Soulignac, Francisco J. Total 2-domination of proper interval graphs. (English) Zbl 1509.05142 Discrete Appl. Math. 302, 256-262 (2021). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Discrete Appl. Math. 302, 256--262 (2021; Zbl 1509.05142) Full Text: DOI arXiv
Soulignac, Francisco J. Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory. (English) Zbl 1361.05089 J. Graph Algorithms Appl. 21, No. 4, 455-489 (2017). MSC: 05C62 05C85 PDFBibTeX XMLCite \textit{F. J. Soulignac}, J. Graph Algorithms Appl. 21, No. 4, 455--489 (2017; Zbl 1361.05089) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. A faster algorithm for the cluster editing problem on proper interval graphs. (English) Zbl 1338.68113 Inf. Process. Lett. 115, No. 12, 913-916 (2015). MSC: 68Q25 05C62 05C85 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Inf. Process. Lett. 115, No. 12, 913--916 (2015; Zbl 1338.68113) Full Text: DOI
Soulignac, Francisco J. Fully dynamic recognition of proper circular-arc graphs. (English) Zbl 1323.05125 Algorithmica 71, No. 4, 904-968 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 05C85 05C62 05C40 68Q25 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Algorithmica 71, No. 4, 904--968 (2015; Zbl 1323.05125) Full Text: DOI arXiv Link
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Normal Helly circular-arc graphs and its subclasses. (English) Zbl 1263.05064 Discrete Appl. Math. 161, No. 7-8, 1037-1059 (2013). MSC: 05C62 05C75 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 161, No. 7--8, 1037--1059 (2013; Zbl 1263.05064) Full Text: DOI
Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz Powers of cycles, powers of paths, and distance graphs. (English) Zbl 1213.05148 Discrete Appl. Math. 159, No. 7, 621-627 (2011). MSC: 05C38 05C12 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 159, No. 7, 621--627 (2011; Zbl 1213.05148) Full Text: DOI Link
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. The clique operator on circular-arc graphs. (English) Zbl 1209.05246 Discrete Appl. Math. 158, No. 12, 1259-1267 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 158, No. 12, 1259--1267 (2010; Zbl 1209.05246) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs. (English) Zbl 1155.05339 Gudmundsson, Joachim (ed.), Algorithm theory – SWAT 2008. 11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2–4, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69900-2/pbk). Lecture Notes in Computer Science 5124, 355-366 (2008). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Lect. Notes Comput. Sci. 5124, 355--366 (2008; Zbl 1155.05339) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Proper Helly circular-arc graphs. (English) Zbl 1141.68539 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 248-257 (2007). MSC: 68R10 05C62 05C85 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Lect. Notes Comput. Sci. 4769, 248--257 (2007; Zbl 1141.68539) Full Text: DOI