Find Academic Supervisors

• Topology
• Geometry
• Algebraic Geometry
• +4 more

Luigi Grasselli is a Senior Professor at the Department of Engineering Sciences and Methods, University of Modena and Reggio Emilia. His research spans topology, geometry, and their applications in engineering and art history. He focuses on metamaterials design, geometric structures, and historical mathematical contributions of Renaissance artists like Piero della Francesca and Albrecht Dürer. Grasselli also investigates environmental risks in recycling electronic waste. His academic career includes roles in computational topology, geometric modeling, and interdisciplinary studies linking mathematics with art. Key areas of expertise include crystallization theory, 3-manifold topology, and tessellation patterns applied to engineering materials. Grasselli has contributed to over 70 publications since 1978, exploring topics from Seifert manifolds to risk assessment methodologies. His work bridges pure mathematics with practical applications, such as additive manufacturing and sustainable waste management. He collaborates internationally, emphasizing geometric foundations in both historical and modern contexts.

Phuc Hung HoangView profile

Researcher

• Algorithms
• Computational Complexity
• Discrete Mathematics
• +6 more

Phuc Hung Hoang is a postdoctoral researcher in the Algorithms and Complexity Group at Technische Universität Wien (TU Wien) since November 2023, mentored by Robert Ganian. Prior to this, he worked as an Applied Scientist at Amazon EU (2021–2022) and earned his doctorate at ETH Zurich in 2022 under Bernd Gärtner and Emo Welzl. He holds a Master’s in Operational Research from the London School of Economics (2018) and a Chartered Accountant background from the National University of Singapore. His research bridges algorithmic design, discrete structures, and interdisciplinary applications. Key areas include graph algorithms, combinatorial optimization, computational complexity, reconfiguration problems, and efficient enumeration. His work often explores how structural properties of problems enable faster algorithms, with a focus on parameterized complexity, combinatorial games, and computational geometry. Recent publications highlight trends in reconfiguration problems , graph theory , and combinatorial optimization , including analyses of k-opt for TSP, degree-constrained spanning trees, and flip-based enumeration techniques. He secured the FWF ESPRIT Grant (2025–2028) as Principal Investigator for the project Structural Analysis of Combinatorial Reconfiguration . At TU Wien, he teaches courses like Efficient Algorithms and Hypercube Structures . He has supervised over 12 theses, including works on signotopes, lattice congruences, and graph safety. Beyond academia, he integrates humanistic and artistic perspectives through initiatives like Letter Earthlings and the Intercultural Science-Art Project .

Fabian KluteView profile

Research Fellow

• Graph drawing
• Automated cartography
• Map labeling
• +3 more

Fabian Klute is a Research Fellow at Universitat Politècnica de Catalunya, specializing in discrete and computational geometry. His research focuses on graph drawing, automated cartography, map labeling, and geometric computing, with emphasis on theoretical foundations and algorithm development. Klute's publications demonstrate consistent focus on geometric complexity, graph visualization, and combinatorial optimization. Recent works establish hardness results for segment folding and edge insertion problems, develop algorithms for geometric set diversity, and advance boundary labeling techniques. A significant research thread explores parameterized complexity in graph modification problems. His contributions in graph drawing include innovations in confluent drawings, book embeddings, and 1-planar extensions. Cartography-related research advances automated labeling and spatial representation for complex curve arrangements.

Renata SotirovView profile

Professor

• Optimization
• Operations Research
• Mathematical Programming
• +3 more

Renata Sotirov is a Full Professor at Tilburg University's Department of Econometrics & Operations Research within the Tilburg School of Economics and Management. She holds a PhD in Mathematics and has held academic positions including Associate Professor (2009–2014) and Assistant Professor (2007–2009). Her research focuses on optimization, operations research, and semidefinite programming with applications in combinatorial optimization and discrete mathematics. She has supervised PhD students such as Dr. Ning Ma and Dr. Uwe Truetsch and collaborates internationally, including with institutions like the University of Melbourne and McMaster University. Her work includes pioneering contributions to semidefinite relaxation techniques, integer SDPs, and algorithmic optimization. Recent projects involve the Chvátal-Gomory procedure for integer SDPs and complex cut polytopes. She has served as a research coordinator, director of graduate studies, and treasurer for her department. Her expertise spans teaching operations research methods, combinatorial optimization, and quantitative business analytics.

