Michael Molloy is a Professor in the Department of Computer Science at the University of Toronto, with a cross-appointment to the Department of Computer and Mathematical Sciences at the University of Toronto Scarborough (UTSC). He teaches courses in Discrete Mathematics and the Probabilistic Method, including CSC/MAT A67 and CSC2427/MAT1500 . Research Focus: Graph Theory, Probabilistic Methods, Random Graphs, Constraint Satisfaction Problems, and Markov Chain analysis. His work includes foundational contributions to graph coloring, such as adaptable/conflict coloring and correspondence coloring, and exploring phase transitions in random graphs. He has supervised numerous graduate students, including Lora Hrisch, Jurgen Aliaj, and Hamed Hatami, advancing combinatorial and algorithmic research. Recent publications analyze random graph processes, the freezing threshold for k-colorings, and the resolution complexity of constraint satisfaction problems. These studies intersect theoretical computer science, combinatorics, and probabilistic modeling, often revealing deep structural insights through rigorous mathematical proofs.
Piotr Micek is a professor in the Theoretical Computer Science Department at the Faculty of Mathematics and Computer Science, Jagiellonian University , Kraków, Poland. He is an active researcher in combinatorics, particularly in structural graph theory and poset combinatorics, and maintains extensive international collaborations. University: Jagiellonian University School: Faculty of Mathematics and Computer Science Department: Theoretical Computer Science Department Email: firstname.lastname@gmail.com Office: Room 3151, Łojasiewicza Street 6, 30-348 Kraków Phone: +48 12 664 7594 Duty hours: Wednesdays 11:00–13:00 His main research interests include structural graph theory, combinatorics of partially ordered sets (posets), geometric intersection graphs, graph coloring and choosability, and the entropy compression method. He also works on approximation and on-line algorithms and combinatorial geometry. His work often bridges deep theoretical insights with algorithmic applications. The recent publications highlight a strong focus on graph structure and coloring problems. Key themes include product structure of planar graphs, poset dimension and its relation to height and planarity, weak coloring numbers, and adjacency labelling. His work frequently appears in top venues such as Journal of the ACM , Combinatorica , SIAM Journal on Discrete Mathematics , and SODA, indicating sustained high-impact contributions. Associate Editor, SIAM Journal on Discrete Mathematics (2025–) Former Associate Editor, Discrete Mathematics (2010–2022) Former Associate Editor, Discrete Mathematics & Theoretical Computer Science (2012–2020) He has supervised numerous students at all levels, including PhD candidates Jędrzej Hodor , Marcin Briański , and Michał T. Seweryn , and has led major research grants such as OPUS 24 and WEAVE-UNISONO funded by NCN. He has also been involved in significant trilateral projects with researchers from Belgium and Germany. His recent talks include tutorials on product structure theory and centered colorings, reflecting his leadership in these areas. He actively participates in the academic community, having served on program committees (e.g., SODA 2021, WG 2022) and organized workshops such as the Order & Geometry series. His research is supported by substantial funding, including over 900,000 PLN for current projects.
Alexandr Kostochka is a Professor in the Department of Mathematics at the University of Illinois at Urbana-Champaign, affiliated with the College of Liberal Arts & Sciences. His research focuses on Combinatorics, with specialization in Graph Theory and Hypergraph Theory. He has contributed to topics such as graph coloring, structural properties of graphs, and hypergraph analogs of classical theorems. Recent work includes studies on equitable list coloring of planar graphs, acyclic graph recognition, and hypergraph cycles. No scientific awards are explicitly mentioned in the provided text. His publications span high-impact journals like the Journal of Graph Theory and Combinatorica, reflecting a strong emphasis on theoretical advancements. While no advising or grant details are listed, his research interests align with discrete mathematics and its applications. No specific labs or teams are mentioned in the text.
Benjamin D Seamone is a permanent faculty member in the Mathematics Department at Dawson College (Montreal) and an adjunct research faculty in the Department of Computer Science and Operations Research at Université de Montréal. His research focuses on graph theory, including structural properties of graphs, graph searching, and surveillance. He holds a PhD in Applied Mathematics from Carleton University (2014), an MMath in Combinatorics and Optimization from the University of Waterloo, and a BSc from Canada's #1 undergraduate university. He coordinates Dawson College’s pre-university programs in Science nature and Sciences, informatique et mathématique. Education: PhD in Applied Mathematics, Carleton University (2014), supervised by Brett Stevens. MMath in Combinatorics and Optimization, University of Waterloo, co-supervised by Penny Haxell and Jacques Verstraëte. BSc from #1 undergraduate university in Canada . Research Interests: Seamone’s work centers on graph theory, particularly structural properties of graphs, graph searching algorithms, and network surveillance. His contributions include studies on acyclic colorings, eternal domination, Hamiltonian cycles, and biased combinatorial games. He collaborates widely, with affiliations to CRM and ISM Combinatorics and Algebra groups, and has conducted research at LaBRI (Université de Bordeaux). Publications Trends: His articles span topics from planar graph colorings to combinatorial game thresholds, reflecting a strong focus on discrete mathematics and algorithmic graph theory. Recent work emphasizes eternal domination and Hamiltonian cycle dynamics. Awards and Grants: No formal scientific awards are listed, though he has an Erdős number of 3. His research has been NSERC-funded during his postdoctoral fellowship at Université de Montréal. Lab/Tech Affiliations: Member of CRM and ISM Combinatorics groups, and previously at LaBRI (Bordeaux).
Axel Brandt is an Assistant Professor in the Department of Mathematics, Computer Science, and Data Science at John Carroll University. He holds a Ph.D. in Applied Mathematics from the University of Colorado Denver (2016), an M.S. from Miami University (2012), and a B.S. from Ohio Northern University (2010). His academic journey includes roles as an Assistant Professor at Northern Kentucky University (2018-2022) and a Teaching Postdoctoral Fellow at Davidson College (2016-2018). Brandt's research focuses on graph theory and combinatorics, with a strong emphasis on collaborative projects involving undergraduate students. His work bridges theoretical mathematics and pedagogical innovation, including outreach initiatives to engage K-12 students in mathematical exploration. He is a 2017 Project NExT Fellow and actively contributes to professional organizations like the MAA and Association for Women in Mathematics. In teaching, he emphasizes active learning and standards-based grading, redesigning courses across the curriculum from liberal arts mathematics to advanced topics like graph theory and linear algebra. His outreach activities include leading math clubs, festivals, and classroom visits to inspire young learners. Brandt also prioritizes equity in mathematics education, exploring pathways beyond calculus-centric curricula.
Max Pitz is a Lecturer in Discrete Mathematics at Universität Hamburg, with research focused on infinite graph theory, topological methods, and combinatorial structures. His work develops foundational theorems for infinite graphs and end spaces. Recent publications solve open problems in graph orientation, tree decompositions, and choosability. Research employs set-theoretic and topological approaches to extend combinatorial principles to infinite domains.
Kevin Hendrey is a Research Fellow at the School of Mathematics, Monash University, specializing in graph theory and combinatorics. His research focuses on structural graph theory, treewidth, sparse graphs, and permutation spaces. He has published extensively in top-tier journals such as Combinatorics, Probability and Computing, and The Electronic Journal of Combinatorics. His work bridges theoretical mathematics and algorithmic applications, with recent contributions to the study of graph classes with bounded treewidth, extremal functions for sparse minors, and permutation space covering radii. Collaborations include international researchers in combinatorics and discrete mathematics. No scientific awards or grants are explicitly mentioned in the text, though his publications indicate significant scholarly impact. No advising activities or lab affiliations are detailed here.
Huan Zhou is a prolific researcher affiliated with multiple institutions including the University of Oldenburg , China Three Gorges University , and Wuhan University . His work spans Computer Science , Mathematics , and Engineering disciplines. Key affiliations: Signal Processing Group (Oldenburg), Computer and Information Technology College (China Three Gorges University), Geodesy and Geomatics (Wuhan University) Research interests include: Graph Theory : Resistance spectra, planar graph properties, and spectral analysis Optimization Algorithms : Manta ray foraging, vortex search, and swarm intelligence applications Computer Vision : Road segmentation, stereo matching, and remote sensing image analysis Telecommunications : RIS-assisted wireless systems and beamforming techniques Machine Learning : Anomaly detection, continual learning, and transformer architectures Recent publications demonstrate cross-domain impact in bioinformatics (TriGCN for medicine), network systems (Plover distributed logging), and computational pathology (glioma diagnosis with transformers).
