Algorithm Design Professors and Supervisors in Brazil

Waldemar Celes Filhoمشاهده پروفایل

دانشیار

Pontifical Catholic University of Rio de JaneiroBrazil

Waldemar Celes Filho is an Associate Professor in the Department of Computer Science at Pontifical Catholic University of Rio de Janeiro (PUC-Rio) and serves as Director of the Tecgraf Institute/PUC-Rio. With a career spanning over three decades, he has established himself as a leading researcher in computer graphics and scientific visualization. His educational background includes a Civil Engineering degree from UFRJ (1986), a Master's in Civil Engineering from PUC-Rio (1990), a Doctorate in Computer Science from PUC-Rio (1995), and postdoctoral studies in Computer Graphics at Cornell University (1995-1997). Dr. Celes Filho's research focuses primarily on Computer Graphics with special emphasis on Scientific Visualization, Numerical Simulation, Distributed Visualization, and Real-Time Rendering. He is particularly known for his work on visualization techniques for black oil reservoir models and as a co-creator of the Lua programming language. His research has resulted in over 50 publications spanning nearly three decades, with consistent output continuing through 2025. His recent publications demonstrate a strong trend toward applying advanced visualization techniques to complex industrial problems, particularly in petroleum engineering and construction informatics. His work bridges theoretical computer graphics with practical applications in engineering domains, showing particular strength in volume rendering, CAD model visualization, and distributed rendering systems. As Director of the Tecgraf Institute, he leads research initiatives that connect academic work with industry applications, fostering collaborations that translate visualization research into practical tools. Dr. Celes Filho has mentored numerous students who have become co-authors on his publications, including Paulo Ivson, Fábio Markus Miranda, and Lucas Caracas de Figueiredo, among others. His work continues to be influential in both academic and industrial settings.

پروفایل رسمی دانشگاه

Haniel Barbosaمشاهده پروفایل

استادیار

Federal University of Minas GeraisBrazil

Haniel Barbosa is a tenured Assistant Professor in the Department of Computer Science at Universidade Federal de Minas Gerais (UFMG), Brazil. His research focuses on improving SMT solvers for formal verification and enhancing their trustworthiness through proof certificates, as detailed in his work on projects like Lean-SMT and Carcara. He also serves as a senior technical lead for the state-of-the-art SMT solver cvc5 and actively collaborates with institutions like the University of Iowa, Stanford University, and Inria Nancy. Barbosa's research is supported by grants from the Defense Advanced Research Projects Agency (DARPA), CAPES, and Amazon Web Services. He mentors a diverse team of postdoctoral scholars, PhD students, and MSc students, including Caio Raposo, Tomaz Mascarenhas, Pedro Saccomani, and Bruno Andreotti. His teaching portfolio includes courses like Introduction to Computational Logic, Theory and Practice of SMT Solving, and Formal Methods. His publications span topics such as SMT proof production, proof reconstruction, and syntax-guided synthesis, with a focus on scalable algorithms, higher-order logic extensions, and industrial-strength solver development. Key trends in his work include formal verification, automated reasoning, and the intersection of logic with software engineering. Scientific awards include the Distinguished Tutorial Paper Award at FM 2024 and the Best Tool Paper Award at TACAS 2022 . Barbosa also contributes extensively to academic service as a steering committee member for SBMF, PC chair for LSFA and SBMF conferences, and organizer for SMT-COMP. His outreach includes invited tutorials at ATVA 2024, Dagstuhl Seminars, and workshops on SMT solving.

پروفایل رسمی دانشگاه

Eduardo Sany Laberمشاهده پروفایل

دانشیار

Pontifical Catholic University of Rio de JaneiroBrazil