Juraj HromkovičView profile

Professor

• Theoretical Computer Science
• Algorithms
• Complexity Theory
• +6 more

Juraj Hromkovič is a Full Professor of Computer Science at the Swiss Federal Institute of Technology (ETH Zurich) , holding this position since 2004. His academic career spans multiple institutions, including Professorships at Christian Albrechts University in Kiel (1994-1997), RWTH Aachen (1997-2003), and earlier roles at Comenius University and the University of Paderborn. Education : 1977–1982: Studied Computer Science at Comenius University, Bratislava 1982: Dr. rer. nat. (PhD equivalent) from Comenius University 1986: CSc (Ph.D.) in Theoretical Cybernetics 1990: Dr. Sc. in Mathematics and Physics Research Interests focus on Theoretical Computer Science , particularly Algorithms , Complexity Theory , and Communication Protocols . His work explores Randomized Algorithms , Approximation Techniques , and Automata Theory , with notable contributions to understanding exponential gaps in computational models and optimizing information dissemination in networks. His publications span books, journal articles, and conference papers addressing foundational and applied aspects of computing. Scientific Awards include membership in the Slovak Academy of Sciences (2001) and two awards from the Slovak Literature Foundation for Scientific Literature (2002, 2004). He has supervised 11 PhD dissertations and one habilitation, demonstrating his commitment to academic mentorship.

Jaroslav NesetrilView profile

Professor

• Combinatorics
• Graph Theory
• Algorithmics
• +8 more

Professor Jaroslav Nesetril is affiliated with Charles University's Faculty of Mathematics and Physics since 1970 and serves as Director of the Institute of Theoretical Informatics (ITI) since 2000. He holds a full professor position since 1993 and has maintained adjunct roles at University of Waterloo (2000-2003) and visiting positions at prestigious institutions including University of Bonn (John von Neumann Professor) and University of Chicago. Fields of scholarship: Combinatorics, Graph Theory, Algorithmics, and Discrete Mathematics Leadership roles: Department Chairman (1986-1999), Director of ITI (2000-present) His research focuses on combinatorial structures, graph homomorphisms, and computational complexity. As a leading figure in discrete mathematics, he has contributed extensively to Ramsey theory, sparsity, and combinatorial number theory through both research and editorial leadership. Scientific honors include: Doctor Honoris Causa from Universite Bordeaux I (2009) and University of Alaska (2005) Gold medal from Charles University's Faculty of Mathematics and Physics (2011) State prize of Czechoslovakia (1985) Memberships in Academia Europaea (2012) and Hungarian Academy of Sciences (2013) He has served on editorial boards of major journals including Combinatorica, Journal of Graph Theory, and Random Structures and Algorithms, while maintaining active research leadership through DIMATIA Centre and European networks like COMBSTRU.

• Behavioural economics
• Experimental economics

Dr. Michael Thaler is a Lecturer in Economics at the Department of Economics, University College London (UCL). He holds a PhD in Business Economics from Harvard University (2020) and served as a Postdoctoral Research Associate at Princeton University's Department of Economics (2020–2022). His research focuses on behavioural economics and experimental economics , addressing topics such as motivated reasoning, gender bias in AI, and polarization in public health contexts. His work aligns with UN Sustainable Development Goals 3 (Good Health and Well-Being) and 10 (Reduced Inequalities). Key research contributions include studies on overinference in decision-making, the impact of fake news on trust, and gender differences in motivated reasoning. He developed the 'Jobfair' framework to benchmark gender bias in hiring algorithms. His earlier work also includes combinatorial geometry research, such as tribone tilings of triangular regions. Dr. Thaler has been affiliated with UCL since 2022 and maintains active research collaborations in behavioral science and experimental methodologies. No scientific awards are listed in the provided text.

