Phablo F. S. Moura
Scholar

Phablo F. S. Moura

Google Scholar ID: sZtJvwMAAAAJ
KU Leuven
AlgorithmsCombinatorial OptimizationGraph TheoryOperations ResearchPolyhedral Combinatorics
Citations & Impact
All-time
Citations
174
 
H-index
7
 
i10-index
4
 
Publications
20
 
Co-authors
22
list available
Contact
No contact links provided.
Resume (English only)
Academic Achievements
  • Projects: Problems on partitioning and connectivity in the age of data: algorithms and computational challenges (CNPq, co-PI, since 2024); Optimization problems in signed graphs with applications in social networks (CNPq, co-PI, since 2024); Covering, packing and partitioning on graphs: theory and applications (FAPEMIG, PI, 2021-2022); Algorithmic and structural aspects of Covering and Packing problems on graphs (FAPESP, postdoctoral fellowship, 2017-2019).
Research Experience
  • 2022-present, Researcher at the Faculty of Economics and Business, KU Leuven; 2019-2022, Assistant Professor at the Computer Science Department, Federal University of Minas Gerais (Brazil); 2018-2019, Postdoctoral Researcher at Charles University; 2017-2018, Postdoctoral Researcher at the University of Campinas (Brazil).
Education
  • Ph.D. in Computer Science, 2017, University of São Paulo, supervised by Yoshiko Wakabayashi
Background
  • Research Interests: Combinatorial Optimization, Polyhedral Combinatorics, Algorithms, Graph Theory. Brief Bio: Since 2022, a researcher at the Faculty of Economics and Business, KU Leuven.