Find Academic Supervisors

Prof. Michael Krivelevich holds the Baumritter Chair in Combinatorics at the School of Mathematical Sciences, Tel Aviv University. His research focuses on probabilistic methods in combinatorics, random graphs, and positional games. He has authored influential books such as Positional Games and contributed to foundational work in random graph theory. Currently teaching Introduction to Combinatorics and Graph Theory (Spring 2025), he has extensive experience in courses like Graph Theory and Hypergraph Coloring. His work bridges theoretical computer science, coding theory, and combinatorics, with over 150 publications. Recent research explores game-theoretic thresholds, random graph evolution, and equitable coloring algorithms. Education: Ph.D. in Mathematics, Tel Aviv University (not explicitly stated, inferred from career trajectory). Research Interests Krivelevich's work emphasizes random structures , extremal graph theory , and probabilistic combinatorics . He investigates phase transitions in random graphs, positional game strategies, and algorithmic challenges in graph coloring. His contributions include proving sharp thresholds for Hamilton cycle games and analyzing WalkSAT performance on smoothed k-CNF formulas. Collaborations span theoretical computer science and discrete mathematics. Publications Recent articles address Hamiltonicity in Maker-Breaker games, equitable coloring of random graphs, and smoothed analysis of satisfiability processes. His work often combines rigorous proofs with algorithmic insights. Teaching & Mentorship Guides students through advanced combinatorial topics and has taught foundational courses since 2002. No explicit student listings available in provided texts.

• Probabilistic Methods in Combinatorics
• Random Structures
• Hypergraphs
• +7 more

Yannic Maus is a University Professor at the Faculty of Computer Science and Biomedical Engineering at Graz University of Technology (TU Graz), Austria, where he heads the newly founded Institute of Algorithms and Theory (established in 2025). He also serves as co-leader of one of the five fields of expertise at TU Graz (FoE Information, Communication & Computation). His academic journey includes: PhD in Computer Science from University of Freiburg, Germany (2014-2018) MSc in Mathematics from RWTH Aachen, Germany BSc in Mathematics and Computer Science from RWTH Aachen, Germany (with a year at National University of Singapore) Professor Maus specializes in theoretical computer science and algorithm design, with a particular focus on distributed computing. His research spans distributed graph algorithms, efficient algorithms, data structures, complexity theory, and geometric algorithms. He approaches problems with both theoretical rigor and practical applications in mind, seeking clean mathematical solutions to questions motivated by real-world systems. His recent publications show a strong focus on distributed and parallel algorithms, particularly in graph theory. The research trends include distributed graph coloring, symmetry breaking, vertex cover problems, and massively parallel computing models. His work often bridges theoretical computer science with practical distributed systems considerations, with applications to large-scale networks and highly parallel systems. Professor Maus has received numerous accolades for his research: 2020 Principles of Distributed Computing Doctoral Dissertation Award Wolfgang-Gentner-Nachwuchsförderpreis 2019 GI Dissertationspreis 2018 Best Paper Awards at SIROCCO 2016, DISC 2016, and DISC 2017 Professor Maus actively mentors PhD students and has secured significant research funding, including FWF grants P36280-N (2023-2027), DOC 183 (2024-2028), I6915 (2024-2028), and FFG grant No. 59263962. His research group maintains strong international collaborations with institutions across Germany, Finland, Iceland, Israel, and beyond, providing students with opportunities for international research visits. He leads the Algorithms & Complexity research group at TU Graz, which includes PhD students Manuel Jakob, Florian Schager, Malte Baumecker, and Kritika Kashyap, as well as postdoc Tijn de Vos. The group is actively involved in theoretical computer science research with a focus on distributed and parallel algorithms, particularly for large-scale networks and highly parallel systems.

• Theoretical Computer Science
• Algorithm Design
• Distributed Computing
• +6 more