• Algebraic Complexity Theory
• Computational Algebra
• Geometric Complexity Theory
• +4 more

Prof. Dr. Peter Bürgisser is a Professor at the Technical University of Berlin, affiliated with the Institute of Mathematics and the Algorithmic Algebra research group within Faculty II - Mathematics and Natural Sciences. His research focuses on algebraic complexity theory, computational algebra, and geometric methods in computer science. Bürgisser has made significant contributions to topics including invariant theory, numerical analysis of algorithms, and the computational complexity of algebraic problems. He has authored influential books such as *Algebraic Complexity Theory* and has published extensively in top-tier journals like the Journal of the ACM and SIAM Journal on Computing. His work includes developing polynomial-time algorithms for problems in invariant theory, analyzing the condition numbers of algebraic varieties, and studying the computational aspects of semialgebraic sets. Bürgisser's research also intersects with probability theory, particularly in understanding the statistical properties of zeros of random polynomials and the geometry of random algebraic varieties. Recent trends in his publications emphasize geometric complexity theory, non-commutative optimization, and the application of numerical methods to algebraic problems. He has collaborated with researchers such as Felipe Cucker, Michael Walter, and Avi Wigderson on foundational topics in computational mathematics and theoretical computer science. Bürgisser's office is located in room EB 116, and his contact information includes the email pbuerg@math.tu-berlin.de. His research has been supported through grants and collaborations, though specific grant details are not explicitly mentioned in the provided texts.

• Algebraic Geometry
• Combinatorics
• Discrete Geometry
• +3 more

Laura Felicia Matusevich is a Professor in the Department of Mathematics at Texas A&M University, affiliated with the College of Arts & Sciences. She holds a Ph.D. from the University of California, Berkeley (2002) and a Licenciada en Matemática from the Universidad Nacional de Córdoba, Argentina (1997). Her research focuses on Algebraic Geometry, Combinatorics, and Discrete Geometry, with applications to hypergeometric functions and neural coding. Her work bridges theoretical and applied mathematics, exploring topics such as binomial ideals, local cohomology, and neural code analysis. Recent contributions include advancements in non-convex neural code criteria, hypergeometric systems, and sparse polynomial computations. She has published extensively in top-tier journals and conference proceedings, demonstrating expertise in both foundational and computational aspects of algebraic structures. Dr. Matusevich’s research also intersects with computational algebra, numerical methods, and interdisciplinary applications in neuroscience and data science. Her articles frequently address challenges in algebraic coding, monodromy analysis, and combinatorial optimization, reflecting her broad impact across mathematics.

Asha RaoView profile

Professor

• Cybersecurity
• Graph Theory
• Combinatorics
• +7 more

Professor Asha Rao is a distinguished academic at RMIT University, holding the title of Professor in Mathematics and Cybersecurity. She has been instrumental in advancing cyber-mathematics to enhance cybersecurity. Her roles include Associate Dean of Mathematical Sciences (2017–2023) and Interim Director of the Australian Mathematical Sciences Institute (AMSI) (2020). She champions gender equity in STEM and frequently engages in public science communication. University: RMIT University School: School of Science Academic Rank: Professor Research Focus: Her work spans cybersecurity, coding theory, complex networks, and risk management, often integrating mathematical frameworks to address real-world problems like money laundering and small business digital security. She also explores fractal analysis and post-quantum cryptography. Recent Publications: Highlight recent advancements in post-quantum homomorphic encryption, small business cybersecurity frameworks (2021–2025), and data fusion techniques for internal network anomaly detection. Her research bridges technical innovation with policy implications. Scientific Recognition: 2019–2020 Science & Technology Australia Superstar of STEM 2021 Victorian Honour Roll of Women (Trail Blazer) 2021 India Australia Science and Technology Development Award 2016 RMIT Media Stars Award Teaching & Leadership: Actively supervises Masters and PhD students, emphasizing teamwork in cybersecurity education. She led curriculum design initiatives and addressed non-technical skills gaps in the industry (2020). Her leadership extends to national organizations like AMSI. Community Engagement: Promotes cybersecurity through media appearances (ABC News, Australian Financial Review) and events like Pint of Science. She co-founded Women in Mathematics and advocates for girls in STEM.

