Aida Abiad Monge is an Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e), where she chairs the Algebraic Combinatorics group. She holds a 0.1fte position as an Associate Professor at Vrije Universiteit Brussel and is a guest researcher at Ghent University. Her research focuses on algebraic graph theory, including spectral graph properties, combinatorial optimization, and applications in quantum information theory and coding theory. Her academic career includes postdoctoral fellowships at Ghent University (2020-2023) and Vrije Universiteit Brussel (2020-2023). She has been awarded grants such as the NWO VIDI and BOF Postdoctoral Fellowship. Her editorial roles include serving on the boards of the Electronic Journal of Linear Algebra and The Electronic Journal of Combinatorics. Research Interests: Spectral graph theory, coding theory, quantum information, finite geometry Key Achievements: Over 60 publications, including works on sum-rank metric codes and cospectral hypergraphs Teaching: Courses like Algebraic Combinatorics and Combinatorics and Applications Her work bridges theoretical advancements with practical applications, particularly in optimizing coding schemes and analyzing graph structures through algebraic 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.
Dr. Ilke Canakci is an Assistant Professor in the Department of Mathematics at Vrije Universiteit Amsterdam. She specializes in cluster algebras, combinatorics, and representation theory. Her research focuses on algebraic structures like perfect matchings, derived categories, and triangulations. She teaches Discrete Mathematics, Group Theory, and Linear Algebra courses. Key collaborators include researchers from institutions worldwide. Her recent work explores cluster categories for infinity-gons and infinite friezes related to annulus triangulations. Awards and grants are not explicitly mentioned, but her extensive publication record reflects active research in algebraic geometry and combinatorial mathematics. Research Interests: Cluster algebras, categorification of geometric structures, combinatorial patterns, representation theory of algebras, and applications of algebraic methods to geometric problems. Current projects involve extending Caldero-Chapoton maps and analyzing frieze patterns in non-traditional geometries.
Hendrik Jan Hoogeboom is an Associate Professor in the Department of Computer Science at Leiden University, affiliated with the Leiden Institute of Advanced Computer Science (LIACS) and the Theory research cluster. Research Interests: His work lies at the intersection of theoretical computer science and computational biology. He specializes in formal languages , algorithms , logic & automata (including tree-walking automata), and infinitary languages . A major theme is modeling natural computation, such as gene assembly in ciliates using graph polynomials and delta-matroids, and molecular computing paradigms like reaction systems and spiking neural P systems. Publication Trends: His recent publications (2017–2024) show a sustained focus on reaction systems and graph polynomials. He has developed formal models to analyze DNA rearrangements, explored the algebraic structure of gene assembly, and investigated the computational power of various natural computing models, often using combinatorial and algebraic tools from graph theory. Scientific Recognition: While specific awards are not listed, his extensive publication record in premier journals like Theoretical Computer Science , European Journal of Combinatorics , and Fundamenta Informaticae signifies high recognition in his field. Teaching and Mentorship: He has supervised several PhD students, including Robert Brijder, Jun Wang, and Rudy van Vliet. He teaches core courses such as Data Structures , Algorithms , Automata Theory , and Complexity , and has led seminars on topics like combinatorial game theory and SAT solvers. Laboratories and Teams: He is a key member of the Theory research cluster at LIACS, focusing on fundamental aspects of computer science. His work is deeply collaborative, especially with colleagues like Robert Brijder and W.A. Kosters.
Jacquelien Scherpen is a Professor at the University of Groningen, currently serving as Rector Magnificus. She holds a position in the Engineering and Technology institute Groningen (ENTEG) within the Faculty of Science and Engineering. Her academic journey includes a PhD in Applied Mathematics from the University of Twente (1994) and post-doctoral roles at Delft University of Technology before joining Groningen in 2006. She has been a leader in systems and control research, with roles as Scientific Director of ENTEG (2013–2019) and Director of the Groningen Engineering Center (2016–2023). Her research focuses on model reduction, nonlinear control, smart energy systems, and distributed control applications in smart grids. Key achievements include the Automatica Best Paper Prize (2020), Knight of the Order of the Netherlands Lion (2019), and the Prince Friso Engineer of the Year Award (2023). She has held leadership roles in organizations like the European Control Association (EUCA) and is a Fellow of IEEE. Her professional activities include editorial roles in journals like the IEEE Transactions on Automatic Control and the International Journal of Robust and Nonlinear Control. She has organized major conferences, including the European Control Conference (ECC) 2021 and 2023. Her work bridges theoretical advancements with practical applications, emphasizing sustainability and engineering innovation.
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.
Rudi A. Pendavingh is an Assistant Professor at Eindhoven University of Technology's Mathematics and Computer Science department, specializing in Combinatorial Optimization. He earned his PhD at the University of Amsterdam in topological graph theory and has since contributed to diverse areas of combinatorics and geometry, with recent focus on matroid theory. His teaching spans mathematical programming topics including linear, integer, and semidefinite optimization. Education: PhD in Topological Graph Theory (University of Amsterdam) His research integrates combinatorial structures with geometric and algebraic methods, particularly in matroid theory, graph embeddings, and tropical geometry. Key publication themes include optimization algorithms, excluded matroid minors, and geometric invariants. Collaborations extend to institutions in mathematics and applied sciences, with notable academic output (67 research items) and external partnerships. Recent research outputs (2022-2025) highlight his work on the Colin de Verdière parameter, Dressian bounds, and tropical amoebas. While no explicit awards are mentioned in the provided text, his contributions to combinatorial optimization and network collaborations underscore his academic impact. He has supervised 29 students and contributed to 7 courses, including Discrete Optimization Modeling and Mathematics II.
Twan Basten is a Full Professor in the Electronic Systems group at Eindhoven University of Technology (TU/e). He leads research on embedded and cyber-physical systems, focusing on model-driven design, computational models, and system dependability. He holds an MSc (1993) and PhD (1998) in Computing Science from TU/e, advancing from Assistant to Full Professor by 2009, and became the Electronic Systems group chair in 2013. His research spans international projects (FP5-7, H2020, ECSEL) and Dutch initiatives (STW, NWO, RVO), with over 200 publications and seven best paper awards. He has co-supervised 21 PhD students and actively participates in program committees and conferences. His work contributes to UN Sustainable Development Goals through innovations in smart systems. Education: MSc in Computing Science, TU/e (1993) PhD in Computing Science, TU/e (1998) Research Interests: Explores design methodologies for embedded systems, including scenario-based design, real-time scheduling, and performance analysis. Specializes in model-driven engineering and computational models to ensure system dependability. Active in projects like TRANSACT (real-time systems) and SAM-FMS (flexible manufacturing). Key Contributions: Co-author of 1 book and over 200 scientific publications Recipient of seven best paper awards Co-supervised 21 PhD degrees Senior member of IEEE and lifetime member of ACM Labs & Teams: Leads the Model-Based Design Lab and contributes to EAISI High Tech Systems initiatives. Collaborates on tools like TRACE4CPS for execution trace analysis and CReTS for vehicle platooning simulation.
Magnus Botnan is an Assistant Professor at the Department of Mathematics, Vrije Universiteit (VU) Amsterdam. He held a tenure-track position from 2018-2022, was a postdoc at TU Munich (2016-2018) under Ulrich Bauer, and earned his PhD at NTNU in 2015 under Nils A. Baas. His research spans topological data analysis, bridging pure mathematics (representation theory of quivers) with computational and applied aspects (persistent homology, data signatures). Education: PhD in Mathematics at Norwegian University of Science and Technology (NTNU) Research Grants: VIDI career grant (€850,000) Research Collaborations: with Mike Lesnick, Ulrich Bauer, S. Oppermann, and S. Oudot His recent work includes extremal Betti numbers, bottleneck stability, and signed barcodes for multiparameter persistence. He co-organized applied topology meetings in the Netherlands and supervises graduate students in computational topology. Key scientific contributions: Advances in Mathematics Journal of Applied and Computational Topology SoCG conference proceedings He teaches courses such as Calculus 2, Complex Analysis, and Topological Data Analysis at VU Amsterdam and Mastermath, with past courses in Differential Equations, Linear Algebra, and Modelling of Dynamical Systems.
Gaurav Rattan is an Assistant Professor in the Department of Applied Mathematics at the University of Twente's Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS), where he joined in May 2024. His research focuses on the mathematical foundations of machine learning on graphs and discrete structures, with particular emphasis on theoretical aspects of graph neural networks. University of Twente, Department of Applied Mathematics (May 2024-present) TU Darmstadt, Postdoctoral Researcher in Pascal Schweitzer's group RWTH Aachen, DFG Eigene Stelle Researcher in Martin Grohe's group Dr. Rattan completed his PhD at IMSc Chennai under V. Arvind and earned his B. Tech. from IIT Bombay, establishing a strong foundation in theoretical computer science and mathematics. His research spans graph theory, algorithms, and machine learning on graphs, with specific expertise in graph isomorphism, graph homomorphisms, and the theoretical underpinnings of graph neural networks. He applies mathematical techniques from logic and algebra to develop theory-driven approaches for graph learning systems, with practical applications in optimization, bioinformatics, and databases. Dr. Rattan's publication record reveals a consistent focus on the intersection of theoretical computer science and machine learning. His recent work explores Weisfeiler-Leman algorithms, symmetry breaking techniques, and parameterized complexity of graph problems, demonstrating how classical graph algorithms connect with modern graph learning methodologies. His research provides crucial theoretical foundations for understanding the capabilities and limitations of graph neural networks. Active in the academic community, Dr. Rattan regularly presents at conferences including the Netherlands Mathematical Congress, SIGAlgo, LOGAMS, and specialized workshops on graph learning. Recent presentations include "From Graph Homomorphisms Densities to Graph Learning" at the Graph Learning Workshop at NITMB Chicago and "Color Refinement: One Algorithm, Many Facets" at SIGAlgo 2024.
Arthemy Kiselev is an Assistant Professor at the University of Groningen's Faculty of Science and Engineering, specifically within the Department of Mathematics at the Johann Bernoulli Institute. He has been working at the Chair of Algebra since January 2011, contributing significantly to mathematical physics research. His educational background includes: (Under)graduate studies at Lomonosov Moscow State University (summa cum laude, 2001) and Independent University of Moscow PhD in mathematical physics (2004) Professor Kiselev's research focuses on the interface of (super)geometry and quantisation, particularly examining the (non)commutative geometry of Kontsevich's deformation and Batalin-Vilkovisky's approaches to quantisation of gauge field models. His work centers on deformation quantisation, BV quantisation, geometry of differential equations, Poisson geometry, and brackets. He has developed algebraic and geometric tools for the mathematical language of fundamental physics, with particular emphasis on the geometry of variations in Batalin-Vilkovisky formalism and Kontsevich's deformation quantization. His fingerprint in research shows strong connections to Cocycle Mathematics (100%), Poisson Bracket Mathematics (95%), Vector Field Mathematics (77%), Manifold Mathematics (65%), Poisson Structure Mathematics (51%), and Partial Differential Equation Mathematics (41%). His recent publications (2023-2024) demonstrate continued exploration of Kontsevich graphs acting on Nambu-Poisson brackets, star-products for affine Poisson brackets, and associativity properties in deformation quantization. These works show a consistent focus on understanding the mathematical structures underlying quantization procedures, with particular attention to graph complexes, cocycles, and their applications to Poisson geometry. His research reveals deep connections between algebraic structures, differential geometry, and theoretical physics. Scientific recognition includes: NWO VENI post-doctoral grant at Mathematical Institute Utrecht (2008-2010) Throughout his career, Kiselev has given 107 international talks at mathematics and theoretical physics research seminars. His collaborative work with PhD and master's students, such as M.S. Jagoe Brown and F. Schipper, has produced significant results in Poisson geometry and deformation quantization. His research has been supported by various institutions including visits to prestigious centers like IHES (France), MPIM (Germany), CRM (Montreal, Canada), and SISSA (Trieste, Italy). He has held positions at institutions including ISPU in Ivanovo, Russia (as docent since 2009). Kiselev is an active member of the Geometry and Quantum Theory (GQT) research group, contributing to the vibrant mathematical physics community at Groningen. His work continues to bridge abstract mathematical structures with fundamental physical theories, particularly through the lens of deformation quantization and Poisson geometry.
Dr. Steven Wepster is an Assistant Professor in the Department of Fundamental Mathematics at Utrecht University's Faculty of Science. His work is centered in the Mathematical Institute, where he contributes to both teaching and research in the history of mathematics. Wepster is actively involved in teaching courses including History of Mathematics, Mathematical Techniques 1, and Mathematical Techniques 2. Wepster's research focuses on the history of mathematics, particularly 18th century mathematical astronomy, lunar distance methods, and the works of historical figures like Tobias Mayer and Ludolph van Ceulen. His work bridges mathematical theory with historical context, examining how mathematical concepts evolved and were applied in navigation and astronomy. He has made significant contributions to understanding circle quadratures, celestial navigation techniques, and the development of mathematical tables. His scholarly activities reveal a strong pattern of engagement with the history of mathematical astronomy and navigation. Wepster has presented numerous invited talks on topics ranging from lunar distance methods to historical mathematical education. His editorial work for journals like 'Nieuw archief voor wiskunde' demonstrates his commitment to advancing historical mathematical scholarship. Among his notable activities are presentations on Tobias Mayer's lunar tables, circle quadratures of Kashani and Van Ceulen, and transits of Venus. Wepster has also been actively involved in connecting pre-university and university mathematics education, serving on the National working group GMFW. Editor for 'Nieuw archief voor wiskunde. Serie 4' (2011-2013) Editor for 'Zebra series' (2012) Member of Epsilon Publishing (2011-2013) Member of National working group GMFW (2011-2013) Wepster maintains an active role in both academic and public dissemination of mathematical history, presenting at museums like Museum Boerhaave and participating in national mathematics events. His work demonstrates a commitment to making historical mathematical concepts accessible to both academic and general audiences.