Robert D. Gray is a Professor of Mathematics at the School of Mathematics, University of East Anglia. His research focuses on combinatorial and geometric group and semigroup theory, algorithmic problems in algebra, decidability, homological finiteness properties, and group actions on graphs and topological spaces. EPSRC Research Fellow Editorial Board: International Journal of Algebra and Computation Available for PhD supervision in semigroup and inverse monoid theory His recent work explores: Topological finiteness properties of monoids Undecidability in one-relator inverse monoids Algorithmic properties of inverse monoids Maximal subgroups in special inverse monoids Key article trends include: Geometric and algorithmic aspects of inverse monoids Homological properties of semigroups Connections between group theory and semigroup theory Applications to graph theory and automata Scientific Awards: EPSRC Fellowship EP/V032003/1 EPSRC grant EP/N033353/1 EPSRC Postdoctoral Fellowship EP/E043194/1 Contact: Room S1.29, School of Mathematics, University of East Anglia, Norwich NR4 7TJ. Email: Robert.D.Gray@uea.ac.uk . Phone: +44 1603 591443.

• Combinatorial group theory
• Geometric semigroup theory
• Algorithmic problems in algebra
• +6 more

Milos Stojakovic is a Full Professor in the Department of Mathematics and Informatics at the Faculty of Sciences, University of Novi Sad, Serbia. He has held this position since 2016, following appointments as Associate Professor (2011-2016) and Assistant Professor (2006-2011) at the same institution. Since 2018, he has led the Foundations of Computer Science research group. His academic foundation includes dual Bachelor's degrees in Mathematics and Computer Science (1999), a Master's degree in Computer Science (2001), and a Ph.D. in Computer Science from ETH Zurich (2005) under Emo Welzl and Tibor Szabó. Dr. Stojakovic's research focuses on: Positional games and their variants Discrete and computational geometry Discrete random structures Combinatorial algorithms Graph theory and applications His extensive publication record reveals a consistent focus on positional games, with recent work exploring Maker-Breaker games, Avoider-Enforcer games, and Constructor-Blocker games. His research bridges combinatorics, game theory, and computational geometry, with notable contributions to hypergraph coloring, graph searching algorithms, and geometric matchings. He co-authored the seminal book 'Positional Games' (2014) in the Oberwolfach Seminars series. Dr. Stojakovic has received significant recognition including the 'Dr Z. Đinđić Award' for best young scientist in Vojvodina (2008) and the 'Best Student of University of Novi Sad Award' (1998/99). He has successfully mentored three PhD students to completion: Mirjana Mikalački (2014, 'Positional games on graphs'), Marko Savić (2018, 'Efficient algorithms for discrete geometry problems'), and Jelena Stratijev (2023, 'Strong positional games'). His research has been supported by various grants, including the 1 million RSD grant accompanying the Dr Z. Đinđić Award. As head of the Foundations of Computer Science group, Dr. Stojakovic leads research in theoretical computer science and discrete mathematics. He has organized international workshops including multiple editions of the Novi Sad Workshop on Foundations of Computer Science (NSFOCS) and specialized workshops at the Oberwolfach Research Institute for Mathematics.

• Positional games
• Discrete geometry
• Computational geometry
• +3 more

Saket Saurabh is a Professor at the Institute of Mathematical Sciences (IMSc), Chennai, India, and an Adjunct Faculty at the University of Bergen, Norway. He holds a PhD in Theoretical Computer Science (TCS) from IMSc (2008). His research focuses on Parameterized Complexity, Exact Exponential Algorithms, Graph Theory, Algorithmic Game Theory, and Theoretical Foundations of Machine Learning. Before joining IMSc, he held postdoctoral positions at the University of Bergen (2007–2009) and was a Research Assistant there (2006–2007). He teaches advanced courses such as Parameterized Complexity, Kernelization, and Algorithms for Big Data. His work emphasizes developing efficient algorithms for NP-hard problems through techniques like kernelization and fixed-parameter tractability. His publications primarily address graph algorithms, parameterized complexity, and algorithm design, with contributions to meta-kernelization frameworks, representative families, and lower bounds for clique-width parameterizations. Notable collaborations include seminal work on graph isomorphism for bounded treewidth graphs and the fixed-parameter tractability of minimum bisection.

• Parameterized Complexity
• Exact Exponential Algorithms
• Graph Theory
• +5 more

