Bonomo-Braberman, Flavia; Gonzalez, Carolina L.; Oliveira, Fabiano S.; Sampaio, Moysés S. Jr.; Szwarcfiter, Jayme L. Thinness of product graphs. (English) Zbl 1485.05049 Discrete Appl. Math. 312, 52-71 (2022). MSC: 05C15 05C76 05C35 05C99 68Q25 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Discrete Appl. Math. 312, 52--71 (2022; Zbl 1485.05049) Full Text: DOI
Nascimento, Julliano R.; Souza, Uéverton S.; Szwarcfiter, Jayme L. Partitioning a graph into complementary subgraphs. (English) Zbl 1469.05144 Graphs Comb. 37, No. 4, 1311-1331 (2021). MSC: 05C70 05C60 PDFBibTeX XMLCite \textit{J. R. Nascimento} et al., Graphs Comb. 37, No. 4, 1311--1331 (2021; Zbl 1469.05144) Full Text: DOI
Lima, Carlos V. G. C.; Oliveira, Leonardo I. L.; Barbosa, Valmir C.; Dourado, Mitre C.; Protti, Fábio; Szwarcfiter, Jayme L. A computational study of \(f\)-reversible processes on graphs. (English) Zbl 1387.05258 Discrete Appl. Math. 245, 77-93 (2018). MSC: 05C99 05C50 68Q25 PDFBibTeX XMLCite \textit{C. V. G. C. Lima} et al., Discrete Appl. Math. 245, 77--93 (2018; Zbl 1387.05258) Full Text: DOI arXiv
Groshaus, Marina; Lin, Min Chih; Szwarcfiter, Jayme L. On neighborhood-Helly graphs. (English) Zbl 1350.05167 Discrete Appl. Math. 216, Part 1, 191-202 (2017). MSC: 05C99 52A35 68Q17 PDFBibTeX XMLCite \textit{M. Groshaus} et al., Discrete Appl. Math. 216, Part 1, 191--202 (2017; Zbl 1350.05167) 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
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
Rautenbach, Dieter; Szwarcfiter, Jayme L. Unit interval graphs of open and closed intervals. (English) Zbl 1261.05070 J. Graph Theory 72, No. 3-4, 418-429 (2013). MSC: 05C62 05C90 PDFBibTeX XMLCite \textit{D. Rautenbach} and \textit{J. L. Szwarcfiter}, J. Graph Theory 72, No. 3--4, 418--429 (2013; Zbl 1261.05070) Full Text: DOI
Dourado, Mitre C.; Le, Van Bang; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. Mixed unit interval graphs. (English) Zbl 1251.05037 Discrete Math. 312, No. 22, 3357-3363 (2012). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 312, No. 22, 3357--3363 (2012; Zbl 1251.05037) Full Text: DOI
Rautenbach, Dieter; Szwarcfiter, Jayme L. Unit interval graphs: a story with open ends. (English) Zbl 1274.05405 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 737-742 (2011). MSC: 05C75 05C62 PDFBibTeX XMLCite \textit{D. Rautenbach} and \textit{J. L. Szwarcfiter}, Electron. Notes Discrete Math. 38, 737--742 (2011; Zbl 1274.05405) Full Text: Link
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
Joeris, Benson L.; Lin, Min Chih; McConnell, Ross M.; Spinrad, Jeremy P.; Szwarcfiter, Jayme L. Linear-time recognition of Helly circular-arc models and graphs. (English) Zbl 1209.68376 Algorithmica 59, No. 2, 215-239 (2011). MSC: 68R10 PDFBibTeX XMLCite \textit{B. L. Joeris} et al., Algorithmica 59, No. 2, 215--239 (2011; Zbl 1209.68376) Full Text: DOI
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
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. Some remarks on the geodetic number of a graph. (English) Zbl 1209.05129 Discrete Math. 310, No. 4, 832-837 (2010). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 310, No. 4, 832--837 (2010; Zbl 1209.05129) Full Text: DOI Link
Dourado, Mitre C.; Gimbel, John G.; Kratochvíl, Jan; Protti, Fábio; Szwarcfiter, Jayme L. On the computation of the hull number of a graph. (English) Zbl 1215.05184 Discrete Math. 309, No. 18, 5668-5674 (2009). MSC: 05C85 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 309, No. 18, 5668--5674 (2009; Zbl 1215.05184) Full Text: DOI
Lin, Min Chih; Szwarcfiter, Jayme L. Characterizations and recognition of circular-arc graphs and subclasses: a survey. (English) Zbl 1228.05218 Discrete Math. 309, No. 18, 5618-5635 (2009). MSC: 05C62 05C38 05C85 05-02 PDFBibTeX XMLCite \textit{M. C. Lin} and \textit{J. L. Szwarcfiter}, Discrete Math. 309, No. 18, 5618--5635 (2009; Zbl 1228.05218) 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
Groshaus, Marina; Szwarcfiter, Jayme L. Biclique-Helly graphs. (English) Zbl 1140.05314 Graphs Comb. 23, No. 6, 633-645 (2007). MSC: 05C62 05C85 PDFBibTeX XMLCite \textit{M. Groshaus} and \textit{J. L. Szwarcfiter}, Graphs Comb. 23, No. 6, 633--645 (2007; Zbl 1140.05314) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. On the generation of bicliques of a graph. (English) Zbl 1126.05074 Discrete Appl. Math. 155, No. 14, 1826-1832 (2007). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Discrete Appl. Math. 155, No. 14, 1826--1832 (2007; Zbl 1126.05074) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. Generating bicliques of a graph in lexicographic order. (English) Zbl 1076.68048 Theor. Comput. Sci. 337, No. 1-3, 240-248 (2005). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C85 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Theor. Comput. Sci. 337, No. 1--3, 240--248 (2005; Zbl 1076.68048) Full Text: DOI