جستجوی استاد راهنمای دانشگاهی

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

J. Cole Smith is the Dean of the College of Engineering and Computer Science at Syracuse University and holds the academic rank of Professor. He joined Syracuse in 2019 with a focus on advancing undergraduate and graduate education, research initiatives, and diversity, equity, and inclusion efforts. Previously, he earned a PhD in Industrial and Systems Engineering from Virginia Tech (2000) and a BS in Mathematical Sciences from Clemson University (1996). His research focuses on mathematical optimization, particularly mixed-integer programming and combinatorial optimization, with applications in network interdiction, logistics, national security, healthcare, and sports. His work has been supported by agencies such as the National Science Foundation, Office of Naval Research, and Defense Advanced Research Projects Agency. Recent research trends emphasize network interdiction under uncertainty, bilevel optimization, and large-scale optimization challenges. His publications in top journals like Operations Research and Mathematical Programming reflect these themes. Awards include INFORMS Fellow (2023) and recognition from Virginia Tech's Grado Department of Industrial and Systems Engineering. While his dean duties reduce direct research involvement, he remains active through collaboration with PhD students. His team's work addresses real-world problems in security, logistics, and healthcare, leveraging advanced algorithmic techniques.

• Integer programming
• Combinatorial optimization
• Network flows
• +۹ مورد دیگر

Nikolaos Tziavelis is an Assistant Professor in the Department of Computer Science and Engineering at Basking Engineering, University of California, Santa Cruz. His research bridges theoretical and practical aspects of database systems, focusing on improving real-world data processing through novel algorithmic solutions. Education: Ph.D. from Northeastern University (advised by Mirek Riedewald and Wolfgang Gatterbauer) Diploma from National Technical University of Athens, Greece Research Interests: Data Management Database Theory Query Processing and Optimization Algorithms for Big Data Integration of Machine Learning with Database Systems Publication Trends: His work emphasizes ranked enumeration, join algorithms, and query optimization, with applications in responsive database systems and machine learning integration. Key themes include theoretical foundations, practical system improvements, and algorithmic efficiency for complex data processing tasks. Scientific Awards: 2022 Google PhD Fellowship PODS 2021 Best of Recognition 2023 VLDB PhD Workshop Best Paper Award 2024 Khoury Research Award from Northeastern University Service: He has served on program committees for major conferences including SIGMOD, VLDB, PODS, EDBT, ICDE, and Northeast Database Day.

• Database Systems
• Database Theory
• Query Processing and Optimization
• +۳ مورد دیگر

Bernhard von Stengel is a Professor of Mathematics at the Department of Mathematics, London School of Economics and Political Science . His work bridges game theory, computational complexity , and mathematical economics , with a focus on equilibrium computation and algorithmic aspects. Developed Game Theory Explorer , open-source software for analyzing strategic and extensive-form games. Organized major workshops like What is Strategic Information? (2024) and Game Theory and Machine Learning (2023). Authored the textbook Game Theory Basics (Cambridge University Press, 2021). His research spans zero-sum games , correlated equilibrium , inspection games , and communication over noisy channels . Recent work includes characterizing the Condorcet dimension of metric spaces (2024) and stable-set bounds for Nash equilibria in bimatrix games. He has collaborated with institutions like the Game Theory Society and contributed to public discourse via talks on algorithms' societal impact (2021) and game theory in politics (2020).

• Game Theory
• Algorithmic Game Theory
• Computational Complexity
• +۲ مورد دیگر

Nofar Carmeli is a researcher at Inria , affiliated with the Boreal joint project-team (LIRMM, Inria, University of Montpellier, CNRS) in Montpellier, France. Her work focuses on theoretical aspects of database query optimization, particularly through the lenses of fine-grained complexity and enumeration complexity. PhD from Technion (2015-2020), advised by Prof. Benny Kimelfeld Postdoctoral Researcher at ENS Paris (2021-2022) and Inria's Valda project-team Holds the Schmidt Postdoctoral Award (2021-2022) Her research explores optimal algorithms for database query answering, including direct access to ranked answers, quantile computation, and handling of conjunctive queries with self-joins or negation. She investigates how structural properties of queries and data constraints like functional dependencies affect computational complexity. Key contributions include: Establishing tractability boundaries for direct access to conjunctive queries Developing efficient algorithms for minimal triangulation enumeration Advancing probabilistic database representations for infinite domains Creating explainable opinion graph frameworks for review summarization Scientific awards: Google PhD Fellowship (2019) Schmidt Postdoctoral Award (2021-2022) PODS Best Student Paper (2019) She has served on program committees for STACS (2025), PODS (2023-2025), and ICDT (2022-2024), and contributed to open-access research dissemination through Arxiv and dblp.

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +۲ مورد دیگر