Florian Galliot is an Associate Professor in Mathematics at Aix-Marseille University, conducting research with the GDAC team at the Institut de Mathématiques de Marseille (I2M) and teaching in the Computer Science department of IUT d'Aix-Marseille. Previously, he was a temporary teaching and research assistant at Université de Bordeaux and completed his PhD in discrete mathematics at Institut Fourier under Sylvain Gravier and Isabelle Sivignon, defended on July 3, 2023. His primary research interests include: Positional Games and Combinatorial Games Structural Graph Theory Hypergraphs and their properties Reconstruction and Reconfiguration Problems in graphs Galliot's research focuses on positional games, a family of combinatorial games played on hypergraphs (including games like tic-tac-toe, Hex, and Sim). His work bridges theoretical mathematics with practical applications, examining computational complexity, game strategies, and structural properties of graphs and hypergraphs. He has made significant contributions to understanding the Maker-Breaker game, Avoider-Enforcer games, and poset positional games, with several publications in top journals and conferences. His recent publications (2023-2025) demonstrate a consistent research trajectory in positional games on hypergraphs, with a particular focus on computational complexity and structural properties. His work shows increasing sophistication in analyzing games on hypergraphs of various ranks, with several results establishing polynomial-time solutions or complexity classifications. Galliot is actively involved in mathematics popularization: Member of 'Maths à Modeler' federative structure Participant in Science Festival, Culture and Mathematical Games Fair, Remue-Méninges Festival Previously supervised the mathematics club 'Les maths autrement' in Grenoble (2019-2022) His teaching portfolio spans fundamental mathematical tools, graph theory, cryptography, automata and languages, and algorithm implementation across multiple institutions including Aix-Marseille University, Université de Bordeaux, and Grenoble Alpes University.

• Positional Games
• Structural Graph Theory
• Combinatorial Games
• +5 more

Mirjana Mikalacki is a Full Professor in the Department of Mathematics and Informatics at the Faculty of Sciences, University of Novi Sad. She has held academic positions since 2009, advancing from Teaching Assistant to her current rank. Her research focuses on positional games on graphs, discrete random structures, graph algorithms, and combinatorial optimization. She has organized multiple workshops, including the Novi Sad Workshop on Foundations of Computer Science (NSFOCS) series. Education: Ph.D. (2014) and B.Sc. (2007) in Computer Science from the University of Novi Sad. She has also attained advanced English language certifications (CPE, CAE, FCE) and holds proficiency in German and other Slavic languages. Her publications (15+ articles) span journals like Discrete Mathematics and Electronic Journal of Combinatorics , focusing on positional game strategies, graph algorithms, and combinatorial optimization. Recent work includes analysis of optimal paths in graphs and game dynamics in multi-stage and Walker-Breaker scenarios. No scientific awards explicitly mentioned. Her teaching includes courses in programming and informatics. She advises no listed students but collaborates on research projects involving graph theory and algorithmic game theory.

• Positional games on graphs
• Discrete random structures
• Algorithms on graphs
• +1 more

Josef Tkadlec is an Assistant Professor at the Computer Science Institute of Charles University in Prague. He holds a PhD from IST Austria (supervised by Krish Chatterjee) and an undergraduate degree from Charles University. Previously, he was a postdoctoral fellow at Harvard University's Mathematics Department under Martin A. Nowak. Affiliations: Charles University (current), Harvard University (postdoc), IST Austria (PhD) His research focuses on evolutionary graph theory, random processes on graphs, and geometric/game-theoretical aspects of theoretical computer science. He leads the PRIMUS grant project Evolutionary graph theory: Beyond fixation probability and has contributed to studies on amplifiers of natural selection and network dynamics. Tkadlec is also actively involved in mathematics competitions, proposing problems for international events like the IMO and organizing resources for Czech high-school students. His work bridges evolutionary biology and computer science, addressing questions like fixation probabilities in population structures and coexistence dynamics. Tkadlec's recent publications explore topics such as quasigeodesics in geometric structures, fixation times on directed graphs, and algorithmic approaches to geometric problems. Scientific Awards: Best Paper Award at WALCOM 2021 for research on IMO problem applications. He advises student projects and maintains active collaborations in evolutionary dynamics and discrete mathematics. Tkadlec also contributes to math outreach through competitions, puzzle creation, and educational resources.

• Evolutionary Graph Theory
• Random Processes on Graphs
• Theoretical Computer Science
• +3 more

