Alberto Santini is an Associate Professor of Operational Research and a Ramon y Cajal fellow at Universitat Pompeu Fabra in Barcelona, Spain. He is also an affiliate professor at the Barcelona Graduate School of Mathematics and the Data Science Centre at the Barcelona School of Economics. During 2025-2027, he coordinates the Transportation group of the Spanish O.R. Society. His research focuses on optimization methods applied to transportation, logistics, and sustainability, including scheduling, vehicle routing, and heuristic algorithms. He has contributed to solving complex problems like last-mile delivery integration with public transport, airline flight scheduling, and energy-efficient vertical farming. His work often employs advanced techniques like column generation and decomposition strategies. Notable contributions include decomposition strategies for vehicle routing heuristics and the application of metaheuristics such as Adaptive Large Neighbourhood Search (ALNS). He is the founder of EUROYoung and AIROYoung, youth branches within prominent operational research societies. His GitHub repositories, such as cvrp-decomposition , provide open-source implementations of his algorithms. Santini’s research addresses real-world challenges like epidemic resource allocation and sustainable logistics, reflecting his commitment to both theoretical and applied operational research. Awards: Ramon y Cajal Fellow Labs/Teams: Leads Transportation group (Spanish O.R. Society), Founded EUROYoung/AIROYoung.
Emily Whiting is an Associate Professor of Computer Science at Boston University and Director of the Shape Design & Computation Lab. She also serves as Director of PhD Admissions and Co-Director of the BU Computer Graphics Lab. Her research focuses on computational fabrication, architectural geometry, and computer-aided design, bridging digital geometry processing, engineering mechanics, and rapid prototyping. She holds a PhD from MIT (2012), an SM in Design & Computation from MIT (2006), and a BASc in Engineering Science from the University of Toronto (2004). Previously, she was faculty at Dartmouth and a Marie Curie Postdoctoral Fellow at ETH Zurich. Her research interests include 3D printing optimization, structural design for fabrication, and tools for functionally-valid object creation. Notable projects include work on elastic garments, climbing experience replication, and print-wind instrument design. Her work has been featured on TEDx and PBS NOVA, and she has received awards such as the NSF CAREER Award and Sloan Research Fellowship. Education: PhD (MIT), SM (MIT), BASc (University of Toronto) Labs: Shape Design & Computation Lab, BU Computer Graphics Lab Key Projects: Knitting 4D garments, Environment-Scale Fabrication, Thermal-comfort casts Recent professional activities include program committee roles at SIGGRAPH 2025 and UIST 2024, and serving as Program Co-Chair for Pacific Graphics 2024. She advises a team of PhD and MS students, with alumni now in academia and tech industries.
Laura Colmenarejo is an Assistant Professor in the Department of Mathematics at NC State University, part of the College of Sciences. She holds a PhD from the University of Sevilla (2016), a Master’s from Universidad Autónoma de Madrid (2011), and a Bachelor’s in Mathematics (2010). Her research focuses on algebraic combinatorics, symmetric functions, enumerative combinatorics, and representation theory of finite groups. She has advised multiple graduate and undergraduate students and has held previous positions at UMass Amherst, the Max Planck Institute in Leipzig, and York University. Her work spans topics like quantum cohomology, chromatic symmetric functions, and combinatorial structures such as posets and permutations. She co-organizes the Algebra and Combinatorics seminar at NC State and contributes to conferences like Triangle Lectures in Combinatorics. Her research emphasizes interactions between algebraic geometry, representation theory, and discrete mathematics. Advising: Camryn Thompson, Alex Steward, Ian Klein, Spencer Daugherty (graduate students), and Felix Hutchins, Etienne Phillips, Viviene Do (undergraduate researchers). Grants and funding details not explicitly mentioned. Labs/Teams: Part of the Algebra and Combinatorics Faculty Research Group at NC State.
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.
Fabrizio Falchi is a researcher at the Artificial Intelligence for Media and Humanities (AIMH) Lab of the Institute of Information Science and Technologies (ISTI) within Italy's National Research Council (CNR). He also maintains an associate position at the Biorobotics Institute of Scuola Superiore Sant'Anna. His work focuses on developing advanced multimedia retrieval systems, with the VISIONE platform being his most notable contribution, which has won international competitions including the Video Browser Showdown in 2024 and placed second in 2023. Falchi's educational background includes: Ph.D. in Information Engineering from University of Pisa (Italy) Ph.D. in Informatics from Faculty of Informatics of Masaryk University of Brno (Czech Republic) M.B.A. from Scuola Superiore Sant'Anna in Pisa His research spans deep learning, convolutional neural networks, deep features extraction, similarity search algorithms, distributed indexing systems, multimedia information retrieval, computer vision applications, and peer-to-peer systems. Falchi has made significant contributions to fine-grained visual understanding, cross-modal retrieval (particularly image-text matching), and robustness of deep learning systems against adversarial attacks. His work demonstrates a strong focus on practical applications of these technologies, particularly in video retrieval systems and safety monitoring solutions. Analysis of Falchi's recent publications reveals a strong focus on video and image retrieval systems, with the VISIONE platform being central to his work. His research shows increasing emphasis on fine-grained understanding in computer vision, cross-modal retrieval, and addressing practical challenges like cross-resolution face recognition. Recent work demonstrates innovation in making these systems more efficient through techniques like knowledge distillation (ALADIN) and leveraging virtual worlds for training data. His publications consistently bridge theoretical advances with practical applications in surveillance, safety monitoring, and multimedia search. Falchi's work has received significant recognition: Best paper award at CBMI 2024 for 'Is ClLIP the main roadblock for fine-grained open-world perception?' VISIONE 2024 won the Video Browser Showdown competition in Amsterdam VISIONE obtained second place at Video Browser Showdown 2023 in Bergen Best Paper Award for 'Learning Safety Equipment Detection using Virtual Worlds' at CBMI 2019 Falchi collaborates extensively with researchers at ISTI-CNR, particularly within the AIMH Lab. His work on VISIONE involves collaboration with Giuseppe Amato, Paolo Bolettieri, Fabio Carrara, Claudio Gennaro, Nicola Messina, Lucia Vadicamo, and Claudio Vairo. As co-chair of Ital-IA 2023, the 3rd National Conference on Artificial Intelligence, he plays an active role in the academic community. He is a member of ACM (since 2012), the Computer Vision Foundation, the Italian Association for Computer Vision Pattern Recognition and Machine Learning (CVPL), and the CINI Lab on Artificial Intelligence and Intelligent Systems. Falchi is a key member of the Artificial Intelligence for Media and Humanities (AIMH) Lab at ISTI-CNR, where he leads research on video retrieval systems. The lab has developed the award-winning VISIONE platform, which combines multiple scientific results in content-based video retrieval. His team focuses on developing systems that enable users to search for target videos using textual prompts, drawing objects and colors, or images as query examples. The lab's work demonstrates strong interdisciplinary collaboration, bridging computer science with practical applications in media, safety monitoring, and urban environments.
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).
Erik Demaine is a Professor in the Department of Electrical Engineering and Computer Science at MIT, affiliated with the Computer Science and Artificial Intelligence Laboratory (CSAIL), the Theory of Computation group, and the Algorithms Group. His research spans algorithms, computational geometry, folding, robotics, complexity theory, and interdisciplinary connections between mathematics and art. He received the MacArthur Fellowship ("genius grant") for his work on folding and computation. Demaine's work includes co-authoring books such as Geometric Folding Algorithms and Games, Puzzles, and Computation . His art collaborations with his father Martin Demaine, including curved-crease sculptures, are in the permanent collections of the Museum of Modern Art (MoMA) and the Renwick Gallery. He is also involved in software projects like Coauthor and Cocreate, supporting collaborative research and education. His research interests include folding and unfolding of geometric structures, computational complexity of games, protein folding, and algorithm design. He has contributed to areas like data structures, robotics, and network computing, with a focus on bridging theoretical computer science and tangible applications. Demaine holds patents and has been recognized with numerous awards, including the NSERC Doctoral Prize and the Gödel Prize. His work often involves supercollaboration, emphasizing open problem-solving and interdisciplinary approaches.
Dr. Julian Sahasrabudhe is a researcher at the Department of Pure Mathematics and Mathematical Statistics (DPMMS) , University of Cambridge, affiliated with the School of Mathematics . His work focuses on combinatorics, number theory, and graph theory, with a emphasis on extremal problems and probabilistic methods. His recent research explores Erdős covering systems, Littlewood polynomials, and monochromatic subgraphs. Publications from 2018–2024 highlight applications of probability generating functions, arithmetic progressions, and density analysis in combinatorial structures. Contact details: jdrs2@cam.ac.uk , Room C2.08, Tel: 01223 337974. Personal homepage .
Fedor V. Fomin is a Professor in the Department of Informatics at the University of Bergen, Norway, where he leads the Algorithms Research Group. His work is central to theoretical computer science and combinatorics, with significant contributions to algorithm design and analysis. His primary research interests include: Parameterized Algorithms and Kernelization Exact (Exponential Time) Algorithms Graph Algorithms and Graph Minors Approximation Algorithms and Treewidth Matroid Algorithms and Metric Embedding Algorithmic Fairness and Pursuit-Evasion Problems The selected publications reflect a strong trend in foundational algorithmic techniques, particularly in parameterized complexity, kernelization, and exact algorithms. His work often bridges theoretical depth with practical applicability, especially in graph-theoretic problems and preprocessing methods. His scientific recognition includes: EATCS Nerode Prize 2015 EATCS Nerode Prize 2017 Fedor V. Fomin has made substantial contributions through major textbooks such as Parameterized Algorithms (2015) and Kernelization (2019), which have become essential resources in the field. He has collaborated with leading researchers including Daniel Lokshtanov, Saket Saurabh, and Dieter Kratsch. While specific advising roles are not listed, his publications and books suggest extensive mentorship and collaboration. He is actively involved in organizing academic events like FPT Fest and GRASTA, indicating leadership in the research community. He is affiliated with the Algorithms Research Group at the University of Bergen, contributing to a vibrant research environment focused on discrete algorithms and complexity.
Jop Briët is a Researcher at the Department of Algorithms and Complexity at Centrum Wiskunde & Informatica (CWI) in the Netherlands. His work focuses on theoretical computer science, quantum information theory, combinatorics, and tensor analysis. He has held grants including the Veni Innovational Research Grant from NWO and a Rubicon fellowship. He has authored over 50 publications in leading venues, exploring topics such as Grothendieck inequalities, quantum computing, and additive combinatorics. His research interests span the interplay between combinatorics and computational complexity, with particular emphasis on tensor analysis, probabilistic methods, and algorithm design. Recent work includes studies on Szemerédi’s theorem with random differences and the application of quantum query algorithms to entanglement-based problems. Awards: Outstanding paper award TQC (2020), Andreas Bonn medal (2013), Stieltjesprijs (2011). Professional Activities: Editor for ERCIM News, Board Member of Koninklijk Wiskundig Genootschap, and frequent invited speaker at workshops on quantum computing and combinatorics. Grants: Veni Grant (2014), Rubicon Fellowship (2012). Current teaching includes courses on Additive Combinatorics and Quantum Information Processing, reflecting his commitment to bridging foundational theory with advanced applications in computing and mathematics.
Yannic Maus is a University Professor at the Faculty of Computer Science and Biomedical Engineering at Graz University of Technology (TU Graz), Austria, where he heads the newly founded Institute of Algorithms and Theory (established in 2025). He also serves as co-leader of one of the five fields of expertise at TU Graz (FoE Information, Communication & Computation). His academic journey includes: PhD in Computer Science from University of Freiburg, Germany (2014-2018) MSc in Mathematics from RWTH Aachen, Germany BSc in Mathematics and Computer Science from RWTH Aachen, Germany (with a year at National University of Singapore) Professor Maus specializes in theoretical computer science and algorithm design, with a particular focus on distributed computing. His research spans distributed graph algorithms, efficient algorithms, data structures, complexity theory, and geometric algorithms. He approaches problems with both theoretical rigor and practical applications in mind, seeking clean mathematical solutions to questions motivated by real-world systems. His recent publications show a strong focus on distributed and parallel algorithms, particularly in graph theory. The research trends include distributed graph coloring, symmetry breaking, vertex cover problems, and massively parallel computing models. His work often bridges theoretical computer science with practical distributed systems considerations, with applications to large-scale networks and highly parallel systems. Professor Maus has received numerous accolades for his research: 2020 Principles of Distributed Computing Doctoral Dissertation Award Wolfgang-Gentner-Nachwuchsförderpreis 2019 GI Dissertationspreis 2018 Best Paper Awards at SIROCCO 2016, DISC 2016, and DISC 2017 Professor Maus actively mentors PhD students and has secured significant research funding, including FWF grants P36280-N (2023-2027), DOC 183 (2024-2028), I6915 (2024-2028), and FFG grant No. 59263962. His research group maintains strong international collaborations with institutions across Germany, Finland, Iceland, Israel, and beyond, providing students with opportunities for international research visits. He leads the Algorithms & Complexity research group at TU Graz, which includes PhD students Manuel Jakob, Florian Schager, Malte Baumecker, and Kritika Kashyap, as well as postdoc Tijn de Vos. The group is actively involved in theoretical computer science research with a focus on distributed and parallel algorithms, particularly for large-scale networks and highly parallel systems.
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.
Piotr Micek is a professor in the Theoretical Computer Science Department at the Faculty of Mathematics and Computer Science, Jagiellonian University , Kraków, Poland. He is an active researcher in combinatorics, particularly in structural graph theory and poset combinatorics, and maintains extensive international collaborations. University: Jagiellonian University School: Faculty of Mathematics and Computer Science Department: Theoretical Computer Science Department Email: firstname.lastname@gmail.com Office: Room 3151, Łojasiewicza Street 6, 30-348 Kraków Phone: +48 12 664 7594 Duty hours: Wednesdays 11:00–13:00 His main research interests include structural graph theory, combinatorics of partially ordered sets (posets), geometric intersection graphs, graph coloring and choosability, and the entropy compression method. He also works on approximation and on-line algorithms and combinatorial geometry. His work often bridges deep theoretical insights with algorithmic applications. The recent publications highlight a strong focus on graph structure and coloring problems. Key themes include product structure of planar graphs, poset dimension and its relation to height and planarity, weak coloring numbers, and adjacency labelling. His work frequently appears in top venues such as Journal of the ACM , Combinatorica , SIAM Journal on Discrete Mathematics , and SODA, indicating sustained high-impact contributions. Associate Editor, SIAM Journal on Discrete Mathematics (2025–) Former Associate Editor, Discrete Mathematics (2010–2022) Former Associate Editor, Discrete Mathematics & Theoretical Computer Science (2012–2020) He has supervised numerous students at all levels, including PhD candidates Jędrzej Hodor , Marcin Briański , and Michał T. Seweryn , and has led major research grants such as OPUS 24 and WEAVE-UNISONO funded by NCN. He has also been involved in significant trilateral projects with researchers from Belgium and Germany. His recent talks include tutorials on product structure theory and centered colorings, reflecting his leadership in these areas. He actively participates in the academic community, having served on program committees (e.g., SODA 2021, WG 2022) and organized workshops such as the Order & Geometry series. His research is supported by substantial funding, including over 900,000 PLN for current projects.
Maria Axenovich is a Professor at the Department of Mathematics , Karlsruhe Institute of Technology (KIT). Her research focuses on graph theory and combinatorics , emphasizing unavoidable structures in graphs, Ramsey-type problems, Turán densities, and extremal graph theory. Education : Undergraduate in Novosibirsk, Russia; Ph.D. at the University of Illinois at Urbana-Champaign under Zoltan Füredi. Positions : Previously at Iowa State University; since 2012 at KIT. Editorial Roles : Editor-in-Chief of the Electronic Journal of Combinatorics (2020–present); Associate Editor of Order (2016–present). Recent Research Trends : Her 2023–2025 publications address hypercubes , poset Ramsey numbers , interval colorings , extremal subgraphs , and canonical Ramsey theorems . Collaborations span institutions in the US, UK, Hungary, and Germany. Students and Collaborations : Supervises Ph.D., Master’s, and Bachelor students. Current advisees include Dingyuan Liu , Christian Winter , and Lea Weber . Former students like Jonathan Rollin and Torsten Ueckerdt have contributed to extremal graph theory and hypergraphs. Courses : Teaches Linear Algebra , Combinatorics , and Graph Theory at KIT. Leads seminars on Extremal Set Theory and Discrete Mathematics .
Prof. Dr. Peter Müller is a Professor at the Mathematical Institute of Ludwig Maximilian University of Munich (LMU), where he also serves as Dean of the Faculty of Mathematics, Informatics and Statistics. His research group focuses on Analysis, Mathematical Physics, and Numerics. Office: Room 439, Block B, Theresienstr. 39, 80333 Munich. Education: Habilitation in Mathematics, University of Göttingen (2006) Habilitation in Physics, University of Göttingen (2002) Ph.D. in Physics, University of Erlangen-Nürnberg (1996) Diploma in Physics, University of Erlangen-Nürnberg (1991) Research Interests: Müller's work spans mathematical physics, analysis, and probability theory, with emphasis on: Random Schrödinger operators and spectral theory Delocalization phenomena in disordered systems Quasiperiodic structures and ergodic properties Entanglement entropy in quantum systems His research bridges rigorous mathematical analysis with applications in quantum mechanics and statistical physics. Publication Trends: Recent articles (2013–2025) predominantly explore spectral theory in disordered quantum systems. Key themes include localization/delocalization transitions, asymptotic analysis of entanglement entropy, and spectral properties of random operators. Methodologically, his work combines functional analysis, stochastic processes, and operator theory to address fundamental questions in mathematical physics. Student Advising: Extensive mentorship of graduate students: 8 PhD students (e.g., Jakob Stern, Ruth Schulte) 17 Master's students (e.g., Leonard Wetzel, Julian Widl) Research Team: Leads the working group "Analysis, Mathematical Physics and Numerical Analysis" with postdoctoral researchers (e.g., Constanza Rojas-Molina) and PhD candidates. Regularly organizes international conferences on mathematical physics and disordered systems.
