Matthew K. Tam is an Associate Professor at the School of Mathematics and Statistics, The University of Melbourne, specializing in Operations Research. He is also an investigator at the Melbourne Centre for Data Science and an associate investigator in the ARC Training Centre OPTIMA. PhD in Mathematics (2016) from University of Newcastle under Jonathan Borwein Postdoctoral research at University of Göttingen with RTG-2088 and Alexander von Humboldt Foundation Junior Professor at University of Göttingen (2017-2020) His research focuses on continuous optimization, monotone operator theory, and variational analysis, with applications in wavelet construction and inverse problems. Key trends include distributed algorithms, resolvent splitting, and convergence analysis for feasibility problems. Discovery Early Career Researcher Award (DECRA) Alexander von Humboldt Fellowship He collaborates with institutions like ANZIAM, Springer, and IEEE, with publications spanning mathematical optimization, harmonic analysis, and computational mathematics. His work emphasizes algorithmic design for complex data systems and real-world applications in imaging and industrial modeling.
Fei He is an Associate Professor at Tsinghua University's School of Software, where he leads the THUFV research lab focused on formal verification and program analysis. His research spans formal methods, automated reasoning, and program verification, with applications in concurrent systems, networking (P4 programs), and probabilistic systems. Education & Employment: PhD from Tsinghua University (2008) Visiting Scholar at Carnegie Mellon University (2010-2011) and Politecnico di Milano (2006-2007) Faculty positions at Tsinghua since 2008 (Assistant Professor 2008-2011, Associate Professor 2011-present) Research: He's developed innovative techniques in SMT solving for concurrency verification, termination analysis, and regression verification. His tools like Deagle have won gold medals at SV-COMP. Current work focuses on probabilistic program verification and network program analysis. Publications: His 80+ publications demonstrate consistent contributions across formal methods (PLDI, OOPSLA, ICSE), networking (NSDI, INFOCOM), and software engineering (TSE, TOSEM), with recent emphasis on data-driven verification and automated invariant inference. Awards: Gold Medals in SV-COMP ConcurrencySafety (2022, 2023, 2025) Best Paper Awards at PPoPP 2022 and SETTA 2022 Advising: Mentors 13 PhD/Master's students in THUFV lab, with graduates joining Huawei, MPI-SP, and research institutions. Secured multiple NSF China grants for trustworthy software research. Service: Associate Editor for Theory of Computing Systems, program committees for PLDI/ICSE/OOPSLA, and former Local Chair for ISSTA 2019.
Paul Horn is a Professor and Associate Chair of Graduate Studies in the Department of Mathematics at the University of Denver, within the College of Natural Sciences and Mathematics. He earned his Ph.D. in Mathematics from the University of California, San Diego (2009), under the supervision of Fan Chung. Prior to joining DU in 2013, he held postdoctoral positions at Emory University and Harvard University. His research focuses on combinatorics, graph theory, and probability, with a particular emphasis on applying probabilistic, algebraic, and geometric methods to analyze networks and graphs. Dr. Horn co-organizes the Rocky Mountains-Great Plains Graduate Research Workshop in Combinatorics (GRWC) and contributes to the graph theory section of the Masamu Advanced Studies Institute in southern Africa. He also serves as the graduate coordinator in the Mathematics Department, overseeing graduate student advising and program administration. His work spans theoretical contributions to graph structure, stochastic processes on networks, and applications in multi-agent systems and sensor networks. Publications highlight his expertise in graph curvature, network robustness, and combinatorial optimization, reflecting his interdisciplinary approach to discrete mathematics and its real-world applications. His research bridges pure and applied mathematics, addressing challenges in algorithm design, network dynamics, and geometric graph theory. Horn’s advising and mentorship activities include guiding graduate and undergraduate students in mathematics, emphasizing hands-on research experiences through workshops and collaborative projects. His contributions to academic leadership and research dissemination are evident through editorial roles and conference organization in combinatorics and graph theory.
Hoon Hong is a Professor in the Department of Mathematics at North Carolina State University (NC State), affiliated with the College of Sciences. He holds editorial roles, including former Editor-in-Chief of the Journal of Symbolic Computation. His primary research focuses on developing mathematical theories, algorithms, and software for solving algebraic constraints in mathematics, science, and engineering. Key areas include computer algebra, computational real algebraic geometry, and quantifier elimination. Education: PhD in Mathematics from The Ohio State University (1990). He leads the Symbolic Computation research group and has advised numerous PhD and Master’s students since 1993. His work emphasizes efficiency in solving algebraic constraints through novel mathematical frameworks and algorithmic improvements, often leveraging structure and approximation techniques. Research Interests: Hong’s research centers on solving algebraic constraints via mathematical theories (e.g., subresultants, discriminants), algorithm design (e.g., parameterization, reparameterization), and software development (e.g., ImUp package). He explores applications in geometric modeling, optimization, and numerical analysis, with a focus on real algebraic geometry and symbolic computation. Notable Contributions: Development of the ImUp package for uniformity-improved curve reparameterization, structural analysis of cyclotomic polynomials, and advancements in quantifier elimination techniques. His work bridges theoretical computer algebra with practical applications in engineering and science. Lab/Team: Active in the Symbolic Computation group at NC State, collaborating on projects related to algebraic algorithms, computational geometry, and mathematical software development.
Ben Goddard is a Professor in the School of Mathematics at the University of Edinburgh. His work bridges applied mathematics with real-world scientific challenges, emphasizing interdisciplinary collaboration across engineering, biology, chemistry, and physics. He earned his PhD at the University of Warwick, later completing his final year at TU Munich following his advisor. His research focuses on mathematical modeling, numerical methods, and asymptotic analysis applied to problems such as quantum chemistry, fluid dynamics, and biological systems. Education: Bachelor’s degree in Mathematics (undergraduate details unspecified) PhD in Mathematical Quantum Chemistry (University of Warwick/TU Munich) Research interests include: Dynamic density functional theory (DFT) for complex fluids and nanoparticles Interfacial phenomena and contact line dynamics Numerical optimization and pseudospectral methods Biological systems modeling (e.g., RNA transcription mechanics) Recent work explores applications like ouzo phase behavior, aerosol droplet stability, and opinion dynamics in social networks. His collaborations span diverse fields, including experimental biology at the Welcome Centre for Cell Biology. He advocates for mathematicians’ role in interdisciplinary problem-solving, emphasizing clear communication and adaptability. Advising and grants: While specific grant details are not listed, his projects reflect significant funding and team-based research. He actively promotes STEM engagement through activities like designing math-themed escape rooms with his spouse, a statistician. Labs/Teams: Collaborates extensively with Edinburgh’s Schools of Engineering, Biology, and Informatics, though no specific lab names are mentioned.
Martin Henz is an Associate Professor at the National University of Singapore , affiliated with the School of Computing and its Department of Computer Science . His academic journey includes an M.Sc. in Computer Science from Stony Brook University (1993) and a Dr.rer.nat. in Computer Science from Saarland University (1997). He has also worked as a Research Scientist at the German Research Centre for Artificial Intelligence. Research Focus : Scalable Experiential Learning, Systems for Teaching/Learning, AI in Education, Programming Languages, Algorithms, and Constraint Programming. Key Projects : Source Academy (immersive programming environment), Deep Teaching (LMS enhancements), and NUS Seafarers (maritime experiential learning). Publications span education technology, programming languages, and sustainable engineering, with recent works focusing on JavaScript-based pedagogy, automated question generation, and electric vehicle conversions. He supervised Rahul Singhal 's PhD, leading to the educational startup Cerebry, and co-founded Workforce Optimizer Pte Ltd with Alan Sevugan. Awards : NUS Annual Digital Education Award (2021) NUS Annual Teaching Excellence Award (2016/17) Fulbright Scholarship (1990) Startup @ Singapore Champion (2001)
Timothy Duff is an Assistant Professor in the Mathematics Department at the University of Missouri's College of Arts and Science. He co-organizes the Math & Data Seminar and specializes in applied computational algebraic geometry for 3D reconstruction in computer vision. Research integrates algebraic geometry with machine learning and numerical analysis to solve geometric problems in imaging systems. Core interests include multi-view geometry, minimal solvers, and certified numerical methods. Recent publications emphasize efficient algorithms for camera calibration, 3D reconstruction, and polynomial system solving. Work frequently develops tools in Macaulay2 and addresses theoretical challenges in computer vision through algebraic frameworks.
Naratip Santitissadeekorn is a Senior Lecturer in Data Assimilation at the School of Mathematics and Physics, University of Surrey, where he is affiliated with the Mathematics at the Interface Group. His work bridges mathematics, data science, and real-world applications in urban planning, crime analysis, and geophysical fluid dynamics. Dr. Santitissadeekorn received his PhD from Clarkson University in 2008, with a dissertation titled "Transport Analysis and Motion Estimation of Dynamical Systems of Time-Series data." His doctoral research was supervised by Professor Erik Bollt. Following his PhD, he completed two significant postdoctoral positions: from 2008-2011 at the University of New South Wales, Sydney, Australia, working with Professor Gary Froyland on numerical techniques for finite-time Lagrangian coherent set identification, with applications to delimiting the polar vortex and Agulhas rings; and from 2011-2014 at the University of North Carolina-Chapel Hill, working with Professor Chris Jones on data assimilation projects. Dr. Santitissadeekorn's research focuses on inverse problems and data assimilation in geophysical fluid dynamics, the applications of Lagrangian Coherent Structures (LCS), and computational ergodic theory. His work combines theoretical mathematics with practical applications, particularly in urban growth modeling and crime analysis. He has developed innovative methods for identifying coherent structures in fluid flows, estimating transition probabilities from spatiotemporal data, and creating data-driven frameworks for urban expansion scenarios. His research demonstrates how mathematical techniques can be applied to solve real-world problems in environmental science, urban planning, and public safety. An analysis of Dr. Santitissadeekorn's recent publications (2020-2023) reveals a strong focus on urban expansion modeling and network analysis. His work on urban growth has evolved from basic cellular automata models to sophisticated frameworks that manage uncertainty through parameter clustering and growth mode identification. His research on Hawkes processes has advanced ensemble-based filtering techniques for analyzing count data in large networks. These publications demonstrate a consistent pattern of applying mathematical rigor to complex spatiotemporal phenomena, with increasing emphasis on data-driven approaches and practical applications. Dr. Santitissadeekorn has made significant contributions to data assimilation methods, particularly through the development of the extended Poisson-Kalman filter (ExPKF) for urban crime modeling. His teaching includes courses in Algebra and Bayesian Statistics, reflecting his expertise in both theoretical and applied mathematics. While specific awards are not mentioned in the available information, his extensive publication record in high-impact journals demonstrates recognition within his field. Dr. Santitissadeekorn's research has practical implications for urban planning and law enforcement. His work on urban expansion models helps planners understand different growth trajectories, while his crime modeling research contributes to improved police patrolling strategies. His interdisciplinary approach, combining mathematics, computer science, and domain-specific knowledge, positions him at the forefront of applying data science to societal challenges.
Daniela Calvetti is the James Wood Williamson Professor in the Department of Mathematics, Applied Mathematics, and Statistics at Case Western Reserve University. Her research focuses on large-scale scientific computing, computational inverse problems, uncertainty quantification, and predictive modeling in neuroscience, metabolism, and cellular physiology. She holds a PhD from the University of North Carolina-Chapel Hill. Her work integrates advanced mathematical techniques with biomedical applications, including brain energy metabolism modeling, MEG/EEG source reconstruction, and computational methods for medical imaging. Notable contributions include Bayesian hierarchical algorithms for inverse problems and interdisciplinary collaborations bridging mathematics with neuroscience and physiology. Recent research highlights include developing sparsity-promoting Bayesian models for tomography, computational frameworks for neuromuscular control variability, and predictive models of disease dynamics like post-pandemic COVID-19 recurrence. Her methodologies emphasize statistically inspired preconditioning and adaptive meshing techniques to enhance computational efficiency in solving complex inverse problems. Dr. Calvetti has published extensively across computational science, inverse problems, and biomedical applications. She leads a research group advancing interdisciplinary computational methods with applications in neuroscience, virology, and metabolic systems.
Standa Živný is a Professor of Computer Science at the University of Oxford and a Fellow and Tutor at Merton College. He has been a faculty member at Oxford since 2013 and was promoted to full professor in 2021. His research spans theoretical computer science and discrete mathematics, with a focus on algorithms, computational complexity, and constraint satisfaction problems (CSPs) in various forms, including optimisation, counting, and approximation. His research interests include the power and limitations of convex relaxations, sparsification, submodularity, and the algebraic and logical foundations of tractability in combinatorial problems. He has made significant contributions to understanding when and why certain problems can or cannot be efficiently solved using linear programming and other algorithmic paradigms. The recent trends in his publications show a deep engagement with approximation algorithms, hardness results, sparsification techniques, and the complexity of counting and promise problems. His work often lies at the intersection of algebra, logic, and optimisation, demonstrating the power of interdisciplinary approaches in theoretical computer science. ERC Consolidator Grant (NAASP, 2022–2027) ERC Starting Grant (PowAlgDO, 2017–2022) Royal Society University Research Fellowship (2013–2021) He actively supervises a large cohort of postdoctoral researchers and students, including PhD candidates, master’s, and undergraduate students. His leadership extends to academic service, where he serves as Editor-in-Chief of the SIAM Journal on Discrete Mathematics and holds editorial and committee positions in major journals and funding bodies. He has organised numerous workshops and research programmes at institutions such as Dagstuhl, the Isaac Newton Institute, and AIM. He is involved in major research initiatives, including a Simons Programme on symmetry in computation and an American Institute of Mathematics SQuARE on relaxations for promise CSPs.
Markus Lange-Hegermann serves as Professor of Mathematics and Data Science at Ostwestfalen-Lippe University of Applied Sciences (TH OWL) since 2018 and holds a board position at the Institute for Industrial Information Technology (inIT). His career bridges academic research and industrial applications, with expertise in translating machine learning theory into practical engineering solutions for automation and manufacturing sectors. His educational foundation includes a Diplom (Master equivalent) in Computer Mathematics from RWTH Aachen University (2004-2008) followed by a Dr. rer. nat. (PhD equivalent) in algorithmic differential algebra (2008-2014). Prior to academia, he gained industry experience at FEV GmbH as an R&D engineer (2014-2017) and P3 automotive GmbH as a Data Science Consultant (2017-2018). Lange-Hegermann's research centers on probabilistic machine learning with distinctive emphasis on physics-informed approaches. He develops Gaussian process methodologies that incorporate differential equations to model time dependencies, uncertainties, and physical constraints in industrial systems. His work enables robust data-based modeling and optimization for cyber-physical systems, with applications spanning predictive maintenance, process control, and quality assurance in manufacturing. Analysis of his 15 most recent publications (2024-2025) reveals consistent innovation in physics-integrated machine learning, particularly using Gaussian processes to solve partial differential equations and optimal control problems. The research demonstrates strong industrial applicability across domains including medical imaging, material science, automotive engineering, and brewing processes, with recurring themes of anomaly detection in time-series data and uncertainty-aware decision making. His scientific contributions have earned significant recognition: Forschungspreis TH OWL (2024) Top reviewer award at NeurIPS (2023) Outstanding reviewer award at NeurIPS (2021) Best poster award at Bosch AI CON (2019) Borchers Plakette for outstanding dissertation (2014) Springorum Denkmünze for outstanding diploma (2009) As chairman of the Data Science study program and vice chairman of undergraduate examination boards, Lange-Hegermann actively shapes academic curricula while supervising graduate theses. His governance roles include serving on professorship search committees at multiple institutions and contributing to examination regulations. He maintains active research funding through collaborations with industrial partners and reviews proposals for initiatives like It's OWL and 3IA Côte d’Azur. Lange-Hegermann leads the Mathematics and Data Sciences research group within inIT, fostering collaboration between theoretical machine learning and industrial automation. He co-founded AICOmmunityOWL and the Informatics Europe working group on Data Analysis and Reporting, while organizing machine learning reading groups and data science hackathons to bridge academic research with industrial problem-solving.
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.
Marco L. Della Vedova is a Senior Lecturer in Applied Artificial Intelligence at Chalmers University of Technology, Sweden. He works in the Vehicle Engineering and Autonomous Systems division within the Department of Mechanics and Maritime Sciences, as part of Prof. Mattias Wahde's research group. Since 2025, he has served as Director of the Data Science and AI master's programme (MPDSC) at Chalmers, where he teaches courses including Introduction to Artificial Intelligence and Digitalization in Sports. Dr. Della Vedova earned his academic foundation at the University of Pavia, Italy, where he completed his BSc (2006), MSc (2009), and PhD (2013) in Computer Engineering. His doctoral research focused on "Real-Time Physical Systems and Electric Load Scheduling" under Prof. Tullio Facchinetti. During his PhD studies, he spent a year at U.C. Berkeley hosted by Prof. Francesco Borrelli at the Model Based Predictive and Distributed Control Lab. His research spans multiple AI domains with a strong emphasis on interpretability. Dr. Della Vedova develops interpretable methods for conversational AI, naturalness evaluation of forests using canopy height models, and geospatial applications. His work bridges theoretical AI with practical societal benefits, particularly in environmental monitoring, transportation systems, and orienteering. He has previously contributed to cloud computing, hate speech detection, and cyber-physical energy systems, demonstrating his interdisciplinary approach to AI research. Dr. Della Vedova's publication record reveals a consistent trajectory of impactful research across multiple domains of artificial intelligence. His recent work shows a strong focus on interpretability in AI systems, with significant contributions to natural language processing, geospatial analysis, and causal inference. The research demonstrates both theoretical depth and practical applications, particularly in environmental monitoring and social media analysis. His methodology often combines traditional machine learning approaches with novel interpretability techniques, creating bridges between complex AI systems and human understanding. Dr. Della Vedova has received several prestigious recognitions for his work: Best PhD thesis award from the Order of the Engineers of Bergamo (2013) Italian champion of Il Cervellone (2012) Top Italian performer in IEEEXtreme 6.0 programming competition (148th overall globally, 2012) Premio Arturo Schena award from Fondazione Credito Valtellinese (2010) With over 50 students supervised through bachelor's and master's theses, Dr. Della Vedova has established himself as a dedicated mentor in the AI community. His current PhD students include Minerva Suvanto working on interpretable NLP and Vivien Lacorre developing AI for railway infrastructure inspection. His supervision spans diverse topics from forest naturalness evaluation to hate speech detection and transportation optimization. Beyond formal supervision, he actively contributes to educational initiatives including serving as Director of Chalmers' Data Science and AI master's program and developing innovative teaching methods that connect theoretical concepts with real-world applications. Dr. Della Vedova is deeply embedded in both academic and professional communities. He leads the Applied Artificial Intelligence research group at Chalmers while maintaining strong connections with European research networks through projects like the ERASMUS+ EUrienteering initiative. His interdisciplinary approach is reflected in collaborations across computer science, environmental science, and social sciences. Notably, he applies his AI expertise to orienteering both as a researcher developing localization methods and as a licensed Event Advisor for the International Orienteering Federation, demonstrating how his professional and personal interests converge in innovative ways.
Mehtaab Sawhney is a Clay Research Fellow and a tenure-track assistant professor at Columbia University specializing in combinatorics, probability, analytic number theory, and theoretical computer science. His academic journey began at the University of Pennsylvania where he enrolled in a Bachelor of Engineering in Computer Science (2016-2017), then continued at MIT where he earned a Bachelor of Science in Mathematics with Minor in Computer Science (2017-2020), followed by a Doctor of Philosophy in Mathematics (2020-2024) under the advisorship of Yufei Zhao. His research spans probabilistic combinatorics, random matrix theory, additive number theory, and theoretical computer science. Sawhney's work bridges theoretical mathematics with computational applications, focusing on random structures, additive combinatorics, and spectral properties of discrete objects. His publications demonstrate a strong interdisciplinary approach that connects number theory with probabilistic methods to solve complex combinatorial problems. The analysis of his publication record reveals a consistent focus on foundational mathematical structures with applications across multiple domains. His work on random graphs, additive bases, and arithmetic progressions has established him as a leading researcher in modern combinatorics, often collaborating with prominent mathematicians including Ashwin Sah, Yufei Zhao, and Vishesh Jain. His research output shows remarkable depth and breadth, with contributions to both pure mathematics and theoretical computer science. 2024 Clay Research Fellow 2021 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student (joint with Ashwin Sah) Churchill Scholar 2020 Best Student Paper STOC 2021 (Joint with Ryan Alweiss, Yang Liu) Best Student Paper ITCS 2022 (Joint with Yang Liu, Ashwin Sah) 2023 Hartley Rogers Jr. Prize 2022 Charles W. and Jennifer C. Johnson Prize (joint with Ashwin Sah) NSF Graduate Fellowship Sawhney has established a robust research program with significant contributions across multiple mathematical disciplines. His frequent collaborations with top researchers worldwide indicate an active and influential research network. While specific advisees aren't listed in available information, his extensive publication record with numerous co-authors suggests active mentorship of junior researchers through collaborative projects.
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.
