Find Academic Supervisors

Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +3 more

Aniello Murano is a Professor in Computer Science at the Department of Electrical Engineering and Information Technology of the University of Naples Federico II. He serves as Scientific Director of the ASTREA (Automated Strategic REAsoning) Laboratory and has been actively involved in numerous research projects including H2020-MSCA project SEAL as Principal Coordinator and PNRR Research Unit Coordinator on Resilient Strategic Reasoning in AI (2023-2025). His primary research interests focus on Artificial Intelligence, Formal Aspects for Strategic Reasoning in Multi-Agent Systems under Perfect and Imperfect Information, Specification, Verification, and Synthesis of Reactive Systems, Model Checking and Module Checking, Formal Languages, Automata Theory, Real-time Systems, Pushdown and Hierarchical Systems, Temporal and Modal Logics, Logics for Strategic Reasoning in AI, Game Theory, Parity Games, Solution Concepts, and Automated Mechanism Design. His work bridges theoretical computer science with practical applications in AI systems. Murano has published extensively in top-tier venues, with recent publications spanning KR, IJCAI, AAAI, AAMAS, and other premier conferences. His research shows strong trends in strategic reasoning frameworks, verification techniques for multi-agent systems, and applications of game theory to mechanism design. He has made significant contributions to Strategy Logic and its extensions. JPMorgan Faculty Research Award 2022 Best Paper Award PRIMA 2015 Vigevani Research Project Prize 2010 In KR Top 100, best AI-2000 world researchers Italian Scientific Abilitation as Full Professor in Engineering Computer Science (March 2018) Italian Scientific Abilitation as Full Professor in Computer Science (April 2017) Royal Society Award 2016 Murano has supervised numerous PhD students including Silvia Stranieri, Antonio Di Stasio, Vadim Malvone, and Giuseppe Perelli. He has served as Program Chair for major conferences including ECAI 2025 (Program co-chair), KR 2024 (Area chair), and CSL 2024. His research has been supported by significant grants including Horizon 2020 projects, JPMorgan funding, and Italian national research programs. He leads the ASTREA Laboratory focused on automated strategic reasoning and has been instrumental in establishing collaborative research initiatives with institutions worldwide.

• Artificial Intelligence
• Strategic Reasoning in Multi-Agent Systems
• Formal Verification
• +10 more

Irene Parada is an Assistant Professor and Serra Húnter Fellow at Universitat Politècnica de Catalunya (UPC BarcelonaTech), Spain. She is part of the Research Group on Discrete, Combinatorial and Computational Geometry. Previously, she held postdoctoral positions at Utrecht University, Technical University of Denmark, and TU Eindhoven. Her research focuses on Combinatorial and Computational Geometry, Graph Drawing, and Algorithms for Robotics. She has been recognized with the Margarita Salas postdoctoral fellowship and received Excellent Course Evaluations for her teaching roles. Education: PhD in Computer Science (2019) from Graz University of Technology, Austria (supervised by Oswin Aichholzer) Master's in Advanced Mathematics and Mathematical Engineering (2015) from UPC BarcelonaTech Bachelor's in Mathematical Engineering (2014) from Universidad Complutense de Madrid Research Interests: Irene's work spans geometric algorithms, graph visualization, and modular robotics. She explores computational challenges in geometric configurations, such as perfect matchings, graph embeddings, and reconfiguration problems. Her contributions include novel algorithms for dynamic planar graphs and efficient robot motion strategies. Key Achievements: Recipient of the Margarita Salas postdoctoral fellowship Best paper awards for 'On compatible matchings' and 'Saturated k-plane drawings with few edges' Excellent teaching evaluations for courses like Motion and Manipulation (Utrecht) and Data Structures (TU Eindhoven) Teaching & Mentorship: Irene has coordinated courses in Numerical Computing and Numerical Methods at UPC. She has also lectured on Motion and Manipulation, Algorithms, and Topological Data Analysis. Her roles included teaching assistantships in Discrete Mathematics and Linear Algebra at UPC. Labs & Collaborations: She collaborates with the Geometric Computing Group (Utrecht) and the Algorithms cluster (TU Eindhoven). Her work often involves interdisciplinary teams, addressing challenges in robotics, graph theory, and computational geometry.

• Combinatorial and Computational Geometry
• Graph Drawing
• Algorithms for Robotics

Dr. Martin Charles Golumbic is a Professor of Computer Science and former Director of the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He previously held positions at IBM Research, Columbia University, Bar-Ilan University, and others. His research focuses on algorithmic graph theory, combinatorial mathematics, and artificial intelligence. PhD in Mathematics (Columbia University, 1975) M.A. and B.S. in Mathematics (Pennsylvania State University, 1970) Research interests include perfect graphs, temporal reasoning, constraint scheduling, and discrete applied mathematics. He has authored influential books such as *Algorithmic Graph Theory and Perfect Graphs* and *Fighting Terror Online*. His work bridges theoretical computer science with real-world applications in AI and security. Awards include the EurAI Fellowship (2005), Lifetime Achievement Award from the Israeli AI Association (2019), and membership in Academia Europaea (2013). He has supervised 5 PhD students and 21 M.Sc. students, along with 18 postdocs. Key contributions include editorial roles at *Annals of Mathematics and Artificial Intelligence*, patents in instruction scheduling, and leadership in over 50 international conferences. His interdisciplinary work at the Caesarea Rothschild Institute integrates computer science with other fields.

