Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.
Meng He is a Professor in the Faculty of Computer Science at Dalhousie University. He obtained his PhD from the Cheriton School of Computer Science at the University of Waterloo in 2008 and held postdoctoral and research positions at Carleton University and the University of Waterloo before joining Dalhousie. He is affiliated with the Algorithms & Bioinformatics research cluster and is actively recruiting graduate students for master's and PhD studies, as well as supervising honors theses and USRA internships. His research focuses on the design and analysis of efficient algorithms and data structures, particularly in the areas of computational geometry, databases, text retrieval, and bioinformatics. His work often involves developing succinct and dynamic data structures for fundamental problems in graph theory, trees, and geometric data. His recent publications show a strong focus on path and distance queries in various graph types (especially interval graphs and trees), range counting, mode queries, and succinct representations. The research trend emphasizes theoretical foundations combined with practical efficiency, often addressing dynamic and space-constrained scenarios. Alberto Apostolico Best Paper Award of CPM 2017 Dr. He has supervised numerous PhD and master's students and collaborators, frequently co-authoring with researchers such as J. Ian Munro, Travis Gagie, Gonzalo Navarro, and Norbert Zeh. His research has been supported by grants from NSERC and other funding agencies, though specific grant details are not listed in the provided text. He has also contributed significantly to the academic community through editorial work for journals like Computational Geometry - Theory and Applications and Algorithmica , and by organizing major conferences such as CCCG and WADS. He leads a research group focused on algorithms and data structures, fostering collaborations both within Dalhousie and internationally. Future work is likely to continue exploring the theoretical and practical aspects of dynamic and succinct data structures, with applications in large-scale data processing and information retrieval systems.
Adrian Clingher is an Associate Professor in the Department of Mathematics and Statistics at the University of Missouri-St. Louis (UMSL), within the College of Arts and Sciences. His research spans algebraic geometry, mathematical physics, and data science, with particular focus on K3 surfaces, modular forms, and string dualities. PhD in Mathematics, Columbia University (2002) Research interests include: Algebraic Geometry of special surfaces and fibrations Mathematical aspects of string theory dualities Data science and machine learning applications Moduli spaces and lattice polarizations Connections between algebraic geometry and number theory Recent work (2021-2025) examines K3 surfaces with specific automorphism groups, Néron–Severi lattice structures, and isogenies of abelian varieties. Publications often involve collaborations with A. Malmendier, C. Doran, and T. Shaska, exploring geometric structures relevant to theoretical physics. As Graduate Director for UMSL's Master's Program in Mathematics, Clingher oversees both Traditional Mathematics and Data Science emphases. Teaching includes courses like Discrete Structures and Statistical Learning & Modeling (Spring 2025). Contact: clinghera@umsl.edu | Office: ESH 350 | Phone: (314) 516-6338
Haotian Wu is a Senior Lecturer in the School of Mathematics and Statistics at The University of Sydney, where he maintains an active research program in geometric analysis. His academic appointments include membership in the Geometry, Topology and Analysis Research Group, and he has been involved in organizing significant mathematical events including the AMSI Summer School 2025 and the Symposium on Geometric Analysis and Non-linear PDEs. Dr. Wu's educational background includes a PhD in Mathematics from The University of Texas at Austin (2013) and dual Bachelor's degrees in Mathematics and Physics from Lafayette College (2007). His research aligns with the University's Faculty of Science Research Strengths in Understanding the Universe, Fundamental Laws of Nature, and Complex Systems. Wu's research focuses on geometric evolution equations, particularly Ricci flow and mean curvature flow. His work investigates singularity formation, stability properties, and asymptotic behavior in these flows, with significant contributions to understanding Type-II singularities. His research bridges pure mathematics and mathematical physics, with applications to general relativity and geometric analysis. He has developed novel analytical techniques for studying nonlinear partial differential equations arising in geometric contexts. Analysis of Wu's publication record shows a consistent trajectory of high-impact research in geometric analysis, with increasing focus on numerical methods for studying geometric flows in recent years. His work demonstrates strong international collaboration, particularly with researchers in the United States, including notable collaborations with Garfinkle, Isenberg, Knopf, and Zhang. The publications reveal a progression from foundational work on Ricci flow to increasingly sophisticated analyses of mean curvature flow and related geometric evolution equations. Australian Research Council (ARC) Discovery Early Career Researcher Award (DECRA) 2018 for 'Singularity Analysis for Ricci Flow and Mean Curvature Flow' Faculty of Science Faculty Startup Scheme 2023 for 'Elliptic and parabolic problems in geometric analysis' Dr. Wu currently supervises research students including Alexander BEDNAREK (working on General Kahler Ricci Flow) and Tiernan CARTWRIGHT (working on Hölder regularity of solutions to degenerate complex Monge–Ampère equations). He has received multiple research grants supporting his work in geometric analysis. Wu has been actively involved in teaching undergraduate mathematics courses including MATH1021 Calculus of One Variable, MATH2061 Linear Mathematics and Vector Calculus, and specialized courses like MATH3968 Differential Geometry. As an active member of the mathematical community, Wu co-organizes significant research events including the AMSI Summer School 2025 and the International Conference on Nonlinear Partial Differential Equations honoring Professor Neil Trudinger's 80th birthday. His research group focuses on geometric analysis problems with connections to mathematical physics and differential geometry.
Shachar Lovett is a researcher at the University of California, San Diego (UCSD), specializing in computational complexity, combinatorics, and theoretical computer science. His work spans advanced topics in communication complexity, pseudorandomness, and coding theory, often intersecting with problems in additive combinatorics and Boolean function analysis. Education : Not explicitly detailed in the provided text. Research Interests : Lovett's research focuses on computational complexity, particularly in communication and circuit complexity, combinatorial structures like sunflowers and high-dimensional expanders, and the analysis of Boolean functions through Fourier and Gowers norms. His work explores the limits of deterministic vs. randomized computation, the structure of codes over finite fields, and the interplay between additive combinatorics and theoretical computer science. Article Trends : His recent publications address exact vs. approximate representations of Boolean functions, quasipolynomial bounds in combinatorics, hypercontractivity in high-dimensional expanders, and advancements in the log-rank conjecture. These works emphasize connections between computational complexity, discrete mathematics, and pseudorandomness, often yielding improved bounds or novel frameworks for understanding Boolean function behavior. Scientific Awards : No specific awards or honors were mentioned in the provided text. Advising and Collaborations : Lovett collaborates extensively with researchers like Hamed Hatami, Kaave Hosseini, and Jiapeng Zhang, contributing to fields such as non-malleable codes, matrix multiplication algorithms, and communication complexity. No formal student advising details were provided.
Guangbo Xu is an Associate Professor in the Department of Mathematics at Rutgers University. He is actively involved in research within symplectic geometry and related fields. Affiliation: Department of Mathematics, Rutgers University Contact: gx49@math.rutgers.edu Research Interests: His work focuses on advanced topics in symplectic geometry, gauge theory, and quantum field theory, addressing problems in Floer homology, Gromov-Witten invariants, and moduli spaces of holomorphic curves. Recent Publications: Guangbo Xu's recent publications explore the intersection of symplectic geometry with theoretical physics, particularly the Gauged Linear Sigma Model (GLSM), virtual cycles, and cohomological splitting. His studies also delve into gluing techniques for vortices and the adiabatic limit of geometric equations. Grants: He is currently supported by an NSF grant (DMS-2345030) for his research. Organizational Roles: Xu co-organizes the Rutgers Symplectic Seminar and contributes to symplectic summer school events.
Xavier Darzacq is a Professor of Molecular Therapeutics at the University of California, Berkeley, holding the Edward E. Penhoet Distinguished Endowed Chair in Global Health and Infectious Disease. His research at the intersection of molecular biology and biophysics focuses on understanding how nuclear organization governs transcription regulation during cellular differentiation. Research Highlights: Investigates transcriptional control via non-canonical mediator complexes in fibroblast-to-myofibroblast differentiation. Develops advanced imaging techniques (single-molecule tracking, 3D FISH) to study transcription factor mobility and chromatin interactions. Proposes biophysical models where protein diffusion in the nucleus is guided by DNA/chromatin networks. Technological Innovations: Pioneered methods for single-molecule tracking and super-resolution imaging, enabling nanoscale and millisecond-resolution analysis of nuclear processes. Collaborates with experts in biophysics, chemistry, and imaging to integrate multidisciplinary approaches. Scientific Awards: Edward E. Penhoet Distinguished Endowed Chair (Global Health and Infectious Disease) Nature Structural & Molecular Biology – Selected Article of the Month (2007) His lab (http://tjian-darzacq.mcb.berkeley.edu/) explores how nuclear architecture influences gene expression, particularly in wound healing contexts. Future work aims to leverage advancements in microscopy and genome editing to unravel transcriptional rules in living organisms.
Sophie H. Yu is an Assistant Professor of Operations, Information and Decisions at the Wharton School of Business, University of Pennsylvania. She completed her postdoctoral work in the Department of Management Science and Engineering at Stanford University before joining Wharton. Her academic journey includes a Ph.D. in Decision Sciences from the Fuqua School of Business at Duke University (2023), an M.S. in statistical and economic modeling from Duke University (2017), and a B.S. in Economics from Renmin University of China (2015). Ph.D. in Decision Sciences, Fuqua School of Business, Duke University (2023) M.S. in Statistical and Economic Modeling, Duke University (2017) B.S. in Economics, Renmin University of China (2015) Sophie's research focuses on high-dimensional statistics, algorithm design, and performance evaluation in large-scale networks and stochastic systems . Her work draws inspiration from real-world business, engineering, and natural sciences problems that can be modeled into large and complex networks. She has explored fundamental limits and efficient algorithms on graph matching, online platform policy design with bounded regret, and data confidentiality protection. Her research spans the intersection of operations research, applied probability, statistics, and computer science, with particular emphasis on network science and information theory. Sophie's publications demonstrate a strong focus on matching problems in networks, with significant contributions to understanding random graph matching, network correlation testing, and online matching algorithms. Her work shows a progression from fundamental theoretical questions to practical applications in resource allocation and market design. Recent papers indicate increasing focus on practical implementations of theoretical concepts in real-world matching markets. Thomas M. Cover Dissertation Award from IEEE Information Theory Society (2024) Best Dissertation Award from Fuqua George Nicholson Student Paper Competition finalist, INFORMS 2022 Sophie has been actively involved in academic service, presenting her work at numerous prestigious institutions including University of Texas at Austin, University of Toronto, London School of Business, and MIT. She has taught graduate courses in decision modeling and served as a teaching assistant for various statistics and operations courses during her doctoral studies at Duke University. Her research has been supported through academic appointments and likely research grants related to her work in network science and matching algorithms.
Ulrich Meyer is a Professor at the Institute for Computer Science at Goethe University Frankfurt. He serves as a prominent researcher in algorithms for big data, with extensive contributions to parallel and external-memory graph algorithms. His work spans theoretical foundations and practical implementations for processing large-scale data sets. Spokesperson of the DFG priority program (SPP 1736) on Algorithms for Big Data in Germany SEA23 Symposium on Experimental Algorithms, Steering Committee Chair ALENEX23 Algorithm Engineering and Experiments, Program Committee Member Professor Meyer's research interests focus on the theoretical and experimental aspects of processing large data sets on advanced computational models. His work particularly emphasizes parallel and external-memory graph algorithms, with recent focus on efficient large-scale network generation according to various stochastic models. His research has produced significant contributions including the parallel Delta-Stepping algorithm (which received the ESA Test of Time Award in 2019) and the first BFS approach with sublinear I/O. He has also explored more specialized topics like energy-efficient sorting (with records in the JouleSort competition 2009/10 and the Germany Land of Ideas Award) and fragile computing (which earned him a best-paper award at ESA 2019). His recent publications demonstrate a strong focus on graph algorithms, network generation, and parallel computing techniques. The research trends show consistent advancement in scalable algorithms for massive graphs, with particular emphasis on efficient sampling methods, shortcutting techniques, and communication-free distributed approaches. His work bridges theoretical computer science with practical engineering considerations for real-world big data applications. ESA Test of Time Award 2019 for Parallel Delta-Stepping algorithm Records in the JouleSort competition 2009/10 Germany Land of Ideas Award Best-paper award at ESA 2019 for fragile computing research Professor Meyer has made substantial contributions to the academic community through his leadership in the DFG priority program on Algorithms for Big Data, which has fostered significant research collaborations across Germany. His extensive publication record in top venues demonstrates sustained research productivity and impact in the algorithms community. While specific grant details aren't provided in the text, his role as spokesperson for a major DFG priority program indicates substantial research funding and leadership responsibilities. His work appears to be conducted within collaborative research environments focused on algorithm engineering and experimental evaluation. His research appears to be conducted within the Institute for Computer Science at Goethe University Frankfurt, likely involving collaborations with other researchers in the Algorithms for Big Data priority program. The extensive list of co-authored publications suggests active participation in research teams focused on parallel algorithms, graph processing, and network generation.
Patrick Desrosiers serves as an Adjunct Professor in the Department of Physics, Physical Engineering and Optics within Université Laval's Faculty of Science and Engineering, while conducting neuroscience research at the CERVO Brain Research Center. He co-directs Dynamica, a multidisciplinary complex systems research group, and participates in UNIQUE (neuroscience-AI integration) and CIMMUL (mathematical modeling applications). His academic training spans physics and mathematics at Université Laval, the University of Melbourne, and CEA-Saclay. Dr. Desrosiers' research centers on mathematical and computational neuroscience , with signature contributions in dimensionality reduction and network resilience analysis . His work bridges biological and artificial neural networks , zebrafish brain mapping , and neurovascular coupling using advanced techniques from spectral graph theory , random matrix theory , and dynamical systems . Current investigations focus on neural decoding under chronic stress and structural-functional relationships in brain networks. Analysis of his 2023-2025 publications reveals three dominant trajectories: (1) Low-dimensional representations for predicting cognitive decline and neural dynamics, (2) Network reconstruction methodologies applied to neuroscience and biodiversity, and (3) Development of computational tools like NeuroTorch for neural data analysis. His work consistently integrates mathematical rigor with biological relevance across species and scales. His recognition includes: Professeur étoile prize for exceptional teaching (Faculty of Science and Engineering, Université Laval, 2018) As Dynamica co-director, he mentors a research team comprising Antoine Légaré, Arthur Légaré, Benjamin Claveau, Jordan Charest, Marziyeh Pourmousavi, Pierre-Luc Larouche, Vincent Savard, Vincent Thibeault, and Zahra Yazdani. His collaborative framework connects physics, mathematics, and neuroscience to address fundamental questions in neural network organization, with funding evident through sustained publication output and lab operations. Dynamica Lab ( https://dynamicalab.github.io/ ) serves as the operational hub for his interdisciplinary research, maintaining active collaboration with CERVO Brain Research Center and international institutions.
Pavel Galashin is an Associate Professor in the Department of Mathematics at the University of California, Los Angeles, where he joined in 2019 after completing his PhD at MIT under Alex Postnikov. His research focuses on algebraic combinatorics with emphasis on total positivity and cluster algebras. His primary research interests include algebraic combinatorics, total positivity, cluster algebras, amplituhedra, plabic graphs, positroids, and connections to mathematical physics. His work bridges combinatorics with algebraic geometry, representation theory, and theoretical physics, particularly in scattering amplitudes and integrable systems. Galashin's recent publications reveal a strong focus on braid varieties, positroid varieties, and their connections to cluster structures. His research shows significant interdisciplinary impact across combinatorics, algebraic geometry, and mathematical physics, with particular attention to geometric structures in scattering amplitudes and connections to knot theory. He has received an Alfred P. Sloan Research Fellowship and NSF funding through grants DMS-1954121 and DMS-2046915 (CAREER). Galashin advises multiple PhD students including Matthew Tyler, Ariana Chin, Thomas Martinez, and Olha Shevchenko, and co-mentors postdocs such as Terrence George and Colleen Robichaux. Together with Anton Bernshteyn, Terrence George, Igor Pak, and Colleen Robichaux, he organizes the UCLA Combinatorics Forum.
Leila De Floriani is a Professor at the University of Maryland, with appointments in the Department of Geographical Sciences and the University of Maryland Institute for Advanced Computer Studies (UMIACS). She previously served as a professor at the University of Genova (Italy) since 1990, where she developed Italy's first undergraduate and graduate curricula in computer graphics and directed the Ph.D. program in Computer Science for eight years. Her professional activities include serving as the 2020 President of the IEEE Computer Society and currently as IEEE Division VIII Director for 2023-24. Professor De Floriani's research spans geometric modeling, data visualization, spatial data representation and processing, computer graphics, shape analysis, and topological data analysis. Her work focuses on developing mathematical models and algorithms for representing, analyzing, and visualizing complex spatial data, particularly through hierarchical models, mesh-based representations, and topology-based approaches. Her research group, the GeoVis group, investigates applications in terrain modeling, environmental data analysis, and forest structure mapping using LiDAR technology. Analysis of her recent publications reveals a strong focus on terrain representation and processing, with increasing emphasis on topological data analysis, machine learning integration, and efficient algorithms for large-scale spatial data. Her work bridges theoretical foundations in computational topology with practical applications in geospatial sciences, demonstrating consistent innovation in data structures and visualization techniques. Scientific Awards & Recognitions Fellow of IEEE (2016) for contributions to geometric modeling and scientific visualization Fellow of International Association for Pattern Recognition (IAPR) (1998) for contributions to geometric modeling and image analysis Fellow of Eurographics Association (2020) for outstanding contributions to computer graphics and visualization Pioneer of Solid Modeling Association (2017) for seminal work in solid and feature-based modeling Inducted Member of IEEE Visualization Academy (2020) IEEE Computer Society Golden Medal Award (2018) Inducted Member of IEEE Honor Society Eta Kappa Nu (2019) Multiple best paper awards at major conferences including Shape Modeling International (2015), IEEE/EG Symposium on Volume and Point-Based Graphics (2008), and ACM SIGSPATIAL (2008) Professor De Floriani has successfully advised numerous PhD students including Xin Xu, Yunting Song, and Noel Dyer, whose recent dissertations focused on topology-based individual tree mapping, efficient terrain analysis, and bathymetric data visualization respectively. Her research has been funded by prestigious agencies including the National Science Foundation, NASA, and the European Commission. As the leader of the UMD GeoVis group, she oversees a research program that develops open-source tools for spatial data analysis available on GitHub, with current projects focusing on forest point cloud processing and topology-based geospatial data visualization. The GeoVis group, affiliated with the Department of Geographical Sciences, UMIACS, and the Center for Geospatial Information Sciences, maintains a strong collaborative environment with ongoing projects in geometric modeling, spatial data structures, topology-based machine learning, and mesh-based terrain modeling. The group has received recent funding from NASA's HPOSS program for developing an open-source library for forest point cloud processing based on topological data analysis.
Francesca Maria Ceragioli is an Associate Professor in the Department of Mathematical Sciences at Politecnico di Torino, specializing in Mathematical Analysis (MATH-03/A). She serves as a member of both the College of Mathematical Engineering and the College of Environmental and Land Engineering. Her research focuses on discontinuous ordinary differential equations, with specific lines of inquiry in the analysis and control of discontinuous differential equations and their application to social system models. Her expertise is recognized through classification under ERC sectors PE1_19 (Control theory and optimization) and PE1_10 (ODE and dynamical systems). Dr. Ceragioli has been consistently teaching Mathematics of Systems and Control for the Mathematical Engineering Master's program since 2019/2020 through the upcoming 2025/26 academic year, in addition to foundational courses like Mathematical Analysis I and Mathematics Laboratory for Aerospace and Computer Engineering programs. Her publications reveal a dual focus on theoretical research in control theory and practical mathematics education. The 2025 publications show particular emphasis on translating complex mathematical concepts into accessible educational materials through hands-on projects, while maintaining rigorous theoretical work in opinion dynamics and network systems. Mentoring Polito Project (M2P) badge issued June 11, 2024 She is currently participating in the MO.MO. research project (2025-2026) titled 'Taking time to enjoy ourselves together' as a member of the research group, demonstrating ongoing active research engagement.
Osamu Iyama is a Professor at the Graduate School of Mathematical Sciences, University of Tokyo. He leads research in algebra and representation theory while mentoring PhD and Master's students. Previously affiliated with Nagoya University, he maintains editorial roles for Mathematische Zeitschrift , Nagoya Mathematical Journal , and other journals. His research focuses on representation theory of orders, categorical structures (module categories, derived categories, cluster categories), and applications to cluster algebras and noncommutative resolutions of singularities. Key areas include higher-dimensional Auslander-Reiten theory, tilting theory, and Cohen-Macaulay representations. His recent publications (2016–2020) explore triangulated categories, noncommutative resolutions, Auslander-Gorenstein algebras, and combinatorial aspects of representation theory, demonstrating consistent innovation in homological algebra and singularity theory. Awards and honors: 2019 Inoue Prize for Science 2011 JSPS Prize 2010 Spring Prize of the Mathematical Society of Japan 2008 Algebra Prize of the Mathematical Society of Japan 2007 ICRA Award 2001 Takebe Katahiro Prize He leads an active research group, organizes international conferences (e.g., Oberwolfach workshops, China-Japan-Korea symposia), and directs the Tokyo-Nagoya algebra seminar.
Nansen Petrosyan is a Professor at the University of Southampton's Mathematical Sciences department. He serves as the Programme Lead for single honours programmes in Mathematics. His academic career includes a position as a lecturer at the University of Southampton since 2013, following a postdoctoral fellowship with the Flemish Science Foundation (FWO) at the University of Leuven, Belgium. Professor Petrosyan's research focuses on: Geometric Group Theory Topology Algebra Geometry His current research explores group theoretic Dehn fillings, L^2-Betti numbers, L-infinity cohomology, cohomological characterizations of non-positive curvature, and splittings of groups. His work demonstrates a strong connection between geometric structures and algebraic properties of groups. Professor Petrosyan's recent publications show a consistent focus on geometric aspects of group theory and topology, with particular emphasis on theoretical investigations in manifold theory and geometric structures. His research output has been consistently strong over the past decade with multiple publications in high-impact journals. His scientific achievements have been recognized with: The Emil Artin Junior Prize in Mathematics (2008) Professor Petrosyan is actively involved in academic supervision and currently mentors PhD students Briony Helen Eldridge and Harry Margaret John Iveson in the Mathematical Sciences program. He has secured research funding including an EPSRC First Grant project. Within the department, he teaches the fourth year module Hyperbolic Geometry and Foundation Year Mathematics B, demonstrating his commitment to both advanced and foundational mathematical education.