Avi Wigderson is the Herbert H. Maass Professor at the School of Mathematics, Institute for Advanced Study, Princeton, where he leads research in theoretical computer science and discrete mathematics. He organizes the CSDM (Computer Science and Discrete Mathematics) program at IAS, fostering interdisciplinary research and collaboration. Research Interests: His primary research areas include randomness and pseudorandomness, computational complexity, circuit and proof complexity, quantum computation, cryptography, and distributed computing. His work bridges computer science and pure mathematics, particularly through algebra, analysis, and combinatorics. He has pioneered foundational results in derandomization, lower bounds, and the interplay between computation and mathematical structures. The recent publications highlight his continued leadership in advancing algebraic and analytic techniques in complexity theory. Themes include operator scaling, invariant theory, expander graphs, arithmetic circuits, and the asymptotic analysis of tensors and matrix spaces. These works often unify computational problems with deep mathematical frameworks, demonstrating the power of interdisciplinary approaches. Scientific Awards: Edsger W. Dijkstra Prize in Distributed Computing (2023) for the paper 'Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computing' Advising and Grants: Wigderson has advised numerous PhD students, primarily at the Hebrew University and Princeton, and hosted over 50 postdoctoral researchers at IAS, including many who have become leading figures in theoretical computer science. While specific grants are not listed, his sustained productivity and influence suggest long-term funding from major sources such as the NSF, Simons Foundation, or IAS internal support. Labs and Teams: He leads the CSDM (Computer Science and Discrete Mathematics) group at the Institute for Advanced Study, organizing seminars, workshops, and collaborative research initiatives that bring together mathematicians and computer scientists from around the world.

• Randomness and Computation
• Algorithms and Optimization
• Complexity Theory
• +12 more

Prasad Tetali is the Alexander M. Knaster Professor and Department Head in the Department of Mathematical Sciences at Carnegie Mellon University. He holds adjunct professorships at Emory University and the Georgia Institute of Technology. His research focuses on Discrete Mathematics, Probability, and Theoretical Computing, with notable contributions to Markov chains, Isoperimetry, Combinatorics, and Algorithms. Tetali has served in leadership roles, including Program Director of the SIAM Activity Group on Discrete Mathematics and Director of the ACO Ph.D. Program at Georgia Tech. He is an AMS Fellow (2012) and SIAM Fellow (2009). **Education**: Postdoc at AT&T Bell Labs; Ph.D. (1991) from NYU's Courant Institute; M.S. (1987) from the Indian Institute of Science. **Teaching**: Courses include Design & Analysis of Algorithms, Probability Methods in Combinatorics, and Information Theory. **Mentorship**: Advised 11 PhD students and hosted numerous postdocs, including notable figures now in academia and industry. **Awards & Recognition**: Inaugural SIAM Fellow (2009), Inaugural AMS Fellow (2012). **Service**: Editorial roles at journals like SIAM J. on Discrete Mathematics and Random Structures & Algorithms. Organized workshops on topics like Submodularity and Computational Phase Transitions. **Grants & Collaborations**: Principal investigator on NSF-funded projects and contributor to collaborations in combinatorics, probability, and theoretical computer science.

• Discrete Mathematics
• Probability Theory
• Theory of Computing
• +4 more

Mladen Nikolić is an Associate Professor at the Faculty of Mathematics, University of Belgrade, specializing in machine learning and automated reasoning. He actively contributes to the Machine Learning and Applications Group (MLA@MATF) and the Automated Reasoning GrOup (ARGO) . His research spans earthquake damage assessment , deep learning object tracking , LLM integration with tabular data , and astronomical data analysis . Recent work focuses on the RELAR Project for rapid earthquake loss assessment, CNN architectures for structural damage classification, and novel approaches to incorporating large language model priors into machine learning systems. His publications demonstrate strong interdisciplinary applications connecting computer science with seismology, transportation engineering, and astrophysics. Developed frameworks for earthquake loss assessment and recovery Advanced deep learning filters for non-linear motion tracking Integrated LLMs with tabular data processing systems Contributed to LSST astronomical data challenges Nikolić maintains active research collaborations through MLA@MATF and ARGO groups, with publications spanning machine learning theory, automated reasoning systems, and practical applications across multiple scientific domains. His work shows increasing focus on real-world deployment of AI systems for disaster response and scientific data analysis.

• Machine Learning
• Automated Reasoning
• Earthquake Damage Assessment
• +2 more

