Dr. James Saunderson is a Senior Lecturer and Director of Education in the Department of Electrical and Computer Systems Engineering at Monash University. He holds a PhD in Electrical Engineering and Computer Science from MIT and has held postdoctoral roles at Caltech and the University of Washington. His expertise spans convex optimization, semidefinite programming, and quantum information theory. Education : PhD in EECS, MIT (2015) MS in EECS, MIT (2011) Bachelor of Engineering (Honours) and Bachelor of Science (Honours), University of Melbourne (2008) Research Interests : Convex optimization, quantum information theory, signal processing, and algorithm design. Focuses on algebraic and geometric aspects of optimization, with applications in engineering and quantum systems. Recent Projects : Exploiting duality in quantum relative entropy optimization Hyperbolic programming and conic optimization Applications in nanotechnology and bioinformatics Teaching : Courses include Control System Design, Signals and Systems, and Optimization for Engineers. Awards : SIAM Optimization Best Paper Prize (2020) Grants and Collaborations : Australian Research Council Discovery Early-Career Research Fellow (2020–2024) Leading projects in quantum optimization and bioengineering applications.
Alexandra Kjuchukova is an Assistant Professor in the Department of Mathematics at the University of Notre Dame, affiliated with the College of Science. Her research focuses on topology with an emphasis on knot theory, branched covers, and geometric structures in low-dimensional topology. She holds a Ph.D. in Mathematics from the University of Pennsylvania, an M.F.A. in Poetry from New York University, and a B.A. in Mathematics from Harvard College. Education: Ph.D., Mathematics, University of Pennsylvania (2015) M.F.A., Poetry, New York University (2010) A.B., Mathematics, Harvard College (2008) Research Interests: Dr. Kjuchukova’s work explores topological branched covers of manifolds, knot invariants, and geometric topology. She investigates relationships between knot groups, bridge numbers, and meridional ranks, with applications to 4-manifold topology and exotic structures. Recent projects include studies on dihedral covers, Coxeter quotients, and the Gordian graph filtration. Publications: Her work appears in journals like Advances in Mathematics , Communications in Analysis and Geometry , and Mathematische Annalen . Key themes include dihedral branched covers, symmetric quotients of knot groups, and the interplay between knot theory and algebraic geometry. Affiliations & Office: Based at 152A Hurley Bldg, she contributes to the Regular Faculty roster in the Notre Dame Mathematics Department. No awards are explicitly listed in her profile.
Søren Galatius is a Visiting Professor at the Department of Mathematical Sciences, University of Copenhagen. His research focuses on algebraic topology with an emphasis on moduli spaces, homology spheres, K-theory, and cobordism categories. He holds a PhD and has established himself as a leading figure in geometric topology and algebraic structures in mathematics. Recent research has explored topics such as general linear groups over finite fields, Pontryagin classes, and tropical geometry applications to moduli spaces. His work bridges pure algebraic topology with geometric and combinatorial methods, contributing foundational insights into modern mathematical frameworks. Key collaborations include projects with Oscar Randal-Williams and Martin Hairer, advancing understanding of cobordism categories and topological field theories. His articles consistently appear in top-tier journals like Annales Scientifiques de l'Ecole Normale Superieure and Inventiones Mathematicae . No scientific awards or grants are explicitly listed in the provided materials, though his publication record speaks to significant academic contributions. No advisee students are documented here.
Professor Stefan Glock is an Assistant Professor of Discrete Mathematics at the University of Passau's Faculty of Computer Science and Mathematics, a position he has held since September 2022. Prior to this appointment, he spent three years as a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, following the completion of his doctorate at the University of Birmingham. Stefan Glock received his mathematics education at Technische Universität Ilmenau from 2009 to 2014, then pursued his PhD at the University of Birmingham, which he completed in 2018. His doctoral dissertation, "Decompositions of Graphs and Hypergraphs," was the runner-up for the Richard-Rado-Preis 2018. Professor Glock's research focuses on discrete mathematical structures, with particular emphasis on their asymptotic properties. His work spans several interconnected fields of combinatorics: Extremal Combinatorics : Investigating the maximum or minimum possible size of mathematical structures satisfying certain properties Probabilistic Combinatorics : Applying probability theory to solve combinatorial problems Graph Theory : Studying properties of graphs and networks Ramsey Theory : Examining conditions under which order must appear in large structures Design Theory : Creating arrangements of elements satisfying specific balance properties Discrete Geometry : Analyzing geometric problems with discrete structures Analysis of Professor Glock's recent publications reveals a consistent focus on solving long-standing open problems in combinatorics using innovative methods that combine probabilistic techniques with structural insights. His work often bridges theoretical mathematics with applications in theoretical computer science, particularly in the analysis of algorithms and network structures. A significant portion of his research addresses fundamental questions about graph and hypergraph decompositions, which have implications for coding theory, cryptography, and network design. Professor Glock has received notable recognition for his contributions to mathematics: Runner-up for the Richard-Rado-Preis 2018 for his dissertation "Decompositions of Graphs and Hypergraphs" Awarded funding through the prestigious DFG Emmy Noether Programme in 2024 for his research group on "the interplay of structure and randomness in mathematics" As a faculty member at the University of Passau, Professor Glock leads the Discrete Mathematics research group and actively collaborates with mathematicians worldwide. He has established a strong research program that has attracted funding for academic visitors and supports multiple research projects. His approach to mathematical problems emphasizes developing new methods that have far-reaching implications beyond the specific problems being solved. Professor Glock's research group at the University of Passau focuses on the interplay between structure and randomness in discrete mathematics. The group maintains active collaborations with leading institutions including ETH Zurich, University of Birmingham, and various research centers across Europe. Through the DFG Emmy Noether Programme funding, his group is expanding its research on combinatorial structures and their applications.
Stefan Hougardy is a Professor at the Research Institute for Discrete Mathematics, part of the Mathematisch-Naturwissenschaftliche Fakultät at the University of Bonn. He is actively engaged in research and teaching, with a focus on discrete mathematics and combinatorial optimization. He contributes to academic governance through roles in examination boards, teaching mentoring, and faculty committees. Stefan Hougardy's research lies at the intersection of theoretical computer science and practical optimization. His primary interests include approximation algorithms, the Traveling Salesman Problem (TSP), Steiner trees, graph theory, and VLSI design automation. He develops efficient algorithms for NP-hard problems and analyzes their theoretical performance guarantees. His work often bridges theory and application, particularly in electronic design automation and mathematical programming. His recent publications demonstrate a strong focus on the complexity and approximation of combinatorial optimization problems. Key themes include the analysis of local search heuristics like k-opt for TSP, edge elimination techniques, fast matching algorithms, and optimal legalization in chip design. His work combines rigorous theoretical analysis with practical implementation and computational experiments. MPC 'Outstanding Paper of the Year' Award 2024 Stefan Hougardy supervises graduate students and leads seminars on discrete mathematics and optimization. He is involved in the Bonn International Graduate School of Mathematics and the Hausdorff Center for Mathematics, contributing to doctoral education and mentoring. While specific grant details are not listed, his sustained research output and leadership roles suggest active funding support. He also contributes to curriculum development and academic quality assurance through various institutional committees. He is affiliated with the Research Institute for Discrete Mathematics at the University of Bonn, a leading center for combinatorial optimization and algorithmic research. The institute is closely linked with the Hausdorff Center for Mathematics, fostering collaboration in discrete and applied mathematics.
David Mount is a Professor in the Department of Computer Science at the University of Maryland, with an additional appointment at the University of Maryland Institute for Advanced Computer Studies (UMIACS). His primary research focus is Computational Geometry, particularly in designing, analyzing, and implementing data structures and algorithms for geometric problems. Applications of his work span image processing , pattern recognition , information retrieval , and computer graphics . He is a Fellow of the ACM and has received the ACM Recognition of Service Award twice. A member of the Algorithms and Theory Group, Mount has authored over 200 publications, many of which are available on Google Scholar, DBLP, and ArXiV. Research Focus Computational Geometry Algorithm Design and Analysis Geometric Data Structures Nearest Neighbor and Range Searching Clustering Algorithms Recent Publications Mount's recent publications (2023-2025) emphasize non-Euclidean geometry (e.g., Hilbert metric), dynamic geometric structures , and approximation algorithms for polytopes, Voronoi diagrams, and Delaunay triangulations. Collaborative works with students and researchers address challenges in kinetic data compression , label tracking , and geometric software development (e.g., Ipelets for polygonal geometry). Professional Activities Editorial Board Member, TheoretiCS (2021-present) Senior Associate Editor, ACM Trans. on Spatial Algorithms and Systems (2013-2020) Program Committee Member, FOCS , ESA , SODA , and other major conferences Awards ACM Fellow ACM Recognition of Service Award (twice)
Dr. Jenna Rajchgot is an Associate Professor in the Department of Mathematics and Statistics at McMaster University, where she has been employed since 2020. Previously, she held positions as an Assistant Professor at the University of Saskatchewan, a Postdoctoral Fellow at the University of Michigan, and a Research Member at the Mathematical Sciences Research Institute (MSRI) in California. Education includes: Ph.D. in Mathematics from Cornell University (2013) M.S. in Mathematics from Cornell University (2010) B.Sc.H in Mathematics and Statistics from Queen's University (2007) Her research focuses on pure mathematics, particularly the intersection of algebraic geometry, commutative algebra, and combinatorics. She investigates algebro-geometric and combinatorial properties of algebraic varieties with large symmetry groups, developing novel techniques for their analysis. Key themes include Schubert varieties, geometric decompositions, combinatorial formulas, and invariants of algebraic structures. Recent publications (2015-2024) demonstrate strong emphasis on combinatorial algebraic geometry, with recurring exploration of Gröbner bases, vertex decompositions, liaison theory, quiver varieties, and Castelnuovo-Mumford regularity. Her work consistently bridges abstract algebra with combinatorial structures across diverse mathematical contexts. Dr. Rajchgot leads the Combinatorial Algebraic Geometry research group at McMaster, comprising three faculty members, postdoctoral researchers, and graduate students ( group link ). This collaborative team investigates problems spanning algebraic combinatorics and geometric methods.
Jonathan Pakianathan is a Professor of Mathematics at the University of Rochester's School of Arts & Sciences, Department of Mathematics. He holds a PhD from Princeton University (1997) and a BS in Mathematics and Physics from Caltech (1992). His research focuses on algebraic topology, cohomology of groups and Lie algebras, geometric combinatorics, and finite fields. He has held leadership roles, including Director of Graduate Studies (2014–2020) and Director of Undergraduate Studies (2003–2010). Notable awards include the Goergen Award for Excellence in Teaching (2014) and the Sloan Foundation Doctoral Dissertation Fellowship (1996). His research explores applications of topology and algebra in discrete geometry, often collaborating with Alex Iosevich and students. Recent work addresses topics like Fuglede's conjecture over finite fields, geometric configurations, and probabilistic methods in combinatorics. His articles frequently intersect harmonic analysis, group theory, and number theory, reflecting interdisciplinary strengths. Education : PhD, Princeton University, 1997 BS in Mathematics and Physics, Caltech, 1992 Awards : Goergen Award for Excellence in Undergraduate Teaching, 2014 Sloan Foundation Doctoral Dissertation Fellowship, 1996 H. J. Ryser Scholarship, 1991 Grants include an NSA Mathematical Sciences Grant (2016–2017, $110,000 total) with A. Iosevich. He advises numerous PhD students, many of whom now hold academic or research positions. His teaching spans undergraduate to graduate courses, including algebra, topology, and financial mathematics. Research groups and collaborations extend to geometric combinatorics, algebraic topology, and applications in physics and data science. Ongoing projects explore topological methods in discrete geometry and probabilistic structures over finite fields.
Max Wardetzky is a Professor at the Institute for Numerical and Applied Mathematics within the Faculty of Mathematics and Computer Science at the University of Göttingen, Germany. His office is located at Lotzestraße 16-18, 37083 Göttingen, and he can be reached via email at wardetzky@math.uni-goettingen.de or by phone at +49 551 39 26778. Professor Wardetzky leads the Discrete Differential Geometry Lab at the University of Göttingen, where he conducts research at the intersection of mathematics, computer science, and geometry processing. His work bridges theoretical foundations with practical applications in computer graphics and scientific computing. His primary research interests include: Applied Geometry Discrete Differential Geometry Numerical Analysis Geometry Processing Physical Simulation Computer Graphics Professor Wardetzky's extensive publication record demonstrates significant contributions to the field of discrete differential geometry and its applications. His work shows a consistent focus on developing mathematically rigorous yet computationally efficient methods for geometric problems. Key trends in his research include the development of discrete analogues of smooth geometric objects, the study of convergence properties between discrete and continuous models, and the application of these methods to problems in computer graphics and physical simulation. Professor Wardetzky has made substantial contributions to the theoretical foundations of discrete differential geometry while maintaining strong connections to practical applications. His work on discrete Laplacians, curvature approximations, and geometric flows has influenced both theoretical mathematics and practical geometry processing algorithms.
Shuhao Fu is a Program Postdoctoral Fellow at the Santa Fe Institute (SFI) researching the intersection of machine learning and cognitive science. He completed his Ph.D. in Psychology at UCLA under advisors Hongjing Lu and Ying Nian Wu, following a B.S. in Computer Science and Mathematics from Hong Kong University of Science and Technology. His research examines human-like relational reasoning in AI systems through cognitive modeling and computational approaches. Research focuses on: Bridging human-machine reasoning gaps via analogical mapping Developing explicit relational representations in vision models Structural cognitive modeling for compositional understanding Multimodal reasoning and scene interpretation Relational knowledge representation in biological and artificial systems Publication trends show concentrated work in computational cognitive science (2021-2025), with evolving focus from visual analogy fundamentals to applications in 3D recognition, social interaction modeling, and mental health diagnostics. Recent work demonstrates increased emphasis on transformer architectures, multimodal integration, and human-AI comparative studies. Professional experience includes research internships at Google X and Mineral.ai, with prior affiliation at Johns Hopkins University's CCVL lab under Alan Yuille. Currently serves as reviewer for ICML, ICCV, and Cognitive Science Society conferences.
Professor Cem Evrendilek is a faculty member in the Department of Computer Engineering at Izmir University of Economics, Turkey, holding the rank of Professor with current active status. His institutional email is cem.evrendilek@ieu.edu.tr. His research spans algorithmic complexity and geometric computation, with primary focus areas including: Computational Geometry (specializing in orthogonal polygon covering problems) Wireless Sensor Network Localization (energy-efficient methods and trilateration) NP-hard Problem Analysis (proving complexity for geometric and network problems) Approximation Algorithms for combinatorial optimization Analysis of his 2008-2018 publications reveals consistent work on geometric covering problems and sensor network localization. Key trends include proving NP-completeness for orthogonal polygon covering variants, developing energy-efficient mobile beacon localization techniques, and analyzing trilateration with noisy measurements. His work frequently intersects computational geometry with practical wireless network applications, demonstrating strong theoretical foundations applied to real-world constraints. Collaborative patterns show frequent co-authorship with Hüseyin Akcan (on localization algorithms), Burkay Genç, and Brahim Hnich (on computational geometry problems).
László Kozma is an Assistant Professor at the Theoretical Computer Science group of the Institute of Computer Science (Freie Universität Berlin). He obtained his PhD from Saarland University under Raimund Seidel, followed by postdoctoral positions at Tel Aviv University and TU Eindhoven. His research focuses on self-adjusting data structures , adaptive algorithms , and combinatorial optimization with applications to problems like the Traveling Salesman Problem, binary search trees, and geometric data structures. Academic Affiliation: Freie Universität Berlin (since 2018) Education: PhD in Computer Science (Saarland University, 2016); postdoc at Tel Aviv University and TU Eindhoven. His work explores the intersection of data structures, combinatorial algorithms, and geometric methods. He has made significant contributions to problems involving pattern-avoidance in inputs, saddlepoint detection , and self-adjusting heaps . Key areas include: Adaptive algorithms for pattern-avoiding inputs Optimal tree and heap structures Geometric and stochastic approaches to optimization Complexity analysis of classical algorithms Recent publications highlight efficient solutions for exponential cut problems (ESA 2025), balanced TSP partitioning (EuroCG 2025), and randomized saddlepoint algorithms (ESA 2024). His research often bridges theory and practice, exemplified by the smooth heap implementation and fun projects like Recursi and Cuckoo Hashing visualization.
David E. Breen is a Professor in the Department of Computer Science within the College of Computing & Informatics (CCI) at Drexel University. He leads the Geometric Biomedical Computing Group and is affiliated with the Metadata Research Center and the Center for Biological Discovery from Big Data. His research spans interdisciplinary domains including biomedical image informatics, geometric modeling, textile modeling, and bio-inspired self-organization algorithms. Education: PhD, Computer and Systems Engineering, Rensselaer Polytechnic Institute MS, Computer and Systems Engineering, Rensselaer Polytechnic Institute BA, Physics, Colgate University His research interests focus on computational methods for biomedical applications, including shape and image analysis for cancer diagnosis, 3D reconstruction of biological tissues, and video analysis of animal behavior. He also investigates geometric modeling techniques for textiles and self-organizing systems. His work integrates computer science with biology, medicine, and engineering to solve complex problems in biomedical computing. The recent publications highlight a strong trend in computational modeling of textiles, biomedical image informatics, and AI-driven data analysis. Key themes include geometric modeling of knitted fabrics, deep learning for medical image classification, agent-based modeling of cancer metastasis, and metadata generation for biological image collections. His work bridges fundamental geometric algorithms with practical applications in healthcare and digital archives. Scientific Awards: No specific awards mentioned in the provided text. Breen has advised numerous students and collaborators across multiple domains, particularly in biomedical computing and textile modeling. His research has been supported through affiliations with major centers and collaborations with institutions such as Johns Hopkins University and the Max Planck Institute. He has been involved in projects related to NSF Center for Visual & Decision Informatics and has contributed to over 100 technical publications. He leads the Geometric Biomedical Computing Group , which conducts research at the intersection of biology, medicine, engineering, and computer science. The group develops algorithms and software for geometry-related computing problems in biomedical applications. Collaborations include the Drexel Integrated Laboratory for Cellular Tissue Engineering, Dr. Dan Marenda's Lab, and Dr. Aleister Saunder's Lab in Drexel's Biology Department.
Wenyu Pan is an Assistant Professor in the Department of Mathematics at the University of Toronto, Faculty of Arts and Science. His research lies at the intersection of dynamical systems, ergodic theory, geometry, discrete subgroups of Lie groups, and spectral theory. His primary research interests include: Dynamical Systems Ergodic Theory Geometry Discrete Subgroups of Lie Groups Spectral Theory His recent publications reveal a strong focus on geometric and dynamical aspects of hyperbolic manifolds, limit sets, mixing properties of geodesic and frame flows, and fractal measures such as Patterson-Sullivan measures. The body of work demonstrates deep engagement with homogeneous dynamics, measure rigidity, and spectral analysis in non-compact geometric settings, particularly those involving cusps and abelian covers. His collaborations with researchers like J. Li, H. Oh, and F. Naud indicate active participation in the global mathematical community. Scientific awards are not mentioned in the provided text. There is no information available on student advising, grants, or teaching responsibilities. No lab or research team is explicitly mentioned, though collaborative work is evident in publication records.
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.