• Algorithmic Graph Theory
• Perfect Graphs
• Temporal Reasoning
• +5 more

Vladimir Kolmogorov is a Professor at the Institute of Science and Technology Austria (IST Austria), leading the Kolmogorov Group focused on Discrete Optimization. He previously held positions as Assistant Professor at IST Austria (2011–2014), Lecturer at University College London (2005–2011), and Associate Researcher at Microsoft Research (2003–2005). His research spans algorithm development for graphical models, combinatorial optimization, and applications in computer vision. Education: M.S. in Applied Mathematics and Physics from the Moscow Institute of Physics and Technology, and Ph.D. in Computer Science from Cornell University (2003). Research interests include complexity classifications, algorithm design for discrete optimization problems (e.g., max-flow, min-cost matching), and applications in computer vision. Notable contributions include the 'Boykov-Kolmogorov' max-flow algorithm and 'Blossom V' for minimum cost perfect matching. Honors include the ERC Consolidator Grant (2014–2019), Koenderink Prize (2012), and best paper awards at CVPR and ECCV. His work on optimization algorithms and theoretical complexity has significantly impacted computer vision and combinatorial optimization fields. Advising and grants: Supervised multiple PhD students and postdocs, with current advisees including Martin Dvořák and Pavel Arkhipov. His team explores inference in graphical models, combinatorial optimization, and discrete optimization theory.

• Discrete Optimization
• Combinatorial Optimization
• Global Optimization
• +3 more

Neeldhara Misra is an Associate Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology Gandhinagar (IITGN). She holds the Smt. Amba and Sri. V S Sastry Chair position. Prior to this, she served as an Assistant Professor at IITGN (2015–2021), and held an INSPIRE Faculty Fellowship at the Indian Institute of Science (2013–2015). Her research focuses on algorithm design, computational social choice, extremal combinatorics, and combinatorial game theory. Education : BSc in Mathematics from Mount Carmel College, Bangalore (2007) PhD in Theoretical Computer Science from The Institute of Mathematical Sciences, Chennai (2012) Research Interests : Her work spans parameterized complexity, algorithm design for combinatorial problems, and applications in social choice theory. Recent contributions include studies on equitable fair division, eternal vertex cover numbers in graphs, and efficient algorithms for graph problems like perfect matching cuts. Professional Activities : She has actively contributed to organizing conferences such as FSTTCS, IPEC, and AAMAS. Her work has been recognized with awards like the NASI Platinum Jubilee Young Scientist Award (2023). Awards : NASI Platinum Jubilee Young Scientist Award (2023) Grants & Advising : Details on grants or advising are not explicitly listed in the provided texts, though her involvement in interdisciplinary research and academic service is notable.

• Design and analysis of algorithms
• Computational social choice
• Parameterized complexity
• +5 more

Philipp Sprüssel is a Senior Lecturer at Graz University of Technology's Institute of Discrete Mathematics. His research focuses on Random Graphs , Enumerative Combinatorics , and Phase Transitions , with particular emphasis on graphs on surfaces, hypergraphs, and simplicial complexes. He has organized conferences like the Random Structures and Algorithms and contributed to workshops on enumerative combinatorics and phase transitions. His academic career includes roles as a Postdoctoral Researcher at the University of Haifa and the University of Oxford, and a DAAD-funded position at the University of Hamburg. He holds a PhD from the University of Hamburg (2010). Teaching responsibilities span courses in Analytic Combinatorics , Discrete Mathematics , and Mathematics for Engineering , with recent activities in 2023. Research grants include an FWF-funded project on graphs on surfaces. Key contributions include studies on cohomology groups of random simplicial complexes, phase transitions in graph evolution, and symmetry characterization of unlabelled triangulations. His Erdős number is 2.

• Random Graphs
• Enumerative Combinatorics
• Phase Transitions
• +3 more

Endre Szemerédi is a Hungarian mathematician and computer scientist, currently serving as a Permanent Research Fellow at the Alfréd Rényi Institute of Mathematics (Hungarian Academy of Sciences) and holding the New Jersey Professor of Computer Science position at Rutgers University since 1986. His career spans prestigious institutions including Stanford, Caltech, and the Institute for Advanced Study. Expertise: Discrete mathematics, combinatorics, theoretical computer science, and number theory. Education: M.Sc. (1965, Eötvös Loránd University), Ph.D. (1970, Moscow State University under Israel Gelfand). Research legacy encompasses foundational contributions to combinatorics, graph theory, and computational complexity. His work on Hamiltonian cycles in random graphs , parallel sorting networks , and the Blow-up Lemma revolutionized extremal combinatorics and algorithm design. Scientific honors include: 2012 Abel Prize and Széchenyi Prize 2008 Rolf Schock Prize and Steele Prize 1982 Member of Hungarian Academy of Sciences , 2010 Member of US National Academy of Sciences 1975 Pólya Prize , 1973 Rényi Prize , multiple Grünwald Prizes .

• Discrete mathematics
• Combinatorics
• Theoretical computer science
• +1 more