Niraj KhareView profile

Academic

• Graph Theory
• Hypergraphs
• Combinatorics
• +4 more

Niraj Khare is an Associate Teaching Professor in the Department of Mathematics at Carnegie Mellon University Qatar, part of the Mellon College of Science. He holds a Ph.D. from Ohio State University. His research focuses on graph theory, hypergraphs, combinatorics, and permutation statistics, with emphasis on matching theory, extremal graph properties, and combinatorial enumeration. His work includes studies on Erdős–Gallai edge bounds, Gončarov polynomials, and structural analysis of hypergraphs. Khare's academic contributions span theoretical and applied combinatorics, with notable publications on permutation statistics, hypergraph size analysis, and edge partitioning in graphs. His teaching role emphasizes mathematics education at the university level. He can be contacted at nkhare@cmu.edu and is located in Office 2194 at CMU Qatar's Education City campus.

Zhang ShixuanView profile

Assistant Professor

• Mathematical Optimization
• Operations Research
• Data Science
• +5 more

Zhang Shixuan is an Assistant Professor in the Department of Industrial & Systems Engineering at Texas A&M University. His research focuses on mathematical optimization theory and its applications to data science, operations research, and systems engineering. Education: Ph.D. in Operations Research from Georgia Institute of Technology Postdoctoral: Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University His primary research areas include: Polynomial Optimization Integer Optimization Stochastic Optimization Robust Optimization His recent publications explore advances in distributionally robust optimization, security-constrained power flow algorithms, and theoretical aspects of multistage stochastic programming. Key trends in his work emphasize computational efficiency, algorithm design for nonconvex problems, and applications to energy systems and convex geometry. Doctoral Advisees: Jiamin Chen and Qi Xiao.

• Formal Verification
• Model Checking
• Autonomous Systems
• +7 more

Professor Alice A Miller is a faculty member at the University of Glasgow's School of Computing Science, where she has held roles including Postdoc, Daphne Jackson Fellow, Lecturer, and Senior Lecturer since 1997. Prior to this, she worked at the Universities of East Anglia, Western Australia, and Stirling. She currently holds a Leverhulme Research Fellowship and is a Chartered Engineer with the IET. Her membership in the London Mathematical Society reflects her interdisciplinary background. Education: Alice Miller holds a PhD in Number Theory, though her research career has primarily focused on Formal Verification and Model Checking. Her academic trajectory includes leveraging mathematical techniques to analyze systems across engineering and computer science disciplines. Research interests: Her work centers on applying formal verification methods to ensure safety and reliability in complex systems such as autonomous vehicles, robots, and telecommunications. Key techniques include model checking and symmetry reduction. Specific areas include: Modelling and Verification of Concurrent Systems Abstraction and Symmetry Reduction Methods Graph Theory Applications in System Analysis Combinatorics and Group Theory for Optimization Recent publications highlight advancements in overtake planning, sensor network protocols, and probabilistic system analysis. Scientific Awards: Daphne Jackson Fellowship, Leverhulme Research Fellowship, and Chartered Engineer status from the IET. Grants and Advising: Alice has led or co-investigated multiple grants totaling over £3 million, including projects on digital twins, autonomous systems governance (£2.7M), and secure memory management (M4Secure). She has advised on student-led initiatives like UAV demonstrators and overtaking planning simulations, though specific advisee names are not listed in the provided text. Labs/Teams: Collaborates with interdisciplinary teams on projects involving robotics, sensor networks, and formal verification tools such as PRISM and SPIN. Her work frequently intersects with engineering and mathematics groups within the university and industry partners like D-RisQ Ltd.

Jin-Yi CaiView profile

Professor

• Theoretical Computer Science
• Computational Complexity Theory
• Holographic Algorithms
• +3 more