Noela Müller is an Assistant Professor in the Mathematics and Computer Science school at Eindhoven University of Technology . Her research focuses on Probability Theory , Random Matrices , and Random Graphs , with significant contributions to understanding the rank of sparse matrices and clique factors in probabilistic settings. Research Outputs : Published 22 works including journal articles and preprints. Collaborations : Active in international networks, particularly in sparse matrix analysis and probabilistic combinatorics. Her recent work explores sparse pooled data algorithms , random 2-SAT models , and sharp thresholds in random graphs , showcasing interdisciplinary applications in computer science, mathematics, and theoretical physics.

• Probability Theory
• Random Matrices
• Sparse Matrices
• +۵ مورد دیگر

Maria José Serna Iglesias is a Full Professor at the Departament de Ciències de la Computació of the Universitat Politècnica de Catalunya (UPC), Barcelona Tech . She leads the research group ALBCOM (Algorithmics, Bioinformatics, Complexity and Formal Methods) and coordinates doctoral programs in Computing. Her research focuses on algorithmics, computational complexity, social network analysis, and game theory. She actively participates in conferences such as SEA 2023-2025 , CIAC , and Algorithmic Decision Theory . Teaching includes advanced algorithmics courses for undergraduate and master’s programs. Current projects include the MOTION initiative (PID2020-112581GB-C21) on large-scale data processing. Past projects involve EU initiatives like WISEBED and DELIS . Her work bridges theoretical computer science with applications in networks and social systems, emphasizing algorithmic solutions for complex problems.

• Algorithmics
• Complexity Theory
• Social Network Analysis
• +۳ مورد دیگر

Dr. Heather Macbeth is a Senior Lecturer in Pure Mathematics at Imperial College London, specializing in Kähler geometry, geometric analysis, and the formalization of mathematics. Her research develops geometric analysis techniques for complex manifolds while advancing proof verification through the Lean theorem prover. She leads the development of Lean's Mathlib library, creating formalizations for differential geometry, functional analysis, and representation theory. Her textbook The Mechanics of Proof introduces proof writing through Lean, integrating computer verification with mathematical pedagogy. Funded by a Microsoft Research Lean Award, Dr. Macbeth organizes workshops on formal mathematics and serves on the AMS Committee on Publications. Her geometric research examines Ricci solitons, Yamabe invariants, and Kähler-Einstein metrics, while her formalization work includes Sobolev inequalities and semilinear functional analysis. Research Contributions: Geometric analysis of Ricci solitons and Kähler metrics Formal verification of functional analysis theorems Proof assistant pedagogy and textbook development Contributions to Lean's mathematical library

• Kähler Geometry
• Geometric Analysis
• Formal Verification
• +۳ مورد دیگر

Samuel Fiorini is Associate Professor in the Department of Mathematics at the Université libre de Bruxelles (ULB) , member of the Algebra and Combinatorics group (CP 216). His research centres on polyhedral combinatorics, extended formulations, combinatorial optimisation and approximation algorithms , with frequent overlap into structural graph theory. Research in depth: Fiorini’s work explores how high-dimensional polytopes can sometimes be expressed compactly through extended formulations, proving exponential lower bounds when they cannot. He has contributed new approximation algorithms for classical problems such as vertex cover, clique transversal and odd-cycle packing, and has advanced the understanding of sorting and entropy in partially ordered sets. His papers often combine tools from graph minors, communication complexity and polyhedral theory. Scientific recognition: Best Paper Award, 44th ACM Symposium on Theory of Computing (STOC 2012) Programme committees: FOCS, IPCO, APPROX, STACS, WAOA Organiser, Sixth Cargese Workshop on Combinatorial Optimization Advising & grants: He currently supervises PhD students Carole Muller and Matthew Drescher and has mentored six completed PhDs as well as more than a dozen post-doctoral researchers. His group has been supported by an ERC starting grant and other national and international projects focusing on polyhedral approaches to hard optimisation problems. Lab & team: Fiorini leads a vibrant team within the Algebra and Combinatorics cluster at ULB, maintaining active collaborations with researchers worldwide and hosting frequent visitors working on discrete optimisation and polyhedral combinatorics.

