Daniel Horsley is an Associate Professor and ARC Future Fellow at the School of Mathematical Sciences, Monash University. His research focuses on combinatorial designs and edge decomposition of graphs, with notable contributions to extremal graph theory, Zarankiewicz problems, and graph decomposition theorems. Current Role: ARC Future Fellow, Associate Professor Affiliation: School of Mathematical Sciences, Monash University Active Projects: 'The Zarankiewicz problem through linear hypergraphs and designs' (2022–2025), 'Edge decomposition of dense graphs' (2017–2022), and more Research interests span combinatorial designs, graph decomposition, and extremal combinatorics. His work emphasizes theoretical advancements in design theory, with applications in discrete mathematics and optimization. Recent articles address semi-inducibility, Zarankiewicz numbers, and embedding partial designs, reflecting his expertise in structural and extremal combinatorics. Key awards include the ARC Future Fellowship. His research outputs include over 57 publications in journals like Journal of Graph Theory , SIAM Journal on Discrete Mathematics , and European Journal of Combinatorics . Grant projects include collaborations with ARC, University of Queensland, and University of Melbourne, focusing on Steiner systems, compressed sensing, and combinatorial structure analysis. Advising PhD students and mentoring researchers in discrete mathematics and combinatorial design theory.
Ben Li is an Associate Professor in the Department of Computer Science at the University of Manitoba, Faculty of Science. His research focuses on combinatorics and theoretical computer science, including combinatorial design theory (e.g., Steiner triple systems, BIBDs, difference sets), graph theory, and algorithm design for combinatorial optimization problems. He also explores approximation algorithms for NP-Hard problems and subclasses of such problems with polynomial solutions. Dr. Li teaches a wide range of courses, including COMP 1010 (Introduction to Computer Science), COMP 2080 (Analysis of Algorithms), and advanced graduate courses like COMP 7720 on approximation algorithms and combinatorial optimization. His academic contributions span both theoretical computer science and interdisciplinary archaeological studies, as reflected in his publications. His recent work includes studies on ostrich eggshell beads' role in prehistoric social networks, archaeological site analysis in southern Africa, and medical education reforms in Canada. While his primary research aligns with computer science theory, his published articles also highlight interdisciplinary interests in anthropology, archaeology, and healthcare policy.
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.
Jozsef Balogh is a Professor in the Department of Mathematics at the University of Illinois, holding the J. Andrew and Susan Langan Scholar title. He is affiliated with the College of Liberal Arts & Sciences and focuses on Combinatorics, Graph Theory, and related areas. His research emphasizes extremal combinatorics, additive combinatorics, and the development of the container method for hypergraphs, which has applications in Ramsey theory and theoretical computer science. Education: Ph.D. in Mathematics from the University of Memphis (2001). He has held prestigious fellowships including the Simons Fellowship (2013–2014) and Marie Curie Fellowship (2013–2017), and received the George Pólya Prize in Combinatorics (2016) from SIAM. His NSF CAREER Award (2008–2013) supported work in modern combinatorics. Research highlights include resolving conjectures on maximal triangle-free graphs, maximal sum-free sets, and union-free sets using the container theorem. His work bridges probabilistic methods and combinatorial structures, influencing areas like discrete geometry and algorithm design. Recent publications address extremal graph problems, Ramsey-type tilings, and probabilistic thresholds in combinatorial systems. Awards and grants reflect his impactful contributions, while his advising and mentorship are central to his academic role. Ongoing research focuses on expanding applications of container methods and exploring new frontiers in extremal combinatorics.
