Francisco Santos is a researcher with a focus on Discrete Geometry, Combinatorics, and Computational Geometry. His work bridges theoretical foundations with applications in machine learning and data science. Affiliated with Oak Ridge National Lab, he collaborates internationally on interdisciplinary projects. Research interests include polytopes, geometric algorithms, optimization, and fair machine learning. Publications span high-impact venues like Discrete & Computational Geometry and SIAM Journal on Applied Algebra and Geometry . Notable contributions include studies on multiassociahedra, associahedra minimization, and algorithmic geometry problems. Recent work explores fair cross-network node classification and LoRa sensor networks for environmental monitoring.
Florian T. Pokorny is an Associate Professor in Machine Learning at the Division of Robotics, Perception and Learning (RPL), Department of Electrical Engineering and Computer Science (EECS), KTH Royal Institute of Technology. He coordinates research projects such as the Horizon Europe-funded SoftEnable and the WASP-funded Intelligent Cloud Robotics for Real-Time Manipulation at Scale . His research focuses on data-driven methods for robotic manipulation, including transfer learning, cloud robotics, and caging-based manipulation of rigid and deformable objects. Education: PhD in Mathematics, University of Edinburgh (supervisor: Michael Singer) MSc in Advanced Study in Mathematics (Part III), University of Cambridge BSc in Mathematics, University of Edinburgh Research Interests: His work emphasizes scalable robotic manipulation, leveraging deep learning and geometric/topological methods. Key areas include training data requirements, transfer learning, and cloud robotics paradigms for manipulation at scale. Recent projects explore energy margin analysis, caging-guided morphology optimization, and robust policy learning. Publications: His recent work spans topics like caging-based manipulation, federated learning, and cloud robotics infrastructure. Notable contributions include CageCoOpt (manipulation robustness), CloudGripper (open-source testbed), and RealCraft (zero-shot video editing). Awards & Grants: Funded by WASP, Horizon Europe, and the Knut and Alice Wallenberg Foundation. His group hosts the CloudGripper platform and collaborates on benchmarks like DLO@Scale. Advising & Labs: Supervises multiple PhD students and research engineers. Alumni include Robert Gieselmann (Amazon Robotics), Yiannis Karayiannidis (Chalmers University), and Anastasiia Varava (Postdoc at KTH). Active in organizing workshops like RoDGE (IROS 2025) and ICRA 2025 robotics learning events.
Mikhail Tamm is a Senior Research Fellow at Tallinn University's School of Digital Technologies, where he applies statistical physics and complex network theories to human-generated data. His academic journey includes positions as Associate Professor at Moscow State University and Higher School of Economics, Lecturer at Moscow Physical Technical Institute, and postdoctoral research at Université Paris-Sud. He holds a PhD in Physics from Moscow State University (2002), supervised by Igor Erukhimovich. Research interests focus on interdisciplinary applications of physics methodologies: Statistical physics approaches to social/cultural data analysis Complex network theory for transport patterns and psycholinguistics Dimensional reduction techniques for human activity patterns Modeling abrupt transitions in social systems Publication analysis reveals consistent focus on network science applications across physics, biology, and cultural studies, with recent emphasis on hyperbolic networks, language coexistence models, and computational cultural analytics. Methodological innovations in statistical mechanics form the core of his interdisciplinary work. Current research projects include: Principal Investigator: 'Learning Processes in Language Dynamics' (Estonian Research Council, 2024-2025) Team member: 'Cultural Data Analytics Open Lab' (Tallinn University, 2024-2027) Team member: 'Learning Processes in Language Dynamics' (PRG1059, 2021-2025) Previous projects include the EU-funded 'Cultural Data Analytics' (2019-2024) and 'Kinokroonika Exploration Project' (2021-2022).
Richard Evan Schwartz is the Chancellor's Professor of Mathematics at Brown University, where he has been a faculty member since 2005, becoming Chancellor's Professor in 2010. His research spans several areas of geometry and dynamical systems, with particular focus on billiards, projective geometry, and topological phenomena. Dr. Schwartz received his B.S. in Mathematics from UCLA in 1987 and his Ph.D. from Princeton University in 1991. Prior to joining Brown, he held positions at various institutions including the University of Maryland, where he served as Associate Professor (1997-2000), Professor (2000-2004), and Ruth Davis Professor (2004-2005). His research interests include mathematical billiards, particularly outer billiards; projective geometry and the pentagram map; CR geometry; and the geometry of paper folding including Moebius bands and tori. He approaches these topics with a unique blend of theoretical analysis, computational experimentation, and visual intuition. His work often reveals surprising connections between seemingly disparate mathematical areas and frequently produces beautiful geometric patterns and structures. Dr. Schwartz's recent publications demonstrate a continued focus on geometric optimization problems, particularly in paper folding geometry. His work on optimal Moebius bands represents a significant breakthrough in a problem that had remained unsolved for decades. He has also made substantial contributions to understanding the pentagram map and its connections to integrable systems, as well as exploring connections between continued fractions, graph theory, and projective geometry. National Merit Scholar (1984-7) NSF Graduate Fellow (1987-90) Sloan Dissertation Fellow (1991) NSF Postdoctoral Fellow (1993-5) Sloan Research Fellow (1996-8) ICM Speaker (2002 and 2022) Guggenheim Fellow (2003) IAS member (2003-4 and 2020-1) Clay Research Scholar (2009) Multiple Simons Sabbatical Fellowships (2012-3, 2016-7, 2020-1, 2024-5) Dr. Schwartz has mentored numerous students through his research and teaching activities. His current research is supported by NSF grant DMS-2102802 and a Mercator Fellowship. He serves as an organizer for the Brown University Geometry/Topology Seminar, fostering academic exchange in his field. His work bridges pure mathematics with creative visualization, as evidenced by his development of numerous interactive Java programs to accompany his research. He has also authored several expository works and popular mathematics books including 'You Can Count on Monsters,' 'Really Big Numbers,' and 'Gallery of the Infinite,' making complex mathematical concepts accessible to broader audiences.
Marc-Antoine Weisser is a researcher with a focus on network optimization, algorithm design, and graph theory. His work spans telecommunications, electrical networks, and computational complexity. He has contributed to studies on inter-domain network hierarchies, optical network optimization, and combinatorial problems such as Steiner trees and bin packing. Weisser's research often involves developing polynomial and approximation algorithms for real-world network challenges. Key research areas: Network topology analysis, algorithmic design for resource allocation, and optimization in electrical/optical networks His publications highlight contributions to congestion avoidance mechanisms, optical ring networks, and inter-domain routing architectures. Weisser collaborates frequently with institutions like the University of ... [university name missing in source text].
Professor Neshan Wickramasekera is affiliated with the University of Cambridge, where he serves as Professor of Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS) under the School of the Physical Sciences. His research focuses on geometric measure theory, partial differential equations, and differential geometry, with particular emphasis on minimal surfaces and prescribed curvature problems. Research Interests: Geometric measure theory, partial differential equations, differential geometry, calculus of variations. His publications address foundational problems in geometric analysis, including regularity, compactness, and singularity structures of minimal and CMC hypersurfaces. Recent work explores varifolds, Allen-Cahn equations, and branch point singularities.
Jin-Yi Cai is a Professor in the Computer Sciences Department at the University of Wisconsin - Madison. He holds the Rajiv & Ritu Batra Chair in Computer Science and has authored over 100 research papers. His academic journey includes a Ph.D. from Cornell University in 1986 and faculty positions at Yale, Princeton, and SUNY Buffalo. Education: Fudan University (class of 77), Cornell University (Ph.D., 1986) Previous Institutions: Yale University (1986-1989), Princeton University (1989-1993), SUNY Buffalo (1993-2000) His research focuses on computational complexity theory, algorithms, and theoretical computer science. He has explored lattice problems, graph homomorphisms, and holographic algorithms. The 15 most recent publications highlight advancements in constraint satisfaction problems, planar graphs, and dichotomy theorems, reflecting his deep engagement with complexity classification. Scientific Awards: Presidential Young Investigator Award (1990) Alfred P. Sloan Fellowship (1994) Guggenheim Fellowship (1998) Morningside Silver Medal (2004) Humboldt Research Award ACM Fellow AAAS Fellow AMS Fellow Foreign Member of Academia Europaea Gödel Prize Fulkerson Prize He serves as Editor for several journals, including the Journal of Computer and Systems Sciences and Computational Complexity . His work bridges foundational theoretical research with practical algorithmic applications, influencing both academia and industry.
Marthe Bonamy is a CNRS researcher at LaBRI (Laboratoire Bordelais de Recherche en Informatique) in Bordeaux, France, holding a permanent research position since December 1, 2015. She is a member of the CombAlgo team, head of the Graphes et Optimisation research group, and also a member of the AlgoDist group. Her research focuses on combinatorics and graph theory, particularly planar graphs, algorithms, graph decompositions, and reconfiguration problems. Dr. Bonamy is actively involved in the academic community, serving as vice-Editor-in-chief of the European Journal of Combinatorics since January 2021, a member of the Board of Editors of Discrete Mathematics since January 2021, an editor of Innovations in Graph Theory since August 2023, and an associate editor of the SIAM Journal of Discrete Mathematics since January 2024. She is also part of the scientific board of the GT COA and the steering committee of STACS. Her research interests span various aspects of combinatorics and graph theory, with a particular emphasis on structural graph properties, coloring problems, and reconfiguration processes. She has made significant contributions to understanding graph recoloring, Kempe changes, and various decomposition techniques for graphs. Her work often bridges theoretical computer science and pure mathematics, providing both theoretical insights and algorithmic applications. Dr. Bonamy has supervised numerous PhD students, both currently and in the past, demonstrating her commitment to mentoring the next generation of researchers in combinatorics and graph theory. Her students have gone on to academic positions and industry roles, reflecting the breadth of applicability of their research. She has received recognition through prestigious editorial positions and research grants, including her current involvement in the ANR Project ENEDISC (2024-2027) and previous leadership of multiple research projects. Dr. Bonamy maintains an active research agenda with numerous publications in top-tier journals and conferences, reflecting her standing as a leading researcher in combinatorics and graph theory.
Alexander Omelchenko serves as Professor of Mathematics and Dean of the School of Computer Science & Engineering at Constructor University in Bremen, Germany. His academic leadership extends to prior roles including Dean at the Higher School of Economics and Vice-Rector positions at the Academic University of the Russian Academy of Sciences and St. Petersburg University of Technology and Design. His educational foundation includes: PhD in Fluid Dynamics from Baltic State Technical University "VOENMEH" (1996-1999) M.Sc. in Mathematics from St. Petersburg State University (1993-1997) M.Sc. in Mechanics from Baltic State Technical University "VOENMEH" (1990-1996) Professor Omelchenko's research spans Enumerative Combinatorics, Graph Theory, Topology, Knot Theory, and Asymptotic Methods in Mathematical Physics. His work integrates discrete mathematics with physical applications, particularly in optimal control systems and nonlinear hyperbolic equations, demonstrating rigorous theoretical frameworks with engineering relevance. Analysis of his 2017-2021 publications reveals dominant themes in combinatorial enumeration: systematic classification of graph embeddings on surfaces (torus, projective plane, Klein bottle), Hamiltonian cycle enumeration in multipartite graphs, and topological invariants for textile structures. This work establishes foundational contributions to algebraic topology and discrete mathematics through novel enumeration techniques. Scientific Awards: No scientific awards were mentioned in the provided text. Advising and Grants: Information regarding student supervision, research grants, or funding sources was not specified in available materials. Labs and Teams: The documentation does not reference specific laboratories, research groups, or collaborative teams led by Professor Omelchenko.
Dr. Sofya Poger is an Associate Professor in the Department of Computer Science at Felician University's School of Business and Information Sciences. With over 15 years of teaching experience, she led the establishment of the university's Master of Science in Computer Science program. PhD in Computer Science, Stevens Institute of Technology MA in Computer Science, Montclair State University BSEE, Moscow Institute of Technology Dr. Poger's research focuses on Computer Vision , Pattern Recognition , Artificial Intelligence , and Machine Learning . Her work explores Temporal Weighted Data Models , Graph Theory , and Multispectral Sensor Design . Her recent publications (2001-2017) span topics in Computer Science Education , Software Engineering , and Computer Vision . Key trends include leveraging Web-Based Systems for educational assessment and developing algorithms for Planar Grid Graphs .
Petr Hliněný is a Professor at the Faculty of Informatics, Masaryk University in Brno, Czech Republic, where he also serves as the Vice-dean for research, development, and doctoral studies. He is affiliated with the Department of Computer Science and leads the Discrete Methods and Algorithms (DIMEA) research group. His research interests span Graph Theory , Discrete Mathematics , Theoretical Computer Science , with a focus on structural and topological graph theory, parameterized complexity, logic in computer science, twin-width, crossing numbers, and discrete geometry. His recent work includes structural results on planar graphs, visibility graphs, and logical aspects of graph classes. His recent publications exhibit a strong trend in analyzing structural width parameters such as twin-width and clique-width, their logical transductions, and algorithmic implications. He has published extensively on planar graphs, crossing numbers, and geometric graphs, often in top venues like European Journal of Combinatorics , Journal of Combinatorial Theory , and LIPIcs conference proceedings. Professor, Faculty of Informatics, Masaryk University Vice-dean for Research, Development and Doctoral Studies Head of DIMEA Research Group Guarantor of Doctoral Study Programme in Computer Science He actively supervises PhD and master’s students, including current doctoral candidates Filip Pokrývka, Shubhang Mittal, Jakub Balabán, and Jan Jedelský. He has led multiple research grants funded by the Czech Science Foundation (GAČR), including project 20-04567S on tractable instances of hard graph algorithmic problems. He also organizes seminars such as IV119 and IV131, and offers thesis topics in discrete mathematical methods.
Paweł Sobociński is a Professor of Trustworthy Software Technologies at the Department of Software Science, School of Information Technologies, Tallinn University of Technology (TalTech), where he also leads the Laboratory for Compositional Systems and Methods. He is a principal investigator in several major research projects including the Estonian Research Council’s PRG1210 (ALICE), the EU-funded CHESS cybersecurity hub, and the EXAI Centre of Excellence in AI. His academic background includes faculty positions at the University of Southampton and research roles at the University of Cambridge and institutions in France and Italy. His research lies at the intersection of computer science and mathematics, with a focus on applied category theory. He investigates compositional modeling of systems, where the behavior of complex systems emerges from the structured interaction of their components. His work employs string diagrams, process algebras, Petri nets, and categorical semantics to develop formal methods for verifying and reasoning about concurrent and cyber-physical systems. He is particularly known for his contributions to graphical linear algebra and diagrammatic reasoning. The recent publications highlight a strong trend in diagrammatic methods, especially string diagrams, for expressing logic, algebra, and system behavior. These works span from foundational categorical structures to applications in electrical circuits, concurrency, and formal verification, demonstrating a unifying thread of compositional reasoning. His leadership in organizing conferences like LICS 2024 and ICALP 2024 underscores his central role in the theoretical computer science community. His scientific recognition includes numerous invited talks and tutorials at major international venues such as CONCUR, QPL, MFPS, and ETAPS, as well as leadership roles in academic organizations. He is an Associate Editor for journals including Compositionality , Mathematical Structures in Computer Science , and Logical Methods in Computer Science , and has served on the steering committee of ETAPS. Sobociński has supervised multiple PhD students and postdoctoral researchers, including Owen Stephens, Fabio Zanasi, Mario Román, and Elena di Lavore. He is also the director of the PhD programme in ICT at TalTech and has received research grants from the Estonian Research Council, the European Commission, and the Estonian Ministry of Education and Research, supporting his work in trustworthy software, AI, and cybersecurity. He leads the Laboratory for Compositional Systems and Methods at TalTech, a research group focused on developing and applying compositional techniques in software science, with applications in AI, security, and formal verification. The lab fosters international collaboration and is active in organizing workshops and summer schools.
Natan Rubin is a faculty member in the Computer Science Department at Ben-Gurion University of the Negev, Beer-Sheba, Israel, where he has been conducting research in combinatorial and computational geometry since 2014. He is the principal investigator of a 5-year ERC Starting Grant project titled 'Combinatorial Aspects of Computational Geometry' (CombiCompGeom), which supports graduate students and postdocs in geometric algorithms and structures. Ph.D., Tel Aviv University, 2012 Advisor: Prof. Haim Kaplan and Prof. Micha Sharir His research focuses on fundamental problems in computational geometry, including geometric transversals , epsilon-nets , Voronoi diagrams , Delaunay triangulations , and intersection patterns of geometric objects . He has made significant contributions to the understanding of combinatorial bounds in geometric settings, such as resolving the Richter-Thomassen conjecture for pairwise intersecting Jordan curves and improving long-standing bounds on weak epsilon-nets. The recent publications reveal a consistent trend toward improving asymptotic bounds in high-dimensional and planar geometric configurations, with a strong emphasis on combinatorial methods and topological reasoning. His work often intersects with extremal combinatorics and discrete geometry, particularly in analyzing crossing and touching structures in planar graphs and families of convex sets. His scientific recognition includes: Best Paper Award at FOCS 2013 Best Paper Award at SoCG 2012 Rubin actively contributes to the academic community through service, having organized major workshops such as SODA 2018 and SoCG 2022, and hosting international researchers. He collaborates widely with leading figures in the field, including Pankaj Agarwal, János Pach, Micha Sharir, and Haim Kaplan. Though no formal list of students is provided, his ERC-funded project explicitly advertises multiple graduate and postdoctoral positions, indicating active mentorship. He is also involved in organizing international workshops and fostering collaboration within Israel’s strong computational geometry community, including researchers at BGU, Tel Aviv, and Jerusalem. His research is supported by competitive grants and involves the development of robust kinetic data structures and stable geometric graphs, with applications in dynamic environments and algorithmic stability.
Priyavrat Deshpande is an Associate Professor in the Department of Mathematics at the Chennai Mathematical Institute (CMI), a leading research institute in India. He is actively involved in research, teaching, and academic service, including placement coordination and organizing national mathematics competitions. His research lies at the interface of algebraic topology and combinatorics, with a focus on hyperplane, toric, and submanifold arrangements, topological robotics, and the topology of configuration spaces. He has made significant contributions to the understanding of the cohomology and combinatorics of arrangement complements, polygon spaces, and graph complexes. The trends in his recent publications (2019–2025) show a strong focus on combinatorial and topological aspects of arrangements, with recurring themes including the Braid arrangement, independence complexes, region counting, and applications to robotics. His work often combines algebraic topology with enumerative and structural combinatorics, particularly through the lens of simplicial and polyhedral geometry. Scientific Awards: SERB MATRICS Grant (June 2018 – March 2021) Priyavrat Deshpande has supervised numerous PhD and MSc students, including K. Menon, N. Daundkar, Anurag Singh, and Shuchita Goyal. He has been involved in securing research grants and fostering academic collaboration through workshops. He has co-organized several events such as the CS-Math Workshop on Applied Topology, the NCM Workshop on Cohen-Macaulay Complexes, and seminars on configuration spaces. Labs and Teams: While no formal lab is mentioned, he leads a research group focused on algebraic topology and combinatorics, regularly mentoring students and postdocs. He collaborates with researchers nationally and internationally, including Alex Suciu, Graham Denham, and Ján Mináč, and has co-organized seminars and workshops that function as dynamic research teams in applied topology.
John Maharry is a Professor of Mathematics and Assistant Dean of Academic Opportunities at the Ohio State University Marion campus. He holds a PhD from The Ohio State University (1996). His research focuses on graph theory and combinatorics, particularly graph decompositions, tree structures, surface embeddings, and minor/topological inclusions. He has organized numerous conferences, including MIGHTY LXII (2019) and the SIAM Conference on Discrete Math (2004). His teaching spans courses like Excursions in Mathematics and Calculus I. Education: PhD in Mathematics, The Ohio State University (1996) Research interests emphasize applying graph structures to networks, including computer/social networks and scheduling problems. Recent publications (2017–2019) explore projective planar graphs, flexibility of embeddings, and Wagner graph exclusion. No scientific awards explicitly listed. Advising/grants section highlights roles in undergraduate research and Honors Programming. Active in campus committees (e.g., Faculty Advisory Network, Senate Representative) and curriculum development.