• Polyhedral combinatorics
• Extended formulations
• Combinatorial optimization
• +۲ مورد دیگر

Professor Sara Billey is a faculty member in the Department of Mathematics at the University of Washington. She holds a PhD from the University of California, San Diego (1994) and an SB from MIT (1990). Her research focuses on algebraic combinatorics, including Schubert polynomials, flag manifolds, and representation theory of Lie groups. She advocates for computational methods in mathematics and explores undecidable problems. Notable awards include the PECASE Award. Her work bridges theoretical mathematics with machine learning applications, as seen in recent collaborations on AI-driven conjecturing tools. Education: PhD (UCSD, 1994), SB (MIT, 1990). Research emphasizes algebraic structures and their combinatorial interpretations, with contributions to Schubert varieties, Bruhat orders, and Kazhdan-Lusztig polynomials. She has pioneered computational frameworks for conjecture generation in pure mathematics. Grants include PECASE-funded projects on combinatorial structures in algebra and geometry. Active in teaching and advising, though no specific advisees are listed.

• Algebraic Combinatorics
• Algebraic Geometry
• Combinatorics
• +۷ مورد دیگر

Petteri Kaski is an Associate Professor at the Department of Computer Science, School of Science, Aalto University , and a member of the Helsinki Institute for Information Technology (HIIT) . His research focuses on theoretical computer science, particularly in algorithm design, exact and parameterized algorithms, algebraic algorithms, and combinatorics. Doctoral Degree in Engineering and Technology, Helsinki University of Technology (2005) Licentiate Degree in Engineering and Technology, Helsinki University of Technology (2002) Master's Degree in Engineering and Technology, Helsinki University of Technology (2001) His recent work explores tensor scaling, Johnson-Lindenstrauss transforms, Hamiltonian cycles, and computational complexity, with contributions to polynomial-time algorithms, finite field computations, and combinatorial optimization. Notable awards include the Best Paper Award at ICALP 2017 , an ERC Starting Grant (2014) , and the Kirkman Medal (2007) . He has served on scientific committees for conferences like STACS 2025 and ICALP 2024 , and collaborated with institutions such as the IT University of Copenhagen and Universität Regensburg . Key Research Areas : Theoretical Computer Science, Algorithm Design, Exact Algorithms, Algebraic Computation, Graph Theory, Combinatorics

• Theoretical Computer Science
• Algorithm Design
• Exact and Parameterized Algorithms
• +۵ مورد دیگر

Gianna Del Corso is an Associate Professor at the Department of Computer Science, University of Pisa. Her research interests span Quantum Computing, Numerical Linear Algebra, and Spectral Analysis. She has advised PhD students in quantum computing topics such as quantum algorithms and machine learning. Her teaching includes courses on Numerical Calculus, Parallel Scientific Computing, and Introduction to Quantum Computing, delivered across multiple academic years at the University of Pisa. She has also contributed to advanced courses in the PhD program in Computer Science. Her research focuses on quantum algorithms for machine learning, quantum walks, eigenvalue computation of structured matrices, and spectral techniques for web analysis. Recent work includes applications of quantum k-means clustering and variance estimation subroutines. Her publications span quantum computing, numerical methods, and scientific citation models. Her articles highlight contributions to PageRank computation, matrix factorization for recommendation systems, and analysis of citation-based research evaluation models. She has actively engaged in international conferences, presenting on topics such as orthogonal iterations for nonlinear eigenvalue problems and quantum hitting time algorithms. Labs/Teams: Research conducted within the Department of Computer Science at the University of Pisa, focusing on quantum computing and numerical methods.

