Find Academic Supervisors

Catherine GreenhillView profile

Professor

• Combinatorics
• Graph Theory
• Applied Probability
• +6 more

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

Anush TserunyanView profile

Professor

• Mathematics
• Ergodic Theory
• Combinatorics
• +3 more

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.

Imre LeaderView profile

Professor

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +3 more

Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10

Chandra ChekuriView profile

Professor

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete and Combinatorial Optimization
• +6 more

Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.

Asaf FerberView profile

Assistant Professor

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +1 more

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Daniel GottesmanView profile

Professor

• Quantum Computing
• Algorithms and Theory
• Quantum Error Correction
• +3 more

Daniel Gottesman is the Brin Family Endowed Professor in Theoretical Computer Science at the University of Maryland, affiliated with the Department of Computer Science, Institute for Advanced Computer Studies (UMIACS), and the Joint Center for Quantum Information and Computer Science (QuICS). He holds a Ph.D. in Physics from Caltech (1997) and has held positions at institutions like the Perimeter Institute and Quantum Benchmark. His research focuses on quantum computing, quantum error correction, and fault-tolerant systems, with contributions to stabilizer codes and quantum teleportation-based gates. Education: Bachelor's in Physics, Harvard University (1992) Ph.D. in Physics, California Institute of Technology (1997) Research Interests: Quantum error correction and fault-tolerant architectures Quantum cryptography and secure communication protocols Quantum complexity theory and algorithm design Applications of stabilizer codes and topological quantum computing Scientific Awards: Fellow of the American Physical Society CIFAR Senior Fellow in Quantum Information Science Three U.S. Patents (e.g., quantum key distribution systems) Advising & Grants: Supervised over 30 students/postdocs and served on numerous thesis committees. Active in securing funding for quantum research through endowed professorships and industry partnerships (e.g., Quantum Benchmark). Labs/Teams: Member of QuICS and UMIACS, collaborating on quantum hardware-software integration and error correction challenges.

Jason LiView profile

Assistant Professor

• Fast Graph Algorithms
• Algorithm Design
• Minimum Cut Problems
• +6 more

Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.

• Biomedical signal and image analysis
• Deep learning
• Computational statistics
• +5 more

Chee-Ming Ting is an Associate Professor in the School of Information Technology at Monash University Malaysia. His expertise lies in machine learning, data science, and biomedical engineering, with a focus on signal processing, computational neuroimaging, and computer-aided detection. Previously, he held positions at King Abdullah University of Science and Technology (Research Scientist) and Universiti Teknologi Malaysia (Senior Lecturer). He has authored over 26 journal papers and 43 conference papers, and has secured research grants totaling RM2.5 million as PI/Co-PI. Education: PhD in Mathematics - Statistics, Master of Engineering in Electrical Engineering, and Bachelor of Engineering (Hons.) in Electrical & Electronics Engineering. Research interests include biomedical signal/image analysis, deep learning, spatio-temporal modeling, and neuroimaging applications for disease prediction and patient monitoring. He has supervised 9 graduate students (4 PhD, 5 Masters) and currently oversees 10 PhD candidates. Awards include the IEEE Signal Processing Society Malaysia's Research Excellence Award (2019, 2022) and several national/international innovation awards. His work contributes to UN Sustainable Development Goals related to health and technological advancement. Key projects include frameworks for neurological disease prediction using brain networks and generative adversarial networks for medical imaging enhancement.

Daniel HorsleyView profile

Associate Professor

• Combinatorial Designs
• Edge Decomposition of Graphs
• Graph Theory
• +3 more

Daniel Horsley is an Associate Professor and ARC Future Fellow at the School of Mathematical Sciences, Monash University. His research focuses on combinatorial designs and edge decomposition of graphs, with notable contributions to extremal graph theory, Zarankiewicz problems, and graph decomposition theorems. Current Role: ARC Future Fellow, Associate Professor Affiliation: School of Mathematical Sciences, Monash University Active Projects: 'The Zarankiewicz problem through linear hypergraphs and designs' (2022–2025), 'Edge decomposition of dense graphs' (2017–2022), and more Research interests span combinatorial designs, graph decomposition, and extremal combinatorics. His work emphasizes theoretical advancements in design theory, with applications in discrete mathematics and optimization. Recent articles address semi-inducibility, Zarankiewicz numbers, and embedding partial designs, reflecting his expertise in structural and extremal combinatorics. Key awards include the ARC Future Fellowship. His research outputs include over 57 publications in journals like Journal of Graph Theory , SIAM Journal on Discrete Mathematics , and European Journal of Combinatorics . Grant projects include collaborations with ARC, University of Queensland, and University of Melbourne, focusing on Steiner systems, compressed sensing, and combinatorial structure analysis. Advising PhD students and mentoring researchers in discrete mathematics and combinatorial design theory.

David HongView profile

Assistant Professor

• Big Data Analysis
• Low-Rank Matrix and Tensor Methods
• Unsupervised Learning
• +5 more