Olga Bodroža-Pantić is a Professor at the Department of Mathematics and Informatics , Faculty of Sciences , University of Novi Sad . Her research spans Graph Theory , Combinatorics , and Discrete Mathematics , with significant contributions to the study of Hamiltonian cycles , 2-factors , and Kekule structures in grid graphs and topological surfaces like torus and Klein bottle. Email: bodroza@dmi.uns.ac.rs Recent publications focus on graph enumeration and structural analysis in grid graphs, alongside interdisciplinary applications in mathematical biology and food production processes . Her work on the MTE-model highlights interests in mathematics education.

• Graph Theory
• Combinatorics
• Theoretical Computer Science
• +3 more

Rajko Nenadov is a Lecturer in Theoretical Computer Science at the University of Auckland, New Zealand. Previously, he earned his PhD from ETH Zurich in 2016 under Angelika Steger. He held postdoctoral positions at Monash University (Australia) and ETH Zurich, focusing on combinatorics and graph theory. Between 2018–2022, he worked as a software engineer at Google Zurich, contributing to search ranking algorithms. Returning to academia in 2023, his research emphasizes probabilistic methods, random structures, and applications in theoretical computer science. His education includes a PhD in Computer Science from ETH Zurich (2016). Notable career milestones include postdoctoral research on expanders, pseudorandomness, and Ramsey theory, followed by industry experience in algorithmic development. Rajko’s research interests revolve around combinatorics, with a focus on probabilistic methods, random graphs, extremal graph theory, and Ramsey theory. His work bridges foundational combinatorics with practical applications in computer science, particularly in algorithm design and computational complexity. His recent publications explore topics like hypergraph universality, container theorems, and extremal subgraph counting. These contributions highlight advancements in probabilistic combinatorics and structural graph theory. No scientific awards or grants are explicitly listed in the provided information. His career transition from academia to industry and back underscores his interdisciplinary expertise in theory and applied computing.

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

Xavier Goaoc is a Professor of Computer Science at Université de Lorraine, affiliated with the Department of Computer Science & Engineering at École des Mines de Nancy and the Gamble research team (joint between LORIA and INRIA). His research focuses on algorithms and discrete mathematics, particularly discrete and computational geometry, including convex hulls, intersection patterns, topological generalizations, and geometric transversal theory. University: Université de Lorraine School: School of Engineering Department: Department of Computer Science & Engineering Research Team: Gamble (LORIA/INRIA) Emails: xavier.goaoc@loria.fr , xavier.goaoc@univ-lorraine.fr His research spans computational geometry, combinatorial convexity, geometric transversal theory, and random geometric structures. Key topics include homological minors, order types of point sets, and geometric optimization. His 15 most recent publications highlight advancements in computational geometry algorithms, structural complexity, and topological constraints. Notably, his work has received Best Paper Awards at SoCG 2020, 2018, 2016, and 2012. Administrative roles include heading the computer science & engineering department at Mines Nancy and co-chairing the computer science department of the IAEM doctoral school. He is also a member of the Université de Lorraine's ‘pôle AM2I’ council. Teaching activities encompass courses in algorithms, computer architecture, blockchains, and geometric models for vision, with publications and grants reflecting his interdisciplinary impact in computer science and mathematics.

• Computational Geometry
• Discrete Mathematics
• Combinatorial Convexity
• +5 more

François Pirot is an Associate Professor (Maître de Conférences) at Université Paris-Saclay since September 1, 2021. He conducts research at the LISN laboratory within the GALaC team and teaches at the Faculty of Science of Orsay. PhD in Mathematics (Radboud University) and Computer Sciences (Université de Lorraine), 2019 Postdoctoral experience: ULB (2019), G-SCOP (2019-2020), Inria Sophia Antipolis (2020-2021) His research focuses on graph coloring problems in diverse contexts such as graph powers, locally sparse graphs, and distributed algorithms, utilizing probabilistic methods and connections to bio-informatics through circular codes. He has advanced bounds for h -conflict-free coloring, acyclic coloring, and dichromatic numbers in oriented graphs, with applications to minor-closed families and geometric group theory. Scientific contributions include: Asymptotically tight bounds for chromatic numbers in sparse graphs Efficient fractional coloring algorithms for K_t-minor-free graphs Structural analysis of comma-free and mixed circular codes in genetic alphabets Charles Delorme Prize for outstanding thesis in Graph Theory (2019) Collaborations span institutions like ULB, G-SCOP, Inria, and cross-disciplinary fields from computer science to mathematical biology.

• Graph Theory
• Combinatorics
• Probabilistic Method
• +4 more