Prof. Tobias Müller is a Professor at the Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence at the University of Groningen. His academic journey includes previous positions at Utrecht University, CWI (Centrum Wiskunde & Informatica), Tel Aviv University, and Eindhoven University of Technology, with a doctorate from the University of Oxford under Colin McDiarmid. His research focuses on combinatorics, probability theory, random graphs, percolation, discrete and stochastic geometry, and combinatorial game theory. He has contributed extensively to understanding complex networks, hyperbolic models, and geometric random structures. Research Interests: Random Graphs and Percolation Theory Discrete and Stochastic Geometry Hyperbolic Network Models Probabilistic Combinatorics Geometric Probability Graph Algorithms and Connectivity Notable Contributions: Analysis of Voronoi and Poisson-Voronoi percolation in hyperbolic planes. Studies on Mallows random permutations and their cycle structures. Research on component games and logical limit laws in graph theory. Investigations into the geometry and properties of random geometric graphs. Grants & Collaborations: Active in organizing workshops and conferences on random graphs and geometric networks, including the BIRS Workshop on Random Geometric Graphs and the STAR Workshops series. Labs/Teams: Member of the Bernoulli Institute’s research groups, focusing on stochastic studies, combinatorics, and algorithmic methods.
Jan Draisma is a full professor of Mathematics at the University of Bern and a part-time full professor of Applied Algebra and Geometry at Eindhoven University of Technology (TU/e), where he is affiliated with the Department of Mathematics and Computer Science, specifically in Discrete Algebra and Geometry and Coding Theory and Cryptology. He obtained his Master's and Ph.D. degrees from TU/e cum laude and held a postdoctoral position at the University of Basel (2002–2005). He returned to TU/e as an assistant professor, later advancing to associate professor (2011–2016), and served as a part-time full professor at VU Amsterdam (2015–2016). His research focuses on the interplay between combinatorics, statistics, and algebraic geometry. Key areas include tropical geometry, algebraic statistics, symmetric systems of polynomial equations in infinitely many variables, and representation stability. His work often explores the structure of infinite-dimensional algebraic objects and their finite approximations. The most recent publications highlight trends in polynomial functors, topological Noetherianity, amoebas of linear spaces, and the geometry of tensor representations. These works reflect a deep integration of algebraic geometry with combinatorics and category theory, emphasizing stabilization phenomena and symmetry in algebraic structures. NWO Vici Award: Stabilisation in Algebra and Geometry (2015) NWO Vidi Award: Finite thanks to symmetry (2010) Draisma has received significant research funding, including the NWO Vidi and Vici grants, and two NWO Free Competition grants (2008, 2012). He has supervised 16 students and is actively involved in the academic community as an associate editor for Experimental Mathematics, SIAM Journal on Applied Algebra and Geometry, and Linear and Multilinear Algebra. He has held leadership roles in major conferences such as MEGA 2015 and SIAM AG 19. He is affiliated with the research groups in Discrete Algebra and Geometry and Coding Theory and Cryptology at TU/e and leads research activities centered on algebraic methods in discrete mathematics and statistics.
Noela Müller is an Assistant Professor in the Mathematics and Computer Science school at Eindhoven University of Technology . Her research focuses on Probability Theory , Random Matrices , and Random Graphs , with significant contributions to understanding the rank of sparse matrices and clique factors in probabilistic settings. Research Outputs : Published 22 works including journal articles and preprints. Collaborations : Active in international networks, particularly in sparse matrix analysis and probabilistic combinatorics. Her recent work explores sparse pooled data algorithms , random 2-SAT models , and sharp thresholds in random graphs , showcasing interdisciplinary applications in computer science, mathematics, and theoretical physics.
National Research Institute for Mathematics and Computer ScienceNetherlands
Jop Briët is a Researcher at the Department of Algorithms and Complexity at Centrum Wiskunde & Informatica (CWI) in the Netherlands. His work focuses on theoretical computer science, quantum information theory, combinatorics, and tensor analysis. He has held grants including the Veni Innovational Research Grant from NWO and a Rubicon fellowship. He has authored over 50 publications in leading venues, exploring topics such as Grothendieck inequalities, quantum computing, and additive combinatorics. His research interests span the interplay between combinatorics and computational complexity, with particular emphasis on tensor analysis, probabilistic methods, and algorithm design. Recent work includes studies on Szemerédi’s theorem with random differences and the application of quantum query algorithms to entanglement-based problems. Awards: Outstanding paper award TQC (2020), Andreas Bonn medal (2013), Stieltjesprijs (2011). Professional Activities: Editor for ERCIM News, Board Member of Koninklijk Wiskundig Genootschap, and frequent invited speaker at workshops on quantum computing and combinatorics. Grants: Veni Grant (2014), Rubicon Fellowship (2012). Current teaching includes courses on Additive Combinatorics and Quantum Information Processing, reflecting his commitment to bridging foundational theory with advanced applications in computing and mathematics.
Ross J. Kang is a Canadian mathematician currently serving as an Associate Professor at the Korteweg–de Vries Institute for Mathematics within the Faculty of Science at the University of Amsterdam since 2022. He is an active member of the Discrete Mathematics and Quantum Information group and the NETWORKS consortium. Previously, he held positions as Assistant/Associate Professor at Radboud University Nijmegen (2014-2022), Assistant Professor at Utrecht University (2013), and Researcher at Centrum Wiskunde & Informatica (2012-2013). His academic journey includes postdoctoral positions at Durham University (2010-2012) and McGill University (2008-2010), where he was advised by Bruce Reed and Louigi Addario-Berry. DPhil in Mathematics, University of Oxford (2008) - Thesis: 'Improper colourings of graphs', advised by Colin McDiarmid BSc (Hons) in Mathematics and Computer Science, University of Victoria (2003) - Governor General's Silver Academic Medal recipient Ross J. Kang's research focuses on probabilistic and extremal combinatorics, random discrete structures, graph coloring, geometric graphs, and algorithms. His work bridges theoretical mathematics with practical applications, exploring fundamental questions in discrete mathematics. He has made significant contributions to understanding graph coloring problems, particularly in the contexts of list coloring, distance coloring, and strong coloring. His research often employs probabilistic methods to establish bounds and structural properties in graph theory. Kang's work on the hard-core model, local occupancy method, and triangle-free graphs has advanced our understanding of the interplay between local constraints and global structure in discrete systems. Analysis of his recent publications reveals a strong emphasis on graph coloring problems, particularly list coloring variants and their extensions. His work frequently explores the relationship between graph structure (such as degree constraints, girth, or forbidden subgraphs) and coloring properties. A notable trend is his development and application of the local occupancy method to establish improved bounds for chromatic numbers in various graph classes. His research also demonstrates a consistent interest in extremal problems, seeking optimal configurations under specific constraints, particularly in the context of triangle-free graphs and geometric representations. NWO Open Competition M-1 grant entitled 'Asymptotic triangle-free structure (3Free)', 2022-2026 NWO Vidi grant entitled 'On the edge: theory and techniques at the frontiers of edge-colouring', 2017-2023 NWO Veni grant entitled 'Generalised colouring for random graph models', 2012-2015 Van Gogh travel grants (2020-2021 with Marthe Bonamy; 2016-2017 with Louis Esperet) Governor General's Silver Academic Medal (2003) Ross J. Kang has successfully supervised multiple PhD students including Eoin Hurley (defending May 2025), Stijn Cambie (defended April 2022), and François Pirot (winner of 2020 prix Charles Delorme). His research is supported by significant grants from the Netherlands Organisation for Scientific Research (NWO), including the prestigious Open Competition M-1 grant. Kang is actively involved in the academic community through his editorial role at Combinatorial Theory, co-organization of conferences like the Dutch Days of Combinatorics, and leadership in initiatives such as Innovations in Graph Theory, a diamond open access journal he helped launch in August 2023. As a member of the Discrete Mathematics and Quantum Information group at the University of Amsterdam and the NETWORKS consortium, Kang collaborates with researchers across various institutions. He has established strong international connections through his Van Gogh travel grants and participation in collaborative projects like the Sparse (Graphs) Coalition sessions. His research group focuses on theoretical aspects of discrete mathematics with connections to quantum information science, and he maintains active collaborations with researchers across Europe and North America.
Nikhil Bansal holds the prestigious Patrick C. Fischer Professorship of Theoretical Computer Science in the Department of Computer Science & Engineering at the University of Michigan's College of Engineering. His research program has established him as a leading figure in theoretical computer science, with significant contributions to algorithm design and analysis, particularly in discrete optimization problems. Bansal's research focuses on theoretical computer science with emphasis on design and analysis of algorithms for discrete optimization problems. His work spans multiple areas including discrepancy theory, approximation algorithms, randomized algorithms, combinatorial optimization, complexity theory, machine learning theory, and probability. He has made significant contributions to understanding the limits of approximation algorithms and developing novel techniques for combinatorial optimization problems. Analysis of Bansal's recent publications reveals a strong focus on discrepancy theory, online algorithms, and combinatorial optimization. His work often bridges theoretical computer science with discrete mathematics and probability theory. A recurring theme across his publications is the development of novel algorithmic techniques for solving NP-hard problems with provable guarantees. His research has evolved from foundational work in approximation algorithms to more recent contributions in quantum computing complexity and stochastic optimization. Patrick C. Fischer Professor of Theoretical Computer Science Bansal has advised numerous PhD students including Marek Elias, Shashwat Garg, and Greg Koumoutsous, as well as mentoring several postdoctoral researchers. He has served on editorial boards for top journals including Journal of the ACM, Theory of Computing, and Stochastic Models, and has been active on program committees for major conferences such as STOC, FOCS, SODA, and ICALP, including serving as chair for ICALP 2021. Bansal has organized multiple academic workshops including the STOC 2020 Workshop on Recent Advances in Discrepancy and Applications, several SDP Days at CWI Amsterdam, and the Semester on Bridging Continuous and Discrete Optimization at UC Berkeley in Fall 2017.
National Research Institute for Mathematics and Computer ScienceNetherlands
Daniel Dadush is a part-time Professor of Geometry of Optimization at Utrecht University and leads the Networks & Optimization group at Centrum Wiskunde & Informatica (CWI). He has held previous positions as a Simons Postdoctoral Fellow at the Courant Institute of Mathematical Sciences (New York University) and a PhD in the ACO program (Algorithms, Combinatorics, and Optimization) at Georgia Tech. Research Interests: Lattice Algorithms, Geometry of Numbers, Linear/Integer Programming, Extended Formulations, Discrepancy Theory, Convex Optimization, Asymptotic Convex Geometry. Awards: Van Dantzig Prize (2020), Best Paper Award at CCC'20 (2020), Tucker Prize (2015). Advising: Supervised PhD/MSc students including Ben Bals, Samarth Tiwari, Sander Borst, Sophie Huiberts, Huck Bennett, and Yilin Li. Recent Publications: His 15 most recent articles focus on strongly polynomial algorithms, exact integer programming, convex optimization in the oracle model, matrix discrepancy, circuit diameter bounds, and integrality gaps, spanning journals and conferences like STOC, SODA, FOCS, and Mathematical Programming. Professional Activities: Organizer of the Dutch Day on Optimization (2022), co-organizer of workshops on Discrepancy Theory, Lattices, and Discrete Optimization at institutions like HIM Bonn and the Simons Institute. Served on program committees for STOC 2025, SODA 2024, and other major conferences. Teaching: Lectured on Interior Point Methods, Straight-Line Complexity, and courses in Continuous Optimization at Utrecht University and Mastermath.
Raffaella Mulas is an Assistant Professor in the Department of Mathematics at the Faculty of Science, Vrije Universiteit Amsterdam. She previously served as a Group Leader and Minerva Fast Track Fellow at the Max Planck Institute for Mathematics in the Sciences, where she maintains an ongoing affiliation. Her research lies at the intersection of spectral graph theory, discrete mathematics, and network science. Research Interests: Her work focuses on the spectral theory of graphs and hypergraphs, particularly the properties of discrete Laplacians and non-backtracking operators. She investigates extremal combinatorics problems such as graph coloring and the Turán problem, often applying spectral methods to derive sharp bounds. Her research has strong applications in modeling and analyzing complex networks. Recent Research Trends: Analysis of the 15 most recent publications reveals a consistent focus on spectral characterizations of graphs and hypergraphs, including signed and complex unit hypergraphs. She frequently studies the normalized Laplacian and its extremal eigenvalues, develops non-backtracking operators, and explores measure-theoretic and geometric representations of networks. A strong thread connects spectral bounds to combinatorial invariants like chromatic number. VU Startpremie Grant Elected Member, European Mathematical Society Young Academy (EMYA) Elected Member, Elisabeth-Schiemann-Kolleg, Max Planck Society Minerva Fast Track Fellow, Max Planck Institute Advising and Grants: While no formal students are listed, she is an active researcher with significant grant funding, notably the VU Startpremie Grant. She collaborates internationally and supervises research projects in spectral graph theory and network analysis. Her affiliation with both VU Amsterdam and MPI-MiS enables broad academic mentorship and collaborative supervision. Labs and Research Groups: Raffaella Mulas leads research within the Mathematics Department at VU Amsterdam and is affiliated with the research group at the Max Planck Institute for Mathematics in the Sciences. Her work contributes to advancing theoretical foundations in discrete mathematics with applications in data science and network modeling.
Marc Jochen Uetz is a Full Professor at the Mathematics of Operations Research department and affiliated with the Digital Society Institute. His research spans operations research and computer science, focusing on scheduling, game theory, and optimization problems. PhD in Mathematics from Technische Universität Berlin Research Interests: Active in algorithmic game theory and stochastic scheduling, he investigates equilibrium models, price of anarchy, and efficient resource allocation in transportation and network systems. His work contributes to UN Sustainable Development Goals related to education and infrastructure. Publication Trends: Recent work combines game theory with two-stage facility location, network routing, and stochastic scheduling of Bernoulli-type jobs. Key keywords include Nash equilibrium, approximation algorithms, and dynamic programming. Scientific Recognition: Excellent Reviewer Award (2017) Teaching Award (2018) Academic Activities: Currently chairs Platform Wiskunde Nederland, contributes to editorial work, and delivers invited talks at international conferences like IJCAI 2024.
Johannes Hölzl is a Post-doctoral Researcher in the Faculty of Science , specifically within the Department of Computer Science at Vrije Universiteit Amsterdam . He works in the Section of Theoretical Computer Science , focusing on formal verification and probabilistic systems. His research integrates higher-order logic with programming languages to model and verify complex computational processes. Position: Post-doctoral Researcher Institution: Vrije Universiteit Amsterdam Department: Computer Science Section: Theoretical Computer Science Hölzl's research spans formal verification, probabilistic programming, and concurrency. He has contributed extensively to the Isabelle/HOL proof assistant, formalizing mathematical structures like measure theory, Markov chains, and timed automata. His work bridges theoretical analysis with practical verification tools, ensuring rigorous proofs in automated reasoning. His publications highlight advancements in probabilistic systems, including formalizing Markov decision processes (2017), verifying compilers for probability density functions (2015), and analyzing expected running times of probabilistic programs (2016). The 2025 article on probabilistic timed automata indicates ongoing exploration of concurrent probabilistic models. Hölzl has no explicitly listed scientific awards in the provided texts. His collaborations with researchers like Tobias Nipkow and Andrei Popescu underscore interdisciplinary efforts in formal methods and security verification. He contributes to the Theoretical Computer Science Section at VU Amsterdam, advancing foundational research in logic-based programming and probabilistic modeling.
Georg Loho is an Assistant Professor in the department of Mathematics of Operations Research. His research focuses on the intersection of combinatorics, optimization, and geometry, with a particular emphasis on oriented matroids, tropical geometry, and algorithmic game theory. He explores applications in machine learning, neural network architecture, and stochastic games. Key research themes include the study of matroid theory, convex analysis, and the development of algorithms for optimization problems. His work bridges theoretical mathematics with practical applications in computational fields, such as analyzing the complexity of neural networks and solving problems in mean payoff games. Recent contributions include advancements in tropical geometry applied to neural networks and the reduction of stochastic games to semidefinite programming. He actively collaborates on interdisciplinary projects, as evidenced by his talks and publications in top-tier journals such as Selecta Mathematica and TheoretiCS . His research outputs span topics like polymatroids, lattice polytopes, and combinatorial optimization, reflecting a commitment to both foundational theory and computational methods.
Jorn van der Pol is a Lecturer in the Department of Mathematics of Operations Research. His research focuses on matroid theory, combinatorics, and discrete mathematics, with notable contributions to the study of matroid enumeration, properties of matroids, and their applications in graph theory and optimization. His work often intersects with extremal combinatorics, hypergraph structures, and algorithmic enumeration techniques. Key research interests include Turán densities in hypergraphs, binary geometries, and the analysis of matroid minors. Recent collaborations explore the interplay between matroid theory and stochastic simulation methods. His publications span prestigious journals such as SIAM Journal on Discrete Mathematics and the Electronic Journal of Combinatorics, with an emphasis on open-access research. Van der Pol’s research trends highlight advancements in enumerative combinatorics, symmetry analysis in matroids, and probabilistic approaches to matroid structures. His work contributes to foundational questions in discrete mathematics and operations research, with applications in graph theory and algorithm design. No scientific awards are explicitly mentioned. His advising and grant activities remain unspecified in the provided texts. Research collaborations include studies on Earth and Planetary Sciences, though the primary focus remains matroid theory and combinatorial structures.
Dr. S.A. Donderwinkel is a researcher at the Bernoulli Institute within the Faculty of Science and Engineering at the University of Groningen. Their work focuses on probability theory, random graph models, and stochastic processes, with recent publications exploring graphic sequences, critical tree structures, and directed configuration models. They actively contribute to academic research through collaborations and peer-reviewed publications. University: University of Groningen School: Faculty of Science and Engineering Department: Bernoulli Institute Role: Researcher Email: s.a.donderwinkel@rug.nl Research interests include: Integrated random walks and graphic sequences Critical tree analysis and Cauchy distributions Height bounds in random trees Universality in directed configuration models Asymptotic behavior of random structures Their recent publications (2024-2025) demonstrate expertise in probabilistic combinatorics and graph theory, with applications in theoretical computer science and mathematical physics. All articles exhibit rigorous peer-reviewed academic contributions.
Julia Komjathy is an Associate Professor at Delft University of Technology's Faculty of Electrical Engineering, Mathematics and Computer Science (EWI), within the Delft Institute of Applied Mathematics (DIAM). She leads the Applied Probability Group and focuses on probabilistic network models, including random graphs, spatial networks, and epidemic processes. Her research explores structural properties like 'explosion' in weighted graphs and phase transitions in contact processes. Education: Ph.D. in Mathematics from TU Budapest under Professors Márton Balázs and Károly Simon (2012). Thesis: Topics in Markov chains: Mixing and escape rate . Research Interests: Random graph models of complex networks Spatial random graphs and hyperbolic geometry Weighted random graphs and distance evolution Epidemic spread dynamics on networks Branching processes and percolation theory Phase transitions in scale-free systems Professional Activities: Organizer of TU Delft's Probability & Statistics Seminar Keynote speaker at WAW 2024 (Warsaw) and Discrete Probability Days 2023 (Barcelona) Supervised 4 PhD students, including Enrico Baroni (2017), Viktoria Vadon (2020), and Joost Jorritsma (2023) Awards: None explicitly listed, but her work has been published in top journals like PNAS, Annals of Applied Probability, and Random Structures & Algorithms. Current Projects: Investigating degree-dependent contact processes, first-passage percolation growth regimes, and cluster-size decay in spatial networks.
Juan Vera Lizcano is a Professor at Tilburg University's Tilburg School of Economics and Management, Department of Econometrics and Operations Research. He holds a PhD in Industrial Engineering from the University of Florida and specializes in optimization, machine learning, and operations research. His research focuses on mathematical programming, probabilistic combinatorics, and their applications in operations research and computer science, particularly in polynomial optimization, sparse methods for machine learning, and the relationship between error bounds and algorithm convergence. Professor Vera Lizcano's recent publications demonstrate a consistent focus on optimization techniques across mathematical, financial, and machine learning domains. His work shows strong interdisciplinary connections between operations research, computer science, and applied mathematics. He supervises doctoral research and has contributed to projects like the PROMISe initiative recording clinical interventions by community pharmacists. His laboratory investigates advanced optimization methods and their practical implementations.