Eduardo Sany Laber is an Associate Professor in the Computer Science Department at Pontifical Catholic University of Rio de Janeiro (PUC-Rio), with over two decades of academic and industrial experience. He completed his undergraduate (1996), master's (1997), and doctorate (1999) at PUC-Rio, focusing on data compression. Since 2001, he has been a faculty member, with visiting roles at Carnegie Mellon University (2001-2002). Education : PhD in Computer Science (1999), PUC-Rio Master in Computer Science (1997), PUC-Rio BSc in Computer Engineering (1996), PUC-Rio His research centers on designing algorithms with theoretical guarantees for problems in data compression , machine learning , and finance , combining optimization, information theory, and industrial applications. His recent work explores connections between k-means and decision trees , alongside information-theoretic clustering . The 15 most recent publications highlight his focus on algorithm efficiency, spanning machine learning , information retrieval , and combinatorial optimization . Notable venues include ICML , ECAI , and ISAAC , with applications in finance , data analysis , and web engineering . Scientific Awards : Gold Medal, Brazilian Math Olympiad (1990) Bronze Medal, International Math Olympiad (1991) First Prize, Brazilian Computer Society PhD Thesis Contest (2000, 2004 co-advisor) Affiliated Member, Brazilian Academy of Sciences (2008) Best Paper Award, ISAAC (2015) Laber supervises PhD and Master's students intensively, including recipients of national awards like the Brazilian Computer Society's First Prize for Marco Molinaro's Master's Dissertation (2009) and Second Prize for Renato Carmo's PhD Thesis (2006) . He is a CNPq Level 1 Researcher and collaborates with the Greyhounds Laboratory .

پروفایل رسمی دانشگاه

Mario R. Folhadela Benevidesمشاهده پروفایل

استاد

Federal University of Rio de Janeiro (UFRJ)Brazil

Mario R. Folhadela Benevides is a Full Professor at the Universidade Federal do Rio de Janeiro (UFRJ). He is affiliated with the Systems and Computing Engineering Program (PESC/COPPE) within the Department of Computer Science (DCC) and the Institute of Mathematics (IM). He holds a Ph.D. from Imperial College (1991). His research focuses on areas such as Artificial Intelligence, Distributed Algorithms, Logic, Game Theory, and Concurrency. He teaches graduate and undergraduate courses including Artificial Intelligence, Distributed Algorithms, and Game Theory. Education: Ph.D. in Computer Science from Imperial College London (1991). Research interests emphasize theoretical foundations of computing, particularly in logic-based systems, algorithm design, and applications of game theory in computer science. His teaching portfolio includes advanced topics like Prolog programming, heuristic search methods, and neural networks. No scientific awards or recent articles were explicitly mentioned in the provided texts. His professional activities center on academic instruction and research supervision within UFRJ's engineering and mathematics divisions.

پروفایل رسمی دانشگاه

Marco Molinaroمشاهده پروفایل

استاد

Pontifical Catholic University of Rio de JaneiroBrazil

Marco Molinaro is a Professor in the Computer Science Department at PUC-Rio . He previously held Assistant Professor positions at TU Delft (EWI), Georgia Tech (ISyE, ACO), and was a PhD student in the ACO program at Carnegie Mellon University . Education: PhD in Algorithms, Combinatorics, and Optimization (ACO), Carnegie Mellon University Research Interests: Marco's work lies at the intersection of online algorithms , convex optimization , machine learning , and operations research . His recent publications analyze: Online scheduling and VM allocation in data centers Complexity of branch-and-bound trees Information-theoretic bounds for optimization problems Explainable decision trees and their theoretical limits Stochastic and adversarial bandit algorithms Curvature properties in optimization sets His research often bridges abstract mathematical frameworks (e.g., Lipschitz functions, supermodular norms) with practical applications in cloud computing, machine learning, and game theory. Publication Trends: Marco's recent work focuses on online convex optimization and its extensions to data center resource allocation (Kamino: latency-driven VM scheduling), dynamic bin packing , and information complexity in mixed-integer models. He frequently collaborates with researchers at institutions like Carnegie Mellon University and TU Delft, with recurring co-authors Santanu Dey, Amitabh Basu, and Thomas Kesselheim. Teaching: Marco teaches advanced courses in algorithm design and analysis at PUC-Rio, including: Analise de Algoritmos (2020–2025) Projeto e Analise de Algoritmos (postgraduate, 2020–2025) Algoritmos e Incerteza (postgraduate, 2020) Estruturas Discretas (2021) His curriculum emphasizes online learning , random-order models , and PAC learning , with connections to game theory and practical implementations.

پروفایل رسمی دانشگاه

Paula Ypiranga dos Guaranysمشاهده پروفایل

استاد

Pontifical Catholic University of Rio de JaneiroBrazil

Paula Ypiranga dos Guaranys is a Tenured Professor affiliated with the Computer Science Department at the Pontifical Catholic University of Rio de Janeiro (PUC-Rio). Her work spans core areas of computer science, including software engineering, algorithms, and programming languages. Research Interests : Computer Science fundamentals Software Engineering methodologies Algorithm design and optimization Programming Languages theory Contact : pguaranys@inf.puc-rio.br

