Find Academic Supervisors

Anupam GuptaView profile

Professor

• Theoretical Computer Science
• Algorithms
• Approximation Algorithms
• +4 more

Anupam Gupta is a Silver Professor at the Department of Computer Science, Courant Institute of Mathematical Sciences, New York University. Previously, he was affiliated with Carnegie Mellon University. His academic journey includes a Ph.D. from the University of California, Berkeley (2000) and a B.Tech. from the Indian Institute of Technology, Kanpur (1996). Education : Ph.D., University of California, Berkeley (2000) B.Tech., Indian Institute of Technology, Kanpur (1996) Research Interests : Anupam's research lies at the intersection of theoretical computer science and algorithm design. He focuses on approximation algorithms for stochastic and online environments, metric embeddings, and algorithmic problems in network design, clustering, and optimization. His work bridges theoretical insights with practical applications in uncertain and dynamic settings. Publications & Trends : His recent publications highlight advancements in online algorithms with adversarial corruptions, stochastic optimization, and approximation techniques for problems like k-server, set cover, and graph searching. Key trends include leveraging predictions, balancing adaptivity and robustness, and exploring the interplay between machine learning and classical algorithm design. Scientific Awards : ACM Fellow (2021) Alfred P. Sloan Research Fellowship NSF CAREER Award Herb Simon Award for Teaching Excellence (Carnegie Mellon University) Advising & Grants : He has mentored numerous Ph.D. students and postdoctoral fellows. His research is supported by grants from the National Science Foundation (NSF), including a CAREER Award, and collaborative funding for algorithmic initiatives like the Simons Institute program and the Joint Indo-US Networked Center for Algorithms under Uncertainty.

Michael A. ZazanisView profile

Professor

• Applied Probability
• Queueing Systems
• Stochastic Simulation
• +4 more

Michael A. Zazanis is a Professor in the Department of Statistics at the Athens University of Economics and Business (AUEB), where he has been a faculty member since 1997. He previously held positions as Assistant Professor at Northwestern University (1986-1993) and Associate Professor at the University of Massachusetts, Amherst (1993-1997). Dr. Zazanis received his Engineering Diploma from the National Technical University of Athens (1982), followed by an M.Sc. (1983) and Ph.D. (1986) in Applied Mathematics from Harvard University. His academic journey reflects a strong foundation in both engineering and theoretical mathematics. His research focuses on Applied Probability, Queueing Systems, Stochastic Simulation, and applications in Manufacturing and Risk Management. Over his career, his work has evolved from foundational perturbation analysis of queueing systems to contemporary research on age-of-information metrics in communication networks. His contributions span theoretical developments in stochastic processes and practical applications in production control systems and risk analysis. Dr. Zazanis has published extensively in leading journals including Journal of Applied Probability, Stochastic Processes and their Applications, Operations Research, Management Science, and Queueing Systems. His 1988 paper in Management Science on perturbation analysis for the M/G/1 queue is considered seminal in the field. Best Publication Award from the TIMS College on Simulation (1990) He has served in administrative roles including Graduate Program Director (2003-2006) and Head of the Statistics Department (2006-2008) at AUEB. Dr. Zazanis teaches undergraduate courses in Mathematical Methods, Stochastic Processes, and Probabilities, as well as graduate courses in Advanced Stochastic Processes and Operations Research. He is married to Corinna Anastassakou and has one son, Aristomenes.

Richard M. KarpView profile

Professor

• Computational Biology
• Algorithms
• Genomics
• +3 more