• Quantum Computing
• Numerical Linear Algebra
• Spectral Analysis
• +۳ مورد دیگر

Luis Ferroni is a Tenure-track Assistant Professor in the Department of Mathematics at Università di Pisa since April 2025. He concurrently holds a Postdoctoral Member position at the Institute for Advanced Study (IAS) in Princeton, New Jersey, under the mentorship of June Huh. Previously, he was a Postdoctoral Researcher at KTH Royal Institute of Technology (2022–2024) and earned his PhD in Mathematics from the University of Bologna (2018–2021), advised by Luca Moci. His Licentiate Degree in Mathematics was obtained from the Universidad Nacional de Córdoba (2013–2018). His research focuses on Algebraic Combinatorics , Matroid Theory , Polytopes , and Ehrhart Theory . Notable contributions include work on Ehrhart positivity, Kazhdan-Lusztig polynomials of matroids, and the Merino-Welsh conjecture. His research bridges combinatorial geometry, algebraic structures, and discrete mathematics. Ferroni has been awarded prestigious honors such as the Premio INdAM-UMI-SIMAI 2023 (for his PhD thesis on matroid polytopes), the Premio Mario Baldassarri 2023 (for his article on matroid non-Ehrhart positivity), and the Michele Cuozzo Prize 2022 for his thesis. He is also recognized for academic excellence during his undergraduate studies, including multiple top rankings at the Universidad Nacional de Córdoba. His teaching experience spans roles as a Teaching Assistant (TA) and Tutor at institutions like the University of Bologna and KTH. He has taught courses such as Enumerative Combinatorics and Geometry. Ferroni actively participates in academic outreach, serving as a jury member for the CIMA Olympiad and coaching programming teams in international competitions like the ICPC World Finals. He has presented at leading venues including the Harvard/MIT Combinatorics Seminar, the Institute for Pure & Applied Mathematics (UCLA), and international conferences like the British Combinatorial Conference. His work appears in top journals such as Advances in Mathematics , SIAM Journal on Discrete Mathematics , and Combinatorial Theory .

• Algebraic Combinatorics
• Matroid Theory
• Polytopes
• +۳ مورد دیگر

André Nusser is a CNRS Researcher affiliated with the COATI group at Inria Center, Université Côte d’Azur. His work focuses on algorithms, computational geometry, and metric space analysis, particularly around the Fréchet distance, dynamic time warping, and graph hyperbolicity. Current Position: CNRS Researcher at Inria Université Côte d’Azur Primary Research Areas: Algorithms & Complexity, Computational Geometry, Metric Space Analysis Research Focus: André's research explores geometric optimization problems, trajectory analysis, and fine-grained complexity. Key contributions include advancements in dynamic time warping under translation, diameter computation for intersection graphs, and efficient algorithms for polygon partitioning. Awards & Recognition: Recipient of the Best Paper Award at VLDB 2014, Honorable Mention at AAAI 2014, and Best Poster Runner-up at SIGSPATIAL 2019. His work on Hausdorff distance and graph hyperbolicity has been invited to special issues. Academic Collaborations: Co-author on over 20 publications across conferences like STOC, SoCG, SODA, ESA, and journals including ACM Transactions on Algorithms and Discrete & Computational Geometry. Collaborates with leading researchers in computational geometry and algorithms. Software Advocacy: Actively promotes free software in research, highlighting tools like Ipe, Xournal++, Zotero, and Zulip for scientific productivity and collaboration.

• Algorithms and Complexity
• Computational Geometry
• Dynamic Time Warping
• +۴ مورد دیگر

Istvan Tomon is an Associate Professor in the Department of Mathematics and Mathematical Statistics at Umeå University in Sweden. His research focuses on discrete mathematics, extremal and probabilistic combinatorics, and geometry. He leads research in combinatorial structures and graph theory, with recent work exploring hereditary families, symmetric chain decompositions, and Zarankiewicz problems. His publications demonstrate broad expertise in combinatorial optimization, hypergraph theory, and geometric combinatorics. Recent articles show consistent focus on extremal problems in set systems, matrix combinatorics, and incidence geometry.

• Discrete Mathematics
• Extremal and Probabilistic Combinatorics
• Geometry