Graphs and Algorithms celebrating a fifty-year landmark
Open Access
- 20 January 2026
- journal article
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 32 (1) , 1590-1597
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Perfect Matchings2024
- Interval Count of Interval GraphsCadernos do IME - Série Informática, 2022
- Locating Eigenvalues in Graphs2022
- Computational Complexity2014
- The interval count of interval graphs and orders: a short surveyJournal of the Brazilian Computer Society, 2011
- Characterizations and recognition of circular-arc graphs and subclasses: A surveyDiscrete Mathematics, 2009
- A Survey on Clique Graphs2003
- An introduction to distributed algorithmsComputers & Mathematics with Applications, 1997
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- A structured program to generate all topological sorting arrangementsInformation Processing Letters, 1974