Richard M. Karp is a Professor at the University of California, Berkeley, holding the Class of 1939 Chair in the Department of Electrical Engineering and Computer Sciences within the College of Engineering. He has been affiliated with UC Berkeley from 1968-1994 and again from 1999 to present, and has also served as a Research Scientist at the International Computer Science Institute in Berkeley since 1988. His career spans over five decades, beginning with his time at IBM Research from 1959-1968. His educational background includes a Ph.D. in Applied Mathematics from Harvard University (1959), an S.M. in Applied Mathematics (1956), and an A.B. in Mathematics (1955), all from Harvard. Karp's research spans multiple domains with a focus on algorithmic methods in genomics and computer networking . His work integrates theoretical computer science with practical applications in biological systems. He has made significant contributions across three primary research areas: Biosystems & Computational Biology (BIO), Operating Systems & Networking (OSNT), and Theory (THY). His interdisciplinary approach connects computational theory with real-world problems in molecular biology, network design, and combinatorial optimization. His early work in theoretical computer science laid foundations for complexity theory, while his later work has focused increasingly on computational biology applications. His research has been supported through affiliations with the Center for Computational Biology (CCB), Industrial Engineering and Operations Research (IEOR), and the Simons Institute for the Theory of Computing (SITC). Among his numerous honors are the Turing Award, National Medal of Science, Kyoto Prize, Von Neumann Theory Prize, and membership in multiple prestigious academies including the U.S. National Academies of Sciences and Engineering, the American Philosophical Society, and the French Academy of Sciences. Karp has supervised thirty-six Ph.D. students throughout his career, contributing significantly to the development of new generations of computer scientists. His work has been supported by numerous research grants across theoretical computer science, computational biology, and network theory. He has been instrumental in establishing interdisciplinary research programs that bridge computer science with biological sciences. He has been actively involved with the International Computer Science Institute in Berkeley since 1988, contributing to research teams focused on theoretical computer science and its applications to biological problems. His work has often involved collaborative teams spanning multiple disciplines, particularly in the field of computational biology where computer scientists work alongside biologists and medical researchers.

Niv BuchbinderView profile

Professor

• Combinatorial Optimization
• Online Algorithms
• Algorithmic Game Theory
• +2 more

Prof. Niv Buchbinder is a faculty member in the Department of Statistics and Operations Research at the School of Mathematical Sciences, Tel Aviv University. His research centers on algorithmic solutions for combinatorial optimization in offline and online contexts, with significant contributions to primal-dual methodologies and algorithmic game theory. His academic background includes a Ph.D. in Computer Science from the Technion (2008) under Prof. Seffi Naor and an M.Sc. in Computer Science from the Technion (2003) under Prof. Erez Petrank. Key research areas encompass Combinatorial Optimization, Online Algorithms, Algorithmic Game Theory, Primal-Dual Methods, and Submodular Optimization, focusing on competitive analysis for problems like set cover, ad-auctions, and caching. Recent publications (2012-2015) reveal a concentrated effort in submodular optimization and online decision-making, with applications in advertising, resource allocation, and machine learning. These works consistently employ primal-dual frameworks to achieve strong competitive ratios in adversarial settings. Scientific recognition includes: Best Paper Award at ESA 2007 for “Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue” Best Paper Award at FOCS 2011 for “A Polylogarithmic Competitive Algorithm for the k-Server Problem” No information is available regarding student advising or research grants. Similarly, details about laboratory facilities, research teams, or future projects are not provided in the source materials.

Wojciech SamotijView profile

Associate Professor

• Extremal Combinatorics
• Probabilistic Combinatorics
• Ramsey Theory
• +3 more

Wojciech Samotij is an Associate Professor at the School of Mathematical Sciences, Tel Aviv University. His research focuses on extremal and probabilistic combinatorics, Ramsey theory, large deviation theory, and additive number theory. He has held positions including Junior Research Fellow at Trinity College, University of Cambridge (2010–2014), and Post-doctoral researcher at Tel Aviv University (2010–2011, 2012–2013). PhD in Mathematics (2010), University of Illinois at Urbana-Champaign, supervised by Jozsi Balogh M.Sc. in Mathematics and Computer Science (2007), University of Wrocław His recent work explores large deviation principles in random graphs, hypergraph containers, and extremal problems in probabilistic settings. Publications span journals like Annals of Probability , Duke Mathematical Journal , and Transactions of the American Mathematical Society , with key contributions to Ramsey-type theorems and entropy-based combinatorial analysis. He has supervised graduate students in topics ranging from additive combinatorics to random graph theory, and taught courses including Probabilistic Methods in Combinatorics, Graph Theory, and Discrete Mathematics. His email contact is samotij@tauex.tau.ac.il and samotij@post.tau.ac.il .

Sergei KorotkikhView profile

Visiting Assistant Professor

• Algebraic combinatorics
• Integrable probability
• Representation theory
• +1 more

Sergei Korotkikh serves as a Morrey Visiting Assistant Professor in the Department of Mathematics at the University of California, Berkeley's College of Letters and Science. Appointed in 2023, he contributes to the department's research and teaching mission in pure mathematics. Dr. Korotkikh's research focuses on several interconnected areas of pure mathematics. His primary interests include: Algebraic combinatorics Integrable probability Representation theory Vertex models His work bridges combinatorial structures with probabilistic methods and algebraic frameworks, contributing to the understanding of complex mathematical systems through multiple theoretical lenses. These research areas represent cutting-edge developments in pure mathematics with connections to theoretical physics and statistical mechanics. Professor Korotkikh maintains an active research program while fulfilling his teaching responsibilities in the mathematics department. He can be reached at korotkikh@berkeley.edu in his office at 843 Evans Hall.