Jin-Yi Cai is a distinguished Professor of Computer Science and Steenbock Professor of Mathematical Sciences at the University of Wisconsin at Madison, where he has been a faculty member since 2000. Previously, he held academic positions at State University of New York at Buffalo (Professor 1996-2000, Associate Professor 1993-1996), Princeton University (Assistant Professor 1989-1993), and Yale University (Assistant Professor 1986-1989). He has also been a Radcliffe Institute Fellow at Harvard University (2007-2008) and a Guggenheim Fellow and Visiting Professor at the University of Toronto (1999-2000). Dr. Cai earned his Ph.D. in Computer Science from Cornell University in 1986, an M.A. in Mathematics from Temple University in 1983, and a Certificate in Mathematics from Fudan University in 1981. His academic journey spans prestigious institutions across the United States and demonstrates a consistent trajectory of scholarly excellence. Professor Cai's research focuses on theoretical computer science, particularly computational complexity theory, with significant contributions to holographic algorithms, counting constraint satisfaction problems, and graph homomorphisms. His work bridges computer science and mathematics, developing sophisticated algorithms and proving fundamental complexity results. His research has evolved from foundational work in structural complexity and oracle separations to specialized work in holographic algorithms and counting problems, demonstrating both depth and breadth in theoretical computer science. His publication record shows a consistent output of high-impact research, with major contributions spanning over three decades. His work on holographic algorithms represents a particularly innovative strand of research that has opened new avenues in computational complexity. The progression of his research demonstrates increasing specialization in counting problems while maintaining connections to broader theoretical frameworks in computer science and mathematics. 2022 Simons Fellowship 2022 CCF Award for Overseas Outstanding Contribution 2022 Fellow, American Mathematical Society (AMS) 2021 Fulkerson Prize in Discrete Mathematics 2021 Gödel Prize in Theoretical Computer Science 2014 Steenbock Professorship, UW Madison 2001 ACM Fellow 1998 John Simon Guggenheim Fellowship 1994 Sloan Fellowship Professor Cai has served as Editor of the Journal of Computer and System Sciences and Associate Editor of the Journal of Computational Complexity. His work has been recognized with numerous prestigious fellowships including the Guggenheim Fellowship, Sloan Fellowship, and Humboldt Research Award. His research has had significant impact in theoretical computer science, earning him the Gödel Prize and Fulkerson Prize, two of the most prestigious awards in theoretical computer science and discrete mathematics respectively.

Erika Roldan RoaView profile

Visiting Assistant Professor

• Stochastic Topology
• First Passage Percolation
• Extremal Topological Combinatorics
• +3 more

Erika Roldán Roa is a mathematician with academic affiliations at Ohio State University (Visiting Assistant Professor, 2019-2020) and Technische Universität München (Marie Skłodowska-Curie Fellow, 2020-2022). She holds a Ph.D. in Probability and Statistics from CIMAT (2018) and has conducted postdoctoral research at institutions like EPFL and Ohio State. Her work bridges stochastic topology, combinatorics, and educational technology, focusing on topics like cubical sliding puzzles, Eden growth models, and extremal topological problems in polyominoes. Education: Ph.D. in Probability and Statistics, CIMAT (2018) M.Sc. in Mathematics, CIMAT (2014) B.Sc. in Mathematics, Universidad de Guanajuato (2010) Research Interests: Her research spans stochastic topology, extremal combinatorics, and applications of discrete geometry to puzzles and games. She explores configuration spaces, topological properties of random structures, and innovative educational approaches like the Music Math Project, which integrates music and mathematics. Awards: Includes the Marie Skłodowska-Curie Fellowship (2020-2022), Arana-Ordaz Prize (2019), and Sofia Kovalevskaia Prize (2019). She has also received grants from CONACYT and CIMAT. Grants & Outreach: Developed workshops in marginalized communities using music and math, and contributed to software tools like the Eden Model analysis package. Active in science popularization through articles and outreach programs. Labs/Teams: Collaborated on projects like the Eden Model (topology analysis software) and extremal animal configurations, often involving interdisciplinary teams in mathematics and computer science.