{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T13:48:13Z","timestamp":1782308893650,"version":"3.54.5"},"reference-count":44,"publisher":"Sociedade Brasileira de Computa\u00e7\u00e3o","issue":"1","license":[{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JBCS"],"abstract":"<jats:p>Landmarks are important and yet hard to celebrate. We have the privilege of witnessing Jayme Luiz Szwarcfiter reach 48 supervised doctoral theses as we celebrate the 50th anniversary of his own doctoral degree. The past five decades have witnessed the birth and growth of a vibrant research community on Graphs and Algorithms in Brazil, covering both the diversity of themes and the diversity of regions of our continental country. Jayme has acted as a key catalyst in articulating collaborations beyond the regions of Brazil to reach Argentina, Mexico, and Chile. He has fostered regional and international collaboration and helped consolidate different research groups in Latin America. On this landmark occasion, we describe some of the noteworthy achievements of our community, with special attention to Professor Szwarcfiter's role.<\/jats:p>","DOI":"10.5753\/jbcs.2026.8350","type":"journal-article","created":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T13:08:55Z","timestamp":1782306535000},"page":"1590-1597","source":"Crossref","is-referenced-by-count":0,"title":["Graphs and Algorithms celebrating a fifty-year landmark"],"prefix":"10.5753","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6393-0876","authenticated-orcid":false,"given":"Celina M. H.","family":"De Figueiredo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9924-0079","authenticated-orcid":false,"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4608-4559","authenticated-orcid":false,"given":"Vinicius F.","family":"Dos Santos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"3742","published-online":{"date-parts":[[2026,6,16]]},"reference":[{"key":"1","unstructured":"Abreu, N. M. M., Del-Vecchio, R. R., Vinagre, C. T. M., and Stevanovi\u0107, D. (2012). <i>Introdu\u00e7\u00e3o \u00e0 Teoria Espectral de Grafos com Aplica\u00e7\u00f5es<\/i>. Sociedade Brasileira de Matem\u00e1tica Aplicada e Computacional. Available at: [<a href=\"https:\/\/www.sbmac.org.br\/wp-content\/uploads\/2022\/08\/livro_27.pdf\">link<\/a>]."},{"key":"2","unstructured":"Ara\u00fajo, J., Dourado, M. C., Protti, F., and Sampaio, R. (2023). <i>Uma Introdu\u00e7\u00e3o \u00e0 Convexidade em Grafos<\/i>. IMPA. Available at: [<a href=\"https:\/\/coloquio34.impa.br\/pdf\/34CBM01-eBook.pdf\">link<\/a>]."},{"key":"3","unstructured":"Ara\u00fajo, S. N., Martins, N. A., Nisse, N., and Sampaio, R. (2025). <i>Teoria dos Jogos Combinat\u00f3rios em Grafos<\/i>. IMPA. Available at:[<a href=\"https:\/\/inria.hal.science\/hal-05410192\">link<\/a>]."},{"key":"4","doi-asserted-by":"crossref","unstructured":"Barbosa, V. C. (1996). <i>An Introduction to Distributed Algorithms<\/i>. MIT Press. DOI: <a href=\"https:\/\/doi.org\/10.1016\/s0898-1221(97)90063-8\">10.1016\/s0898-1221(97)90063-8<\/a>.","DOI":"10.1016\/S0898-1221(97)90063-8"},{"key":"5","unstructured":"Botler, F., Collares, M., Martins, T., Mendon\u00e7a, W., Mota, G., and Morris, R. (2021). <i>Combinat\u00f3ria<\/i>. IMPA. Avaialble at:[<a href=\"https:\/\/coloquio33.impa.br\/pdf\/33CBM02-eBook-preview.pdf\">link<\/a>]."},{"key":"6","unstructured":"Carvalho, M., Cerioli, M., Dahab, R., Feofiloff, P., Fernandes, C., Ferreira, C., Guimaraes, K., Miyazawa, F., Pina Jr, J., Soares, J., and Wakabayashi, Y. (2001). <i>Uma Introdu\u00e7\u00e3o Sucinta a Algoritmos de Aproxima\u00e7\u00e3o<\/i>. IMPA. Book."},{"key":"7","doi-asserted-by":"crossref","unstructured":"Cerioli, M. R., de Souza Oliveira, F., and Szwarcfiter, J. L. (2011). The interval count of interval graphs and orders: a short survey. <i>Journal of the Brazilian Computer Society<\/i>, 18(2):103\u2013112. DOI: <a href=\"https:\/\/doi.org\/10.1007\/s13173-011-0047-1\">10.1007\/s13173-011-0047-1<\/a>.","DOI":"10.1007\/s13173-011-0047-1"},{"key":"8","unstructured":"Coutinho, S. C. (1997). <i>N\u00fameros Inteiros e Criptografia RSA<\/i>. IMPA. Book."},{"key":"9","unstructured":"de Figueiredo, C. M. and Barbosa, V. C. (2002). Special issue in honor of Jayme Luiz Szwarcfiter's 60th birthday. <i>Journal of the Brazilian Computer Society<\/i>, 7:1. Available at:[<a href=\"https:\/\/dblp.org\/db\/journals\/jbcs\/jbcs7.html \">link<\/a>]."},{"key":"10","doi-asserted-by":"crossref","unstructured":"de Figueiredo, C. M. and Lamb, L. C. (2015). <i>Teoria da Computa\u00e7\u00e3o: Uma Introdu\u00e7\u00e3o \u00e0 Complexidade e \u00e0 L\u00f3gica Computacional<\/i>. Jornadas de Atualiza\u00e7\u00e3o em Inform\u00e1tica (JAI). Sociedade Brasileira de Computa\u00e7\u00e3o. DOI: <a href=\"https:\/\/doi.org\/10.5753\/sbc.6899.3.1\">10.5753\/sbc.6899.3.1<\/a>.","DOI":"10.5753\/sbc.6899.3.1"},{"key":"11","unstructured":"de Figueiredo, C. M., Lemos, M. J. M. S., da Fonseca, G. D., and de S\u00e1, V. G. P. (2007). <i>Introdu\u00e7\u00e3o aos Algoritmos Randomizados<\/i>. IMPA, Rio de Janeiro. Available at:[<a href=\"https:\/\/impa.br\/wp-content\/uploads\/2017\/04\/26CBM_07.pdf\">link<\/a>]."},{"key":"12","unstructured":"de Figueiredo, C. M., Meidanis, J., and Mello, C. P. (1997). <i>Colora\u00e7\u00e3o em Grafos<\/i>. Jornadas de Atualiza\u00e7\u00e3o em Inform\u00e1tica (JAI). Sociedade Brasileira de Computa\u00e7\u00e3o. Available at:[<a href=\"https:\/\/www.cos.ufrj.br\/~celina\/ftp\/jai97.pdf\">link<\/a>]."},{"key":"13","unstructured":"de Figueiredo, C. M. and Szwarcfiter, J. L. (1999). <i>Emparelhamentos em Grafos: Algoritmos e Complexidade<\/i>. Jornadas de Atualiza\u00e7\u00e3o em Inform\u00e1tica (JAI). Sociedade Brasileira de Computa\u00e7\u00e3o. Available at:[<a href=\"https:\/\/www.cos.ufrj.br\/~celina\/ftp\/jai99.pdf\">link<\/a>]."},{"key":"14","unstructured":"de Oliveira, M. C. F. (2012). Editorial for the special issue Graph Theory and Algorithms in honor of Jayme Luiz Szwarcfiter's 70th birthday. <i>Journal of the Brazilian Computer Society<\/i>, 18:1. Available at:[<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s13173-012-0076-4\">link<\/a>]."},{"key":"15","doi-asserted-by":"crossref","unstructured":"de Souza Oliveira, F. and dos Santos, V. (2022). Special issue in honor of Jayme Luiz Szwarcfiter's 80th birthday. <i>Cadernos do IME, S\u00e9rie Inform\u00e1tica<\/i>, 47. Available at:[<a href=\"https:\/\/www.e-publicacoes.uerj.br\/cadinf\/issue\/view\/2767\">link<\/a>].","DOI":"10.12957\/cadinf.2022.70588"},{"key":"16","doi-asserted-by":"crossref","unstructured":"dos Santos, V. F. and Souza, U. S. (2015). <i>Uma Introdu\u00e7\u00e3o \u00e0 Complexidade Parametrizada<\/i>, pages 232-273. Sociedade Brasileira de Computa\u00e7\u00e3o. DOI: <a href=\"https:\/\/doi.org\/10.5753\/sbc.6899.3.5\">10.5753\/sbc.6899.3.5<\/a>.","DOI":"10.5753\/sbc.6899.3.5"},{"key":"17","doi-asserted-by":"crossref","unstructured":"Dourado, M. C., Protti, F., and Szwarcfiter, J. L. (2006). Computational aspects of the Helly property: a survey. <i>Journal of the Brazilian Computer Society<\/i>, 12(1):7\u201333. DOI: <a href=\"https:\/\/doi.org\/10.1007\/BF03192385\">10.1007\/BF03192385<\/a>.","DOI":"10.1590\/S0104-65002006000200002"},{"key":"18","unstructured":"Faria, L., de Souza Oliveira, F., Pinto, P. E. D., and Szwarcfiter, J. L. (2021). <i>Ci\u00eancia de Dados: Algoritmos e Aplica\u00e7\u00f5es<\/i>. IMPA. Book."},{"key":"19","unstructured":"Feofiloff, P., Wakabayashi, Y., and Kohayakawa, Y. (2004). <i>Uma Introdu\u00e7\u00e3o Sucinta \u00e0 Teoria dos Grafos<\/i>. Sociedade Brasileira de Matem\u00e1tica. Book."},{"key":"20","doi-asserted-by":"crossref","unstructured":"Hoppen, C., Jacobs, D. P., and Trevisan, V. (2022). <i>Locating Eigenvalues in Graphs<\/i>. SpringerBriefs in Mathematics. Springer. DOI: <a href=\"https:\/\/doi.org\/10.1007\/978-3-031-11698-8\">10.1007\/978-3-031-11698-8<\/a>.","DOI":"10.1007\/978-3-031-11698-8"},{"key":"21","doi-asserted-by":"crossref","unstructured":"Itai, A., Papadimitriou, C. H., and Szwarcfiter, J. L. (1982). Hamilton paths in grid graphs. <i>SIAM Journal on Computing<\/i>, 11(4):676\u2013686. DOI: <a href=\"https:\/\/doi.org\/10.1137\/0211056\">10.1137\/0211056<\/a>.","DOI":"10.1137\/0211056"},{"key":"22","unstructured":"Knuth, D. (2026). Claude\u2019s cycles. Available at:[<a href=\"https:\/\/www-cs-faculty.stanford.edu\/~knuth\/papers\/claude-cycles.pdf\">link<\/a>]."},{"key":"23","doi-asserted-by":"crossref","unstructured":"Knuth, D. E. and Szwarcfiter, J. L. (1974). A structured program to generate all topological sorting arrangements. <i>Information Processing Letters<\/i>, 19:153-157. DOI: <a href=\"https:\/\/doi.org\/10.1016\/0020-0190(74)90001-5\">10.1016\/0020-0190(74)90001-5<\/a>.","DOI":"10.1016\/0020-0190(74)90001-5"},{"key":"24","doi-asserted-by":"crossref","unstructured":"Lin, M. C. and Szwarcfiter, J. L. (2009). Characterizations and recognition of circular-arc graphs and subclasses: A survey. <i>Discrete Mathematics<\/i>, 309(18):5618\u20135635. DOI: <a href=\"https:\/\/doi.org\/10.1016\/j.disc.2008.04.003\">10.1016\/j.disc.2008.04.003<\/a>.","DOI":"10.1016\/j.disc.2008.04.003"},{"key":"25","unstructured":"Lucchesi, C. L. (1979). <i>Introdu\u00e7\u00e3o \u00e0 Teoria dos Grafos<\/i>. IMPA. Book."},{"key":"26","unstructured":"Lucchesi, C. L. (1986). <i>Introdu\u00e7\u00e3o \u00e0 Criptografia Computacional<\/i>. Papirus. Book."},{"key":"27","doi-asserted-by":"crossref","unstructured":"Lucchesi, C. L. (2002). Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. <i>Journal of the Brazilian Computer Society<\/i>, 7:9-22. DOI: <a href=\"https:\/\/doi.org\/10.1590\/S0104-65002001000200003\">10.1590\/S0104-65002001000200003<\/a>.","DOI":"10.1590\/S0104-65002001000200003"},{"key":"28","doi-asserted-by":"crossref","unstructured":"Lucchesi, C. L. and Murty, U. (2024). <i>Perfect Matchings: A Theory of Matching Covered Graphs<\/i>. Springer. DOI: <a href=\"https:\/\/doi.org\/10.1007\/978-3-031-47504-7\">10.1007\/978-3-031-47504-7<\/a>.","DOI":"10.1007\/978-3-031-47504-7_1"},{"key":"29","unstructured":"Maculan, N. and Campello, R. E. (1994). <i>Algoritmos e Heur\u00edsticas: Desenvolvimento e Avalia\u00e7\u00e3o de Performance<\/i>. Editora da Universidade Federal Fluminense (EDUFF). Book."},{"key":"30","unstructured":"Marino, A. and Silva, A. (2023). <i>Paths and Connectivity in Temporal Graphs<\/i>. IMPA. Book."},{"key":"31","doi-asserted-by":"crossref","unstructured":"Miyazawa, F. K. and de Souza, C. C. (2015). <i>Introdu\u00e7\u00e3o \u00e0 Otimiza\u00e7\u00e3o Combinat\u00f3ria<\/i>. Jornadas de Atualiza\u00e7\u00e3o em Inform\u00e1tica (JAI). Sociedade Brasileira de Computa\u00e7\u00e3o. DOI: <a href=\"https:\/\/doi.org\/10.5753\/sbc.6899.3.3\">10.5753\/sbc.6899.3.3<\/a>.","DOI":"10.5753\/sbc.6899.3.3"},{"key":"32","unstructured":"Netto, P. B. (1996). <i>Grafos: Teoria, Modelos, Algoritmos<\/i>. Edgard Bl\u00fccher. Book."},{"key":"33","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. H. (1994). <i>Computational Complexity<\/i>. Addison-Wesley. DOI: <a href=\"https:\/\/doi.org\/10.1142\/9789814635295_0002\">10.1142\/9789814635295_0002<\/a>.","DOI":"10.1142\/9789814635295_0002"},{"key":"34","unstructured":"Simon, I., Simon, I., Simon, J., Lucchesi, C., and Kowaltowski, T. (1979). <i>Aspectos Te\u00f3ricos da Computa\u00e7\u00e3o<\/i>. IMPA. Book."},{"key":"35","unstructured":"Szwarcfiter, J. L. (1983). <i>Grafos e Algoritmos Computacionais<\/i>. Campus. Book."},{"key":"36","doi-asserted-by":"crossref","unstructured":"Szwarcfiter, J. L. (2003). <i>A Survey on Clique Graphs<\/i>, page 109\u2013136. Springer. DOI: <a href=\"https:\/\/doi.org\/10.1007\/0-387-22444-0_5\">10.1007\/0-387-22444-0_5<\/a>.","DOI":"10.1007\/0-387-22444-0_5"},{"key":"37","unstructured":"Szwarcfiter, J. L. (2018). <i>Teoria Computacional de Grafos: Os Algoritmos<\/i>. Elsevier. Book."},{"key":"38","unstructured":"Szwarcfiter, J. L. and Markenzon, L. (1994). <i>Estruturas de Dados e seus Algoritmos<\/i>. LTC. Book."},{"key":"39","unstructured":"Terada, R. (1982). <i>Desenvolvimento de Algoritmos e Complexidade de Computa\u00e7\u00e3o<\/i>. PUC-Rio. Book."},{"key":"40","unstructured":"Terada, R. (2000). <i>Seguran\u00e7a de Dados: Criptografia em Rede de Computadores<\/i>. Edgard Bl\u00fccher. Book."},{"key":"41","unstructured":"Veloso, P., dos Santos, C., Azeredo, P., and Furtado, A. (1983). <i>Estruturas de Dados<\/i>. Editora Campus. Book."},{"key":"42","unstructured":"Vieira, N. J. (2006). <i>Introdu\u00e7\u00e3o aos Fundamentos da Computa\u00e7\u00e3o: Linguagens e M\u00e1quinas<\/i>. Pioneira Thomson Learning. Book."},{"key":"43","unstructured":"Villanueva, M. I. and Szwarcfiter, J. L. (1992). Triangulated graphs: a survey. <i>Investigaci\u00f3n Operativa<\/i>, 2:245-271. Book."},{"key":"44","unstructured":"Wakabayashi, Y. and Ferreira, C. E. (1996). <i>Combinat\u00f3ria Poli\u00e9drica e Planos-De-Corte Faciais<\/i>. Escola de Computa\u00e7\u00e3o, Editora da Unicamp. Book."}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"link":[{"URL":"https:\/\/journals-sol.sbc.org.br\/index.php\/jbcs\/article\/download\/8350\/4068","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals-sol.sbc.org.br\/index.php\/jbcs\/article\/download\/8350\/4068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T13:10:07Z","timestamp":1782306607000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals-sol.sbc.org.br\/index.php\/jbcs\/article\/view\/8350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,16]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,20]]}},"URL":"https:\/\/doi.org\/10.5753\/jbcs.2026.8350","relation":{},"ISSN":["1678-4804"],"issn-type":[{"value":"1678-4804","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,16]]}}}