David Hong is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Delaware. He holds a PhD from the University of Michigan, where he was an NSF Graduate Research Fellow, and previously served as an NSF Postdoctoral Research Fellow at the University of Pennsylvania. His research focuses on developing robust methods for analyzing heterogeneous and high-dimensional data, particularly through low-rank matrix and tensor techniques. Applications span medical imaging, radar systems, genomics, and astronomy. He emphasizes theoretical guarantees and practical algorithms for signal extraction and inverse problems. Education: PhD in Electrical Engineering and Computer Science (University of Michigan), NSF Postdoctoral Research Fellowship (University of Pennsylvania). Research Interests: Low-rank matrix/tensor methods, heterogeneous data analysis, unsupervised learning, and applications in healthcare, imaging, and sensor systems. His work addresses noise robustness, scalable algorithms, and real-world deployment challenges. Scientific Awards: Recipient of the NSF Postdoctoral Research Fellowship (2020) and NSF Graduate Research Fellowship (2015). Advising & Grants: Advisor to graduate students in machine learning and signal processing (no named advisees listed). Active NSF grant recipient for foundational and applied research in data science. Labs/Teams: Engaged in interdisciplinary collaborations through the University of Delaware's Center for Computational Research and Data Science initiatives.

Marco Morales AguirreView profile

Academic

• Motion Planning
• Multi-Robot Systems
• Artificial Intelligence
• +5 more

Marco Morales Aguirre is a Teaching Associate Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign and an Associate Professor at Instituto Tecnológico Autónomo de México (ITAM). He directs research at the Parasol Laboratory and has held significant leadership roles including founding member and former president of the Mexican Federation of Robotics (FMR). His academic journey spans both US and Mexican institutions, reflecting his international impact in the robotics community. Dr. Morales received his educational foundation from prestigious institutions: a Ph.D. in Computer Science from Texas A&M University, an M.S. in Electrical Engineering, and a B.S. in Computer Engineering from Universidad Nacional Autónoma de México (UNAM). His academic path has included positions as Visiting Professor at Texas A&M University and Lecturer at UNAM and the System of Technological Universities in México. His research focuses on motion planning algorithms for robotics, with particular expertise in multi-robot systems where he's pioneered frameworks like Adaptive Robot Coordination (ARC). His work bridges theoretical algorithm development with practical applications in industrial settings, computational biology, and extended reality interfaces. He has made significant contributions to topological guidance methods that improve planning efficiency in complex environments with narrow passages. Analysis of his recent publications reveals a strong trajectory toward more complex multi-robot coordination problems, with increasing emphasis on integrating task and motion planning. His research group has developed innovative approaches that scale to larger robot teams while maintaining computational efficiency, particularly in congested environments where traditional methods struggle. Member of the National System of Researchers of Mexico (level II) Founding member and former president of the Mexican Federation of Robotics (FMR) Member of the Mexican Academy of Computing Editor of multiple Algorithmic Foundations of Robotics (WAFR) proceedings Dr. Morales actively mentors a diverse group of graduate students who frequently appear as co-authors on his publications. His Parasol Laboratory conducts research funded through various academic and industrial collaborations, including significant projects with manufacturing partners exploring collaborative assembly systems. The laboratory has developed several notable frameworks including ARC, K-ARC, and HAS-RRT that have advanced the state of the art in multi-robot motion planning.

Petros EliaView profile

Professor

• Information Theory
• Coding Theory
• Caching
• +3 more

Professor Petros Elia is a faculty member at EURECOM, holding the position of Professor within the Department of Communications systems. He specializes in Information Theory , Coding Theory , Caching , Distributed Computing , and Wireless Networks , with additional research in Biometrics . His work focuses on advancing theoretical foundations and practical applications in distributed systems and wireless communication efficiency. He received a prestigious ERC Consolidator Grant for his DUALITY project (2016) and a four-year Fulbright Scholarship (1993-1997). He is also a recipient of the Newcom++ Network of Excellence Distinguished Achievement Award (2008-2011) and the Best Student Paper Award at SPAWC 2011, awarded to his advisee Arun Singh. His research explores cutting-edge topics such as tessellated distributed computing , hypergraph decomposition , and topology-aware caching , with recent contributions presented at venues like the IEEE International Symposium on Information Theory (ISIT 2025). His work bridges theoretical advancements with real-world applications in wireless networks and distributed systems. Education: Supported by his Fulbright Scholarship, he pursued studies in the U.S. during 1993-1997. Grants: ERC Consolidator Grant (2016), and others. Advising: Mentor to Arun Singh , whose work earned a student paper award. He actively contributes to teaching Mobile Communications at EURECOM and remains a key figure in advancing the field through interdisciplinary collaborations and leadership in the Communication Systems department.

Tibor SzabóView profile

Professor

• Combinatorics
• Extremal Graph Theory
• Random Structures and Algorithms
• +5 more

Tibor Szabó is a Professor in the Combinatorics and Graph Theory group at the Department of Mathematics, Freie Universität Berlin. He holds a PhD from The Ohio State University, advised by Ákos Seress. Prior to his current position, he held roles at McGill University, ETH Zürich, the Institute for Advanced Study (Princeton), and the University of Illinois (UIUC) as a J.L. Doob Research Assistant Professor. Research Interests: His work focuses on combinatorics and combinatorial optimization, including extremal problems, random structures and algorithms, pseudorandom graphs, positional games, and the combinatorics of linear programming. He explores tools from algebra, probability theory, and topology applied to combinatorics. Teaching: He teaches courses such as Algorithmic Combinatorics, Extremal Combinatorics, and runs the Combinatorics Seminar. His lecture notes include works on positional games and explicit constructions in extremal combinatorics. Students & Postdocs: Notable PhD advisees include Yamaan Attwa, Silas Rathke, Simona Boyadzhiyska, and Patrick Morris. Postdoctoral fellows include Olaf Parczyk and Anurag Bishnoi. His research has involved collaborations with over 50 co-authors. Funding & Grants: Supported by grants from the Swiss National Science Foundation (SNF) and German Research Foundation (DFG), focusing on topics like positional games and extremal graph theory.