Ruilin Shi serves as the William W. Elliott Assistant Research Professor in the Department of Mathematics at Duke University. Their office is located at 120 Science Drive, Durham, NC. Education: Ph.D. from Georgia Institute of Technology (2025) Dr. Shi specializes in combinatorial mathematics with particular focus on extremal graph theory and planar Turán problems . Their research investigates maximum edge counts in planar graphs avoiding specific substructures, particularly cycles of various lengths. This work bridges theoretical computer science and pure mathematics, contributing to fundamental understanding of graph limitations under planarity constraints. Recent publications demonstrate expertise in determining precise bounds for planar Turán numbers, with significant results for 7-cycles and general cycle graphs. Their work connects circuit graphs, near triangulations, and connectivity properties to solve longstanding conjectures in the field. No scientific awards are currently documented in the available information. For Fall 2025, Dr. Shi is teaching multiple sections of MATRICES AND VECTOR SPACES (MATH 218D and MATH 718D) across different time slots and locations including Physics 154, Physics 235, and LSRC A247. No laboratory or research team information is specified in the available documentation.
Sebastian Cioaba is a Professor in the Department of Mathematical Sciences at the University of Delaware (UD), part of the College of Arts & Sciences. His research focuses on spectral graph theory, algebraic combinatorics, and their applications. He earned his Ph.D. from Queen’s University (2005) and joined UD in 2009 after postdoctoral work at UC San Diego and the University of Toronto. Cioaba has advised 8 Ph.D., 4 M.Sc., and numerous undergraduate researchers, with current advisees including John Byrne and Isabel Byrne. His work is supported by NSF, NSA, and international grants. Education - B.Sc. Mathematics & Computer Science, University of Bucharest (Undergraduate) - Ph.D. Mathematics, Queen’s University (2005) Research & Awards - 2024 College of Arts & Sciences Award - Co-editor of Discrete Mathematics and Linear Algebra and its Applications - Over 70 publications and two books: A Bridge to Advanced Mathematics (2023) and A First Course in Graph Theory and Combinatorics (2022, 2nd ed.) Teaching & Service - Organized conferences in discrete mathematics - Supervised over 25 undergraduate and high school students in research projects Advising - Current Ph.D. students: John Byrne, Isabel Byrne, Colby Sherwood - Notable past advisees include Vishal Gupta (Ph.D. 2025, Rochester) and Dheer Noal (Ph.D. 2022, Memphis postdoc)
Xiaoyu He is a tenure-track Assistant Professor at the School of Mathematics, Georgia Institute of Technology. Starting Fall 2025, he will teach Math 8803, a graduate-level topics course on Ramsey and Turán problems for graphs and hypergraphs. His research spans extremal, probabilistic, and algebraic combinatorics , focusing on Ramsey theory, graph coloring, additive combinatorics, discrete geometry, and coding theory with applications to computer science. Education: PhD in Mathematics from Stanford University (2021), advised by Jacob Fox. Prior Roles: NSF Postdoctoral Research Fellow at Princeton University (mentored by Noga Alon). Current Group: Collaborates with Visiting Assistant Professor Jiaxi Nie and PhD students Ruben Ascoli, Winston Stucki, and Logan Post. Awards: NSF Postdoctoral Research Fellowship. Contact: xhe399@gatech.edu , Office: Skiles 260.
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.
Maria Axenovich is a Professor at the Department of Mathematics , Karlsruhe Institute of Technology (KIT). Her research focuses on graph theory and combinatorics , emphasizing unavoidable structures in graphs, Ramsey-type problems, Turán densities, and extremal graph theory. Education : Undergraduate in Novosibirsk, Russia; Ph.D. at the University of Illinois at Urbana-Champaign under Zoltan Füredi. Positions : Previously at Iowa State University; since 2012 at KIT. Editorial Roles : Editor-in-Chief of the Electronic Journal of Combinatorics (2020–present); Associate Editor of Order (2016–present). Recent Research Trends : Her 2023–2025 publications address hypercubes , poset Ramsey numbers , interval colorings , extremal subgraphs , and canonical Ramsey theorems . Collaborations span institutions in the US, UK, Hungary, and Germany. Students and Collaborations : Supervises Ph.D., Master’s, and Bachelor students. Current advisees include Dingyuan Liu , Christian Winter , and Lea Weber . Former students like Jonathan Rollin and Torsten Ueckerdt have contributed to extremal graph theory and hypergraphs. Courses : Teaches Linear Algebra , Combinatorics , and Graph Theory at KIT. Leads seminars on Extremal Set Theory and Discrete Mathematics .
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.
Hemanshu Kaul is an Associate Professor of Applied Mathematics at Illinois Institute of Technology (IIT), part of the College of Computing. He serves as Co-Director of the M.S. in Computational Decision Science and Operations Research (CDSOR) program. His expertise spans Discrete Mathematics, Operations Research, Graph Theory, and Network Optimization, with applications in transportation, computer science, and engineering. Education: PhD in Mathematics from the University of Illinois at Urbana-Champaign (UIUC), MS in Mathematics from the Indian Institute of Technology Bombay. He has held roles including Distinguished Teaching Fellow (2016–2018) and AMS Project NExT Fellow (2007–2008). Research Interests : Focus on Graph Packing, DP-coloring, List Coloring, and algorithmic solutions for discrete optimization problems. His work bridges theoretical foundations with practical applications such as transportation networks and computer science systems. Publications & Grants : Over 50 publications in combinatorics and optimization, including NSF/NSA-funded projects like the EXCILL III Conference (2016–17). Recent work explores spectral Turán problems, DP-coloring algorithms, and longitudinal network models. Awards : Board of Trustees Award for Excellence in Teaching (2019) Excellence in Teaching Award (2017, College of Science, IIT) Interdisciplinary Research Grant (2009–2010, Transportation Networks) Advising & Leadership : Co-advisor for IIT's SIAM Student Chapter. Led restructuring of the Applied Math M.Sc. program (2018–19). Advised teams in the Mathematical Contest in Modeling (MCM), including a 2019 Meritorious Winner team for a disaster response system design. Labs & Collaborations : Involved in interdisciplinary projects combining applied math with computer science and engineering, including work on equitable public transit systems and network optimization.
Arindam Roy is an Associate Professor in the Department of Mathematics and Statistics at the University of North Carolina at Charlotte. He serves as the Director of the Math and Stat Honors Program and is affiliated with research in analytic number theory, algebraic number theory, and graph theory. Current Position: Associate Professor, UNC Charlotte (2025–) Previous Positions: Assistant Professor, UNC Charlotte (2018–2025); G.C. Evans Instructor, Rice University (2015–2018) His research focuses on zeros of the Riemann zeta-function and L-functions, partial sums of zeta functions, divisor problems, integral transforms, and graph theory. Recent work explores value distributions, Turán inequalities, and connections to Ramanujan's theories. Key trends in his publications include analytic number theory, special functions, and the interplay between modular forms and graph theory. His articles often address critical line behavior, approximation techniques, and arithmetic functions.
Jeffry Kahn is a Professor of Mathematics at Rutgers, The State University of New Jersey, within the Department of Mathematics. His research focuses on discrete mathematics and related areas, with particular emphasis on combinatorics, graph theory, and probability. He holds an office in Hill Hall (HLL-728) on the Busch Campus. His work spans foundational contributions to extremal combinatorics, random graph theory, and probabilistic methods. Kahn has co-authored influential papers on threshold phenomena, phase transitions in statistical mechanics models, and structural properties of discrete systems. Notable contributions include resolving Borsuk's conjecture and advancing understanding of random matrix singularity probabilities. He teaches advanced courses such as Combinatorics II (642.583), emphasizing problem-solving and rigorous proofs. His research interests exhibit a cohesive thread in exploring combinatorial structures under probabilistic and extremal frameworks. Recent works address Shamir’s Problem asymptotics, maximal independent sets in hypercubes, and threshold conjectures. His articles often intersect with theoretical computer science, revealing interdisciplinary insights. Despite no explicitly listed awards, his publications in top journals like Annals of Mathematics and Combinatorica underscore his academic impact. His advising focuses on graduate-level combinatorial research, with courses structuring students via problem sets requiring precise, efficient solutions.
Dr. Maria Ivan is a Lecturer in the Department of Pure Mathematics and Mathematical Statistics at the University of Cambridge and holds a Fellowship at Magdalene College. Her primary academic appointment involves research and teaching in advanced mathematical disciplines. Her research focuses on several interconnected areas of combinatorics: Extremal Combinatorics : Investigating maximum/minimum possible sizes of mathematical structures Ramsey Theory : Studying conditions under which order must appear in mathematical systems Poset Saturation : Examining partially ordered sets that are maximally dense without containing certain substructures Analysis of her 15 most recent publications (2020-2025) reveals consistent focus on combinatorial structures including poset saturation problems, Turán densities for hypercubes and daisies, Ramsey-theoretic characterizations, and extremal set theory. Her work frequently involves establishing new bounds, solving open conjectures, and developing novel proof techniques within discrete mathematics. No scientific awards, grants, or student advising relationships are documented in the available information.
Klas Markström is a Professor at the Department of Mathematics and Mathematical Statistics, Umeå University. He holds academic qualifications as a Docent and a Recognised University Teacher in Mathematics. His primary research interests include combinatorics, graph theory, hypergraphs, computational combinatorics, linear algebra, and mathematical physics. He utilizes Swedish supercomputing resources, including those at HPC2N, for his research. Markström has advised PhD students Lan Anh Pham (2019) and Joel Larsson (2018). His postdoctoral collaborators include Jakub Sliacan, Fei Song, and Victor Falgas-Ravry. His work spans theoretical contributions to combinatorics, computational methods, and applications in statistical mechanics and algorithm design. Notable research trends include explorations of Condorcet domains in social choice theory, extremal graph/hypergraph problems, and algorithmic solutions for SAT problems. His software contributions include the Umsat SAT-solver and GrafPack, a Mathematica package for graph theory. He has published extensively on topics such as Turán hypergraphs, covering designs, and computational techniques for graph enumeration. Collaborations involve interdisciplinary projects with physicists and computer scientists, reflecting his engagement with both pure and applied mathematics. His research often bridges combinatorial theory with computational experimentation, yielding impactful results in discrete mathematics and beyond.
Kirill Simonov is an Associate Professor in the Department of Informatics at the University of Bergen. His research focuses on parameterized complexity, algorithm design, and graph theory, with particular emphasis on clustering algorithms, graph modification problems, and algorithmic graph theory. He has contributed to foundational work in fair clustering, approximate algorithms for graph cycles, and structural analysis of sparse graphs. His notable contributions include studies on coresets for fair clustering, algorithmic extensions of Dirac's theorem, and techniques for building large k-cores from sparse graphs. His work is supported by the Research Council of Norway (Project 314528). He frequently collaborates with leading researchers like Fedor Fomin and Petr Golovach on topics such as parameterized algorithms and combinatorial optimization. Simonov's publications span venues like the Journal of Computer and System Sciences and Leibniz International Proceedings in Informatics. His research bridges theoretical computer science with practical algorithmic solutions for graph problems and data clustering challenges.
Martí Farré is a faculty member in the Department of Mathematics at the Faculty of Mathematics and Statistics, Universitat Politècnica de Catalunya (UPC). He is actively involved in the COMBGRAPH research group (Combinatorics, Graph Theory, and Applications) and the OMGRAPH subgroup focusing on optimization methods in graphs. His research spans theoretical and applied aspects of discrete mathematics. Research Interests: Martí's work centers on Combinatorics and Graph Theory , with particular emphasis on extremal problems, connectivity, matching theory, independence number, and spectral graph properties. His research often investigates structural and optimization properties of graphs under constraints such as fixed diameter, degree sequences, or matching numbers. The analysis of his recent publications reveals a consistent focus on extremal graph theory, where he derives bounds and characterizes graphs maximizing or minimizing certain parameters (e.g., edges, diameter, connectivity) under given constraints. Key themes include vulnerability and robustness of networks, spectral properties, and combinatorial optimization on graphs. Scientific Awards and Recognition: Premi o reconeixement (Recognition or Prize) Advising and Grants: Martí has contributed to competitive R&D+i projects and innovation initiatives in education. He has supervised doctoral theses, indicating an active role in mentoring graduate students, although specific student names are not listed in the provided data. Labs and Research Teams: He is a key member of the COMBGRAPH research group at UPC, a leading team in combinatorics and graph applications, and participates in the OMGRAPH subgroup dedicated to optimization on graphs, contributing to both theoretical advances and real-world applications.
Oleg Pikhurko is a Professor of Mathematics at the University of Warwick, affiliated with both the Mathematics Institute and DIMAP (the Centre for Discrete Mathematics and its Applications). His office is located in room B2.12 at the University of Warwick in Coventry, UK. Pikhurko has established himself as a prominent researcher in combinatorics with significant contributions to extremal combinatorics, graph theory, and related fields. His research interests span a wide range of topics in discrete mathematics including extremal combinatorics and graph theory, descriptive combinatorics, graph limits, random structures, and algebraic, analytic and probabilistic methods in discrete mathematics. Pikhurko's work bridges theoretical foundations with practical applications, often employing sophisticated mathematical techniques to solve challenging problems in combinatorial structures. The analysis of Pikhurko's recent publications reveals a consistent focus on extremal combinatorics, particularly Turan-type problems, hypergraph theory, and graph limits. His work demonstrates increasing sophistication in handling complex combinatorial structures, with recent papers exploring connections to measure theory, geometry, and coding theory. Notably, his research shows a progression from classical combinatorial problems toward more abstract and interdisciplinary approaches, including measurable versions of combinatorial theorems and applications to high-dimensional spaces. ERC Advanced Grant 'Finite and Descriptive Combinatorics' (2022-2026) Pikhurko has successfully supervised numerous PhD students including Teresa Sousa (2006), David Offner (2009), Zelealem Yilma (2011), Matthew Fitch (2019), and Matteo Mazzamurro (2023). He currently co-advises Irene Gil Fernández and Zhuo Wu, both expected to complete their PhDs in 2025. His research group focuses on 'Finite and Descriptive Combinatorics,' reflecting his dual interest in finite combinatorial structures and their descriptive (measurable) counterparts. The ERC Advanced Grant awarded in 2022 has provided significant funding to support this research program through 2026. Beyond traditional research, Pikhurko founded the Hedgehog Fund, which encourages innovative proofs of mathematical results presented in his lectures. He also maintains an Erdos Lap Number of 2, having sat on the lap of Barbie Freidin (Erdos Lap Number 1) who herself sat on Paul Erdos's lap.
Petr Golovach is a Research Professor at the Department of Informatics, University of Bergen. His research focuses on Discrete Mathematics and Theoretical Computer Science, particularly graph theory, algorithms, parameterized complexity, and clustering. He has held academic positions at Syktyvkar State University (1991–2007), Durham University (2009–2011), and currently teaches advanced courses like Advanced Algorithms Techniques and Enumeration Algorithms at the University of Bergen. His research interests include graph algorithms, parameterized complexity, matroid theory, and algorithmic enumeration. He has organized notable events like the Dagstuhl Seminar 2018 and serves on program committees for STACS, IPEC, and SWAT. Notable contributions include work on hybrid clustering algorithms, graph cuts under matroid constraints, and parameterized tractability of path and cycle problems. He has supervised PhD students like Nidhi Purohit and master’s students including Øyving Stette Haarberg and Andreas Steinvik. His publications span over 200 peer-reviewed papers in top venues such as Journal of the ACM and conferences like SODA and ICALP. His research bridges extremal combinatorics with algorithm design, emphasizing practical and theoretical advancements in graph-based problems.