پروفایل رسمی دانشگاه

Ricardo Nolla Ruizمشاهده پروفایل

استاد

Pontifical Catholic University of Rio de JaneiroBrazil

Ricardo Nolla Ruiz is a Tenured Professor at the Computer Science Department of Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Brazil. His research focuses broadly on computer science, with emphasis on software engineering, algorithms, and programming languages. He can be reached at nolla@inf.puc-rio.br. Research Interests: span computer science domains including software engineering principles, algorithmic problem-solving, and programming language design.

پروفایل رسمی دانشگاه

Marco Serpa Molinaroمشاهده پروفایل

استاد مدعو

Pontifical Catholic University of Rio de JaneiroBrazil

Marco Serpa Molinaro is an Adjunct Professor at PUC-Rio, affiliated with the Computer Science Department. His expertise lies in Optimization, Automatic Reasoning, and Theory of Computation, with a focus on algorithms under uncertainty and Integer Programming. Marco's educational background includes: Bachelor's Degree in Computer Engineering from PUC-Rio (2005) Master's Degree in Computer Science from PUC-Rio (2008) PhD in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University (2013) His research interests bridge theoretical and applied aspects of computational complexity, including: Optimization algorithms Automated reasoning systems Computational theory foundations Uncertainty modeling in algorithm design Integer programming techniques Marco has been honored with: CNPq Level 2 Productivity Grant FAPERJ Young Scientist of Our State Grant

پروفایل رسمی دانشگاه

Celina Miraglia Herrera de Figueiredoمشاهده پروفایل

استاد

Federal University of Rio de Janeiro (UFRJ)Brazil

Celina Miraglia Herrera de Figueiredo is a full Professor at the Systems Engineering and Computer Science Program (PESC) of COPPE, the Alberto Luiz Coimbra Institute for Graduate Studies and Research in Engineering at the Federal University of Rio de Janeiro (UFRJ). She holds a PhD in systems and computer engineering from UFRJ and a postdoctoral degree from the University of Waterloo, Canada. She is a CNPq Level 1A Research Fellow and a FAPERJ Cientista do Nosso Estado awardee, and leads the algorithms and combinatorics research group at COPPE/UFRJ. University: Federal University of Rio de Janeiro School: Alberto Luiz Coimbra Institute for Graduate Studies and Research in Engineering Department: Systems Engineering and Computer Science Program Academic Rank: Professor Email: celina@cos.ufrj.br Her research centers on theoretical computer science, with a focus on graph theory, algorithms, computational complexity, and combinatorial optimization. She has made significant contributions to the understanding of graph classes such as perfect graphs and snarks, algorithm design, and computational complexity. Her work is grounded in the Mathematics Subject Classification codes 05-XX (Combinatorics), 68-XX (Computer Science), and 90-XX (Operations Research). The most recent publications indicate a strong trend in analyzing the computational complexity of graph problems (e.g., MaxCut, Steiner Tree, total coloring) on structured graph classes such as interval, permutation, and path graphs. Her work frequently involves proving NP-completeness results, developing parameterized algorithms, and studying graph invariants like pebbling numbers and chromatic numbers. She consistently publishes in high-quality journals such as Discrete Mathematics , Discrete Applied Mathematics , and RAIRO Operations Research . Giulio Massarani Award for Academic Merit (2006) COPPE Fifty Years Award (2013) CNPq Research Fellowship (Level 1A) FAPERJ Cientista do Nosso Estado Member of the Brazilian Academy of Sciences (2023) Celina has advised numerous students, including Raphael Machado, Vinícius de Sá, Alexsander Melo, and Ana Silva, and has secured significant research funding from CNPq and FAPERJ. She is deeply involved in the academic community, serving on the editorial boards of RAIRO Theoretical Informatics and Applications, Bulletin of the Brazilian Mathematical Society, and Matemática Contemporânea. She has also been a key organizer and committee member for major international conferences such as LAGOS, WG, LATIN, and FCT, reflecting her leadership in the fields of algorithms and combinatorics. She coordinates the Center of Excellence in Randomized, Quantum, and Approximative Algorithms and has been a driving force in promoting women in science, serving on the jury of the L'Oréal–UNESCO–ABC Program for Women in Science. Her Erdős number is 2, highlighting her extensive collaborative network in mathematics and computer science.

پروفایل رسمی دانشگاه