Vince LyzinskiView profile

Associate Professor

• Statistical Network Inference
• Graph Matching
• Vertex Nomination
• +6 more

Vince Lyzinski is an Associate Professor in the Department of Mathematics at the University of Maryland, College Park, with additional affiliations in the Applied Mathematics, Statistics, and Scientific Computation (AMSC) program. His work spans statistical network inference, graph matching algorithms, and machine learning applications to complex networks. Ph.D. in Applied Mathematics and Statistics (2013), M.S.E. (2011), and M.A. (2007) from Johns Hopkins University B.S. in Mathematics from University of Notre Dame (2006) His research focuses on statistical network inference , particularly graph matching and vertex nomination , with applications to connectomics and adversarial activity analytics. Supported by DARPA MAA , AFOSR , and JHU HLTCOE , he develops algorithms like iGraphMatch for graph alignment and analysis. Recent publications (2025-2023) explore vertex label error impacts, network trimming for robustness, and stochastic blockmodel extensions. Key papers include "Asymptotically Perfect Seeded Graph Matching" and "ACRONYM: Augmented Degree-Corrected Network Models" . Scientific Awards : Best Paper Award at GTA3 2018 Workshop He has advised 13 Ph.D. students and 1 postdoc across UMD , JHU , and Texas A&M , including Keith Levin (now at UW-Madison) and Jesus Arroyo (now at Texas A&M). His DARPA-funded team includes researchers from UMass, UMD, BU, and JHU.

Steve ButlerView profile

Professor

• Spectral Graph Theory
• Enumerative Combinatorics
• Mathematics of Juggling
• +3 more

Steve Butler is a Professor and the Barbara J. Janson Professor in the Department of Mathematics at Iowa State University. His research focuses on spectral graph theory, combinatorics, and the mathematics of juggling. He earned his Ph.D. from UC San Diego (2008) under Fan Chung and completed an NSF Postdoc at UCLA with Benny Sudakov. Research Interests: Spectral Graph Theory: Studies eigenvalues of graph matrices, equitable partitions, and Laplacian properties. Recreational Mathematics: Explores mathematical patterns in juggling, card shuffling, and performance. Combinatorics: Investigates Eulerian numbers, distance matrices, and graph automorphisms. Scientific Awards: Barbara J. Janson Professorship (2017) LAS Early Achievement in Teaching Award (2014) Cassling Family Faculty Award (2014) MAA Iowa Section Award for Distinguished Teaching (2015) NSF Postdoctoral Fellowship (2008-2011) Advising and Outreach: Butler actively collaborates with students, producing educational videos and organizing undergraduate research initiatives. He served as Iowa State's calculus coordinator (2018-2020) and contributes to outreach programs for young STEM enthusiasts.

Nina C SnaithView profile

Professor

• Random Matrix Theory
• Number Theory
• Mathematical Physics
• +5 more

Professor Nina C Snaith is affiliated with the University of Bristol as a Professor of Mathematical Physics in the School of Mathematics . Her work bridges Random Matrix Theory with Number Theory , focusing on eigenvalue statistics and connections between characteristic polynomials and functions like the Riemann zeta function and L-functions. Research Interests : Snaith investigates how Random Matrix Theory techniques can analyze zeros of number-theoretical functions, particularly elliptic curve L-functions. Her research spans eigenvalue distributions, asymptotics, and combinatorial methods in matrix determinant analysis. Scientific Awards : LMS Whitehead Prize (2008) Supervision & Grants : She has supervised 7 PhD students and led projects such as RANDOM MATRIX THEORY AND NUMBER THEORY: DISTRIBUTION OF PRIMES AND HIGHER ORDER VANISHING OF L-FUNCTIONS (2005-2009) and a fellowship (2004-2010), supported by grants focused on L-functions, elliptic curves, and random matrix ensembles.

Joseph S.B. MitchellView profile

Professor

• Computational Geometry
• Algorithms and Data Structures
• Optimization
• +3 more

Joseph S.B. Mitchell is a SUNY Distinguished Professor at the Department of Applied Mathematics and Statistics, State University of New York at Stony Brook. His office is located in Math Tower, Room P-138A. His research spans computational geometry, algorithms, optimization, and related fields. Research Interests: Prof. Mitchell's work focuses on fundamental and applied problems in geometric computing, including: Algorithm design for spatial optimization (e.g., art gallery problems, dispersion) Robotics applications (multi-agent path planning, sensor deployment) Efficient solutions for geometric data structures and visibility constraints Recent Publications: His 15 most recent articles (2024-2025) demonstrate a consistent focus on geometric optimization, visibility problems, and algorithm design for polygons and networks. Common themes include approximation algorithms, multi-robot coordination, and combinatorial solutions for spatial challenges. Awards: SUNY Distinguished Professor (recognizing exceptional academic contributions)

Emil Petkov KamenovView profile

Assistant Professor

• Probability
• Operations Research
• Statistics
• +3 more

Emil Petkov Kamenov serves as an Assistant Professor in the Department of Probability, Operations Research and Statistics at the Faculty of Mathematics and Informatics, Sofia University 'St. Kliment Ohridski', where he maintains an office in room FMI-510 and can be contacted via phone at +359 2 8161-543. His research program centers on combinatorial probability and number-theoretic structures, with deep specialization in integer partition theory, plane partitions, and asymptotic enumeration methods. Dr. Kamenov investigates probabilistic behaviors of partition components, structural properties of random partitions, and asymptotic distributions in discrete combinatorial systems, bridging theoretical probability with analytic number theory. Analysis of his publications reveals a consistent focus on asymptotic methodologies applied to partition combinatorics, particularly examining large distinct parts in random integer partitions (2001) and enumeration of plane partitions through asymptotic formulas (2006). These works demonstrate rigorous application of analytic combinatorics to solve complex enumeration problems in discrete mathematics. While no scientific awards or student advisement records appear in the source material, his scholarly contributions reflect sustained engagement with fundamental problems in combinatorial mathematics through collaborative research, as evidenced by his co-authored publication with L. Mutafchiev.

T. Kyle PetersenView profile

Professor

• Combinatorics
• Enumerative Combinatorics
• Algebraic Combinatorics
• +1 more

T. Kyle Petersen is Professor and Chair of the Department of Mathematical Sciences at DePaul University's College of Science and Health, where he serves as a full-time faculty member specializing in combinatorics research and education. Education history: AB, Washington University in St. Louis PhD, Brandeis University (2006), supervised by Ira Gessel Research focuses on core and specialized areas of combinatorics: Enumerative Combinatorics : Counting methods and sequence analysis Algebraic Combinatorics : Algebraic structures in discrete mathematics Topological Combinatorics : Geometric and topological approaches Recent publications (2019-2021) demonstrate broad engagement with combinatorial theory and applications—including permutation studies (Sós Permutations), probabilistic card shuffling models, geometric puzzle theory, Coxeter group analysis, and inquiry-based learning frameworks. This work consistently bridges theoretical foundations with educational innovation. Beyond research, Dr. Petersen actively contributes to pedagogical advancement through the Academy of Inquiry-Based Learning, promoting student-centered mathematics education.

Jérémie BourdonView profile

Professor

• Bioinformatics
• Probabilistic modeling
• Systems biology
• +5 more

Professor Jérémie Bourdon is a Full Professor of Computer Science at the University of Nantes, Faculty of Science and Technology, where he serves as Vice-Dean in charge of Research, Innovation and International Relations since 2018. He is affiliated with LS2N (Laboratory of Digital Sciences of Nantes, UMR 6004) and heads the ComBi research group (Combinatorics and Bioinformatics) since January 2014. His research focuses on the application of probabilistic methods in bioinformatics, particularly in systems biology. Professor Bourdon's work spans from Number Theory to Systems Biology with a common thread of developing and using probabilistic tools. His main research activities include dynamical analysis of algorithms and systems biology modeling, where he has developed the transition event graph model to integrate quantitative and qualitative biological data. Professor Bourdon's recent publications demonstrate consistent output in high-impact journals including Nature Communications, PLOS Computational Biology, and BMC Systems Biology, with research trends showing increasing focus on metabolic network analysis, multi-omics data integration, and constraint-based modeling approaches. Academic Editor for PLOS One Co-chair of CMSB 2015 international conference Member of Biogenouest scientific council (2004-2017) Co-scientific responsible for BiRD bioinformatics platform Professor Bourdon has secured significant research funding including the 1.4M€ GRIOTE project and participation in multiple ANR/CNRS projects. He has supervised 9 PhD students, typically through co-direction arrangements, reflecting his collaborative research approach. His ComBi group consists of 12 members including professors, assistant professors, PhD students, post-docs, and engineers, working on diverse topics in bioinformatics and computational biology. The ComBi research group, led by Professor Bourdon since 2014, focuses on combinatorics and bioinformatics with activities centered around comparative genomics and systems biology. The group provides a collaborative environment for interdisciplinary research at the intersection of computer science and biology, with strong connections to biological research teams and access to computational resources through the BiRD platform.

Carles Noguera ClofentView profile

Associate Professor

• Mathematical Logic
• Many-valued Logics
• Fuzzy Logic
• +3 more

Carles Noguera Clofent serves as Associate Professor in the Department of Information Engineering and Mathematics at the University of Siena since 2022. His academic trajectory includes lecturing at the University of Lleida (2006-2007), postdoctoral research at the University of Siena (2007-2009), junior research at the Artificial Intelligence Research Institute (2009-2012), and scientist positions at the Czech Academy of Sciences (2013-2022) where he led funded projects and taught at Charles University. His educational foundation comprises: Mathematics degree from University of Barcelona (2001) Ph.D. in Logic and Foundations of Mathematics from University of Barcelona (2006) Philosophy degree from University of Barcelona (2007) A logician bridging mathematics, philosophy, and computer science, his research pioneers algebraic structures in many-valued logics with applications in AI. Key contributions include fuzzy logic semantics, temporal reasoning systems, and probabilistic truth-value frameworks, establishing him as a leading theorist in non-classical logics. Analysis of his 2024-2025 publications reveals sustained innovation in many-valued logic foundations, with growing emphasis on computational applications. Work spans pure theory (e.g., asymptotic truth-value laws) to implementable systems (e.g., tableau methods for interval temporal logic), demonstrating seamless integration of abstract mathematics with AI/CS challenges. He has directed multiple research projects at the Czech Academy of Sciences while maintaining teaching commitments in Prague institutions. Current advising activities and grant details beyond the Czech period remain unspecified in available materials. His institutional affiliations highlight enduring ties to the Artificial Intelligence Research Institute (IIIA-CSIC) and Czech Academy of Sciences, where he developed core methodologies later refined at Siena for logic-based AI systems.

Daniel KráľView profile

Professor

• Discrete Mathematics
• Graph Theory
• Combinatorics
• +7 more

Daniel Kráľ is an Alexander von Humboldt Professor for Discrete Mathematics at Leipzig University and an affiliated member of the Max Planck Institute for Mathematics in the Sciences (MPI MiS). Previously, he held the Donald Ervin Knuth Professorship at Masaryk University in Brno and is also an honorary professor at the University of Warwick, where he was a professor of mathematics and computer science and a member of the Centre for Discrete Mathematics and its Applications (DIMAP). His research addresses various topics at the interface of mathematics and computer science, with primary focus on structural and extremal graph theory, discrete algorithms, and combinatorial limits. The theory of combinatorial limits is an emerging area that provides analytic methods to study large graphs such as social networks, establishing new links between analysis, combinatorics, ergodic theory, group theory and probability theory. His work has been supported by prestigious ERC grants including the CCOSA Starting grant and LADIST Consolidator grant. Dr. Kráľ's scholarly output includes over 150 journal research papers and numerous conference contributions. His recent publications demonstrate continued leadership in extremal combinatorics, graph limits, and structural graph theory, with significant contributions to understanding quasirandomness, Turán densities, and the coloring of complex graph structures. Scientific Recognition: SIAM Fellow (2024) Fellow of the American Mathematical Society (2020) Philip Leverhulme Prize in Mathematics and Statistics (2014) European Prize in Combinatorics (2011) ERC Consolidator grant LADIST (2015-21) ERC Starting grant CCOSA (2010-15) Professor Kráľ has supervised numerous PhD students and postdoctoral fellows throughout his career. His editorial service includes Editor-in-Chief of SIAM Journal on Discrete Mathematics (2017-2022), Co-Editor-in-Chief of Journal of Combinatorial Theory (since 2025), and Managing editor of Advances in Combinatorics (since 2018). He has organized multiple international workshops and conferences including Oberwolfach workshops on Graph Theory and the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23).