Find Academic Supervisors

Michael KrivelevichView profile

Professor

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

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.

• Positional games
• Discrete geometry
• Computational geometry
• +3 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.

• Evolutionary Graph Theory
• Random Processes on Graphs
• Theoretical Computer Science
• +3 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.

• Randomness and Computation
• Algorithms and Optimization
• Complexity Theory
• +12 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.

Mladen NikolićView profile

Associate Professor

• Machine Learning
• Automated Reasoning
• Earthquake Damage Assessment
• +2 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.

Olga Bodroža-PantićView profile

Professor

• Graph Theory
• Combinatorics
• Theoretical Computer Science
• +3 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.

• Combinatorics
• Probabilistic Methods
• Random Graphs
• +4 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.