جست‌وجوی استاد و پژوهشگر

• Combinatorics
• Discrete Mathematics
• Positional Games
• +۷ مورد دیگر

Dennis Clemens is a researcher in the Institute of Mathematics at Hamburg University of Technology, where he leads and contributes to research in discrete mathematics, particularly in the Chair of Discrete Mathematics. His work centers on combinatorial game theory, extremal combinatorics, and probabilistic methods in graph theory. Research Interests: His research spans positional games (Maker-Breaker, Waiter-Client, Walker-Breaker), Ramsey theory , random graphs , and graph packing . He investigates structural properties of games on random and perturbed graphs, size-Ramsey numbers, and extremal problems in hypergraphs. Publications Trends: His recent publications (2021–2024) show a strong focus on game-theoretic models over random structures, with frequent collaborations. Key themes include fast winning strategies, universality, connectivity, and Ramsey-type problems. Scientific Awards: No specific awards mentioned in the provided texts. Advising and Grants: While no explicit list of advisees or grants is given, his role as a research leader suggests involvement in mentoring students and securing research funding, likely supported by institutions such as the Simons Foundation (acknowledged in arXiv). Labs and Teams: He is affiliated with the Discrete Mathematics group at TUHH, contributing to collaborative research in combinatorics. He participates in academic networks such as the SIAM & GAMM Chapter Hamburg and workshops on Operator Theory, indicating active engagement in the mathematical community.

Anna Seigalمشاهده پروفایل

استادیار

• Applied Algebraic Geometry
• Algebraic Statistics
• Tensors and Multilinear Algebra
• +۵ مورد دیگر

Anna Seigal is an Assistant Professor of Applied Mathematics at Harvard University's School of Engineering and Applied Sciences (SEAS), with an affiliation in the Department of Statistics. Her research focuses on applied algebraic geometry, tensors, multilinear algebra, and algebraic statistics, particularly in the context of data science. She explores algebraic approaches to data analysis, including matrix/tensor factorizations, parameter estimation, causal inference, and optimization, with applications to physical and biological systems. Her work is supported by the Sloan Foundation and Harvard's Dean’s Competitive Fund. Research Interests: Algebraic statistics, tensors and multilinear algebra, applied algebraic geometry, and the mathematics of data science. She investigates group symmetries in models, dimensionality reduction techniques, and machine learning algorithms. Current projects include causal disentanglement via cumulants and invariant theory applications to maximum likelihood estimation. Her academic contributions span theoretical advancements and interdisciplinary applications, such as genomic template analysis and COVID-19 molecular phenotyping. She collaborates with postdocs and students on research projects and teaches courses like Applied Math 210. Awards and Funding: Supported by the Alfred P. Sloan Foundation and Harvard's internal grants. No explicit named awards listed, but her research is institutionally recognized. Labs/Teams: Leads a research group focused on applied algebra and geometry in data science. Collaborates across departments in SEAS and the Statistics Department.

• Combinatorics
• Graph Theory
• Extremal Graph Theory
• +۴ مورد دیگر

Asaf Shapira is a Professor at the School of Mathematical Sciences, Tel-Aviv University. His research focuses on combinatorics, graph theory, and extremal problems, with notable contributions to Ramsey theory, probabilistic methods, and algorithmic applications. He has authored over 50 publications in top-tier journals and has taught advanced courses such as Extremal Graph Theory and Probabilistic Methods in Combinatorics. His research interests include extremal combinatorics, hypergraph theory, and structural graph theory. Recent work includes advancements in removal lemmas, partition properties, and algorithmic testing of graph properties. Shapira has also contributed to foundational results in property testing and combinatorial optimization. His teaching spans undergraduate and graduate levels, covering topics like combinatorial analysis, algebraic methods, and advanced algorithms. While no explicit awards are listed, his extensive publication record reflects significant scholarly impact.

Wei Qianمشاهده پروفایل

دانشیار

• High-dimensional statistics
• Sequential decision making
• Model selection
• +۱۰ مورد دیگر

Wei Qian is an Associate Professor of Statistics at the Department of Applied Economics and Statistics, University of Delaware, affiliated with the College of Agriculture & Natural Resources. He is also an affiliated faculty member of the Data Science Institute at the University of Delaware. Education: Ph.D. in Statistics, minor in Mathematics, University of Minnesota, Twin Cities, 2014 M.S. in Chemistry, Stanford University, 2008 B.S. in Chemistry, Peking University, Beijing, 2006 His research focuses on high-dimensional statistics, sequential decision making, model selection, dimension reduction, nonparametric and semiparametric estimation, statistical computing, actuarial statistics, and deep learning. His work addresses complex data analysis challenges across domains like insurance, epidemiology, and network modeling. Recent publications emphasize machine learning applications in Hypergraph Neural Networks Multi-armed Bandit Problems Gender Equity in Hiring Covid-19 Epidemiological Modeling Interbank Network Risk Analysis High-dimensional Censored Data Scientific Awards: JPMC Fellow, Institute for Financial Services Analytics, University of Delaware (2017 -- present) Grants: NSF DMS funding support

Chelsea Edmondsمشاهده پروفایل

پژوهشگر

• Formal Methods
• Proof Assistants (Isabelle/HOL)
• Combinatorics
• +۳ مورد دیگر

Chelsea Edmonds is a Researcher in the Department of Computer Science at the University of Sheffield, working on the COVERT project focusing on formal verification and security. She completed her PhD at the University of Cambridge under Prof. Larry Paulson, formalising combinatorial structures in Isabelle/HOL. Previously, she was a Software Engineer at Boeing Australia and holds a dual degree from the University of Queensland. Education: PhD in Computer Science (University of Cambridge), 2024 Bachelor of Engineering (Software) & Bachelor of Science (Mathematics), University of Queensland, 2017 (First Class Honours, University Medal) Research Interests: Formal methods, proof assistants, combinatorial mathematics formalisation, security verification, and HCI aspects of theorem proving tools. Key contributions include probabilistic combinatorial formalisation and modular library design in Isabelle/HOL. Publications: Over 10 peer-reviewed papers, including work on the Lovász Local Lemma, Balog-Szemerédi-Gowers theorem, and Fisher’s inequality formalisation. Her research bridges theoretical mathematics and applied verification. Awards: Cambridge Australia Scholarship, British Federation of Women Graduates Academic Award, Distinguished Paper at CPP 2024. Active in outreach, including leadership roles in Women@CL and Robogals.

Robert Baileyمشاهده پروفایل

دانشیار

• Discrete Mathematics
• Algebraic Graph Theory
• Combinatorial Design Theory
• +۷ مورد دیگر

Robert Bailey is an Associate Professor of Mathematics at the School of Science and the Environment, Grenfell Campus, Memorial University, with a cross-appointment to the Department of Mathematics and Statistics in St. John's. He joined Grenfell in 2013 after postdoctoral positions at Ryerson University, the University of Regina, and Carleton University. Education : M.Math. (Hons.) from the University of Leeds (2002), Ph.D. from Queen Mary, University of London (2006), with an exchange year at the University of Waterloo. Research Interests center on discrete mathematics, particularly algebraic graph theory, combinatorial design theory, and permutation groups. His work focuses on distance-regular graphs, metric dimension, error-correcting codes, and group theory, with applications in network modeling and computational combinatorics. Research Trends from his 15 most recent articles include advanced studies in metric dimension for polar and incidence graphs, classification of distance-regular structures, and innovative applications in coding theory and design theory. His interdisciplinary approach bridges pure mathematics with real-world problems in computer networks and information theory. Scientific Awards NSERC Discovery Grant (2024-29) PIMS Postdoctoral Fellow (2009-11) University start-up grants and Seed Fund support Advising and Grants involve mentoring numerous undergraduate and postdoctoral researchers. His funded projects explore symmetry breaking, distance-regular graph databases, and combinatorial coding, supported by NSERC and institutional funds. Labs and Teams include the Distance-Regular Graph Database developed with students, and collaboration with the Combinatorics Group at St. John's campus. He organized major conferences like the 16th East Coast Combinatorics Conference (2024) and Symmetry Breaking in Discrete Structures (2018).

Adva Mondمشاهده پروفایل

پژوهشگر

• Discrete Probability
• Random Graphs
• Extremal Combinatorics
• +۳ مورد دیگر

Adva Mond is a Researcher in the Department of Mathematics at King's College London, affiliated with the Probability Group within the Faculty of Natural, Mathematical & Engineering Sciences. She holds a PhD from the University of Cambridge, supervised by Professor Béla Bollobás, and a postdoctoral position under Dr. Matthew Jenssen. Her research focuses on Discrete Probability, Random Graphs, and Extremal Combinatorics, with a particular emphasis on probabilistic combinatorics and graph theory applications. Education: BSc and MSc in Pure Mathematics, Tel Aviv University Part III Mathematics, University of Cambridge PhD in Combinatorics, University of Cambridge Research Interests: Adva's work explores theoretical and applied aspects of combinatorics, including random graph structures, extremal problems, and probabilistic methods. She investigates properties of Hamiltonian cycles, graph decomposition, and percolation processes. Her recent studies address spanning forests, discrepancy in dense graphs, and game-theoretic approaches to combinatorial problems. Publications: Over 10 peer-reviewed articles and preprints, focusing on probabilistic combinatorics, graph algorithms, and extremal graph theory. Key contributions include work on Hamiltonian cycles in hypergraphs, online Ramsey numbers, and percolation games on random graphs. Labs/Teams: Active member of the Probability Group at King's College London, collaborating with institutions globally on interdisciplinary projects in combinatorics and graph theory.

Michael Gentnerمشاهده پروفایل

پژوهشگر

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +۲ مورد دیگر

Dr. Michael Gentner is a researcher at the Institute of Optimization and Operations Research, Ulm University, where he teaches courses including Angewandte Diskrete Mathematik (Combinatorics) and Advanced Discrete Algorithms. His institutional contact details include office Helmholtzstr. 18, Room 1.47, with Thursday office hours (14:00-16:00) and phone number +49 731 50-23637. His primary research focuses on structural graph theory and combinatorics, with expertise in domination theory, independence number, zero forcing sets, and extremal graph problems. Gentner investigates properties of graphs through degree sequences, clustering coefficients, and dynamic monopolies, particularly in specialized graph classes like forests and graphs without short cycles. Analysis of his 2015-2018 publications reveals consistent emphasis on establishing bounds and extremal values for graph invariants. His work bridges theoretical combinatorics with applications in network science, frequently collaborating with Dieter Rautenbach and other researchers in the field. Scientific Awards No scientific awards or honors were mentioned in the provided information. Advising and Grants No details regarding student supervision, PhD advisees, or research grants were found in the source material. Labs and Teams Gentner operates within Ulm University's Institute of Optimization and Operations Research, though specific laboratory structures or research team compositions are not detailed in the available text.

Gabor N Sarkozyمشاهده پروفایل

استاد

• Graph Theory
• Discrete Mathematics
• Theoretical Computer Science
• +۳ مورد دیگر

Gabor N Sarkozy is a Professor in the Department of Computer Science at Worcester Polytechnic Institute (WPI). He holds a PhD from Rutgers University (1994) and completed a postdoc at the University of Pennsylvania (1994-1996). His research focuses on graph theory, discrete mathematics, and theoretical computer science, particularly the structure of large graphs and Ramsey-type problems. Education: BS, Eötvös University (1990); MS, PhD, Rutgers University (1994); Postdoc, University of Pennsylvania (1994-1996) His scholarly work spans over 100 publications, with notable collaborations with Endre Szemerédi, János Komlós, and András Gyárfás. Key contributions include algorithmic applications of the Blow-up Lemma, monochromatic cycle partitions, and advancements in Ramsey theory for hypergraphs and planar graphs. Professional highlights include the Good Teaching Award (1995) and the Doctor of the Hungarian Academy of Sciences (2009). He founded the Budapest Project Center, WPI's first project center in Eastern Europe, and remains actively engaged in educational data mining projects. Scientific Awards Good Teaching Award, 1995 Doctor of the Hungarian Academy of Sciences, 2009 His research trends over the past two decades show a transition from classical Ramsey theory and graph decomposition (1995-2010) to interdisciplinary applications in time series analysis and educational data mining (2011-2024), while maintaining core contributions to combinatorial graph theory. Advising and grants are not explicitly detailed in the provided texts, though his collaborative nature is evident through extensive co-authorships. He maintains active research groups at WPI and the Rényi Institute, with ongoing projects in Ramsey-type problems and algorithmic applications.

Istvan Tomonمشاهده پروفایل

دانشیار

• Discrete Mathematics
• Extremal and Probabilistic Combinatorics
• Geometry

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.

• Computational Social Science
• Data Science
• Multivariate Social Networks
• +۱۰ مورد دیگر

Termeh Shafie is a full-time Professor in the Department of Politics and Public Administration at the University of Konstanz, specializing in Computational Social Science and Data Science. With a strong statistical foundation, she develops advanced methodologies for analyzing multivariate social networks while bridging archaeological network reconstruction with modern data science techniques through projects like NEXUS 1492. Key Research Areas: Multigraph modeling, network entropy analysis, isotope geoprovenance, and hypergraph representations Projects: NEXUS 1492 archaeological network reconstruction Her 15 most recent publications demonstrate significant contributions to network methodology (random multigraph models, centrality index analysis), archaeological applications (Caribbean attack networks, Iroquoian settlement patterns), and data privacy frameworks. Articles span 2012–2025 with interdisciplinary focus on statistical sociology, archaeological theory, and computational modeling. Current teaching includes courses on social network analysis, data science, and statistical learning. Office hours available via ILIAS booking system. Contact details provided for both academic and administrative correspondence.

• Additive Combinatorics
• Number Theory
• Ramsey Theory
• +۳ مورد دیگر

Dr Jonathan Chapman is a Research Fellow at the Department of Mathematics, University of Warwick. His research focuses on additive combinatorics, Ramsey theory, and number theory, with particular emphasis on partition regularity, Diophantine equations, and combinatorial structures in number systems. His work bridges algebraic, analytic, and probabilistic methods to address problems in arithmetic Ramsey theory and additive patterns. Recent publications explore topics such as monochromatic solutions to multiplicative equations, additive Ramsey configurations over primes and non-integer sequences, and generalizations of classical Ramsey criteria like Rado and Roth theorems. His studies often involve intricate interplays between linear algebraic structures, syndetic sets, and hypergraph Ramsey phenomena. No scientific awards or grants are explicitly listed in available records. He currently holds no documented advisees, though his research likely involves collaboration with graduate students and postdocs in the Mathematics Institute. His affiliations include the Mathematics Institute at the University of Warwick, with office B2.28 and contact details available via institutional channels.

Ewan Daviesمشاهده پروفایل

استادیار

• Graph Theory
• Combinatorics
• Theoretical Computer Science
• +۱۱ مورد دیگر

Ewan Davies is an Assistant Professor in the Department of Computer Science at Colorado State University, where he conducts research at the intersection of combinatorics, theoretical computer science, and statistical physics. He has previously held positions as a Postdoctoral Researcher at CU Boulder, a Research Fellow at the Simons Institute, and a Postdoc at the University of Amsterdam. His educational background includes a Ph.D. in Mathematics from the London School of Economics and Political Science (2013–2017), an M.Math from the University of Cambridge (2012–2013), and a B.A. (Hons) in Mathematics from the University of Cambridge (2009–2012). Davies’s research focuses on probabilistic and extremal combinatorics, particularly in graph coloring, independent sets, partition functions, and spin models such as the hard-core and Potts models. He employs techniques from statistical physics, entropy compression, and the Lovász local lemma to develop algorithmic frameworks for coloring and counting problems. His work often bridges theoretical insights with practical algorithmic implications, especially in the context of approximate counting and sampling. The trends in his recent publications reveal a sustained focus on algorithmic graph theory, with major contributions to list packing, local graph degeneracy, and computational thresholds in spin systems. His work frequently appears in top-tier venues such as FOCS, STOC, ICALP, and journals like Random Structures & Algorithms and SIAM Journal on Computing . He has co-authored numerous papers with leading researchers in the field, including Ross J. Kang, Will Perkins, and Alexandra Kolla. Sampling and Optimization under Global Constraints, NSF Grant #2309707 PhD Prize for Outstanding Academic Performance, London School of Economics Mathematics Department New Teacher Prize, London School of Economics Foundation Scholarship and R.A. Watchman Prize, Jesus College, Cambridge Foundation Scholarship and Sir Harold Spencer Jones Prize, Jesus College, Cambridge Foundation Scholarship and Ware Prize, Jesus College, Cambridge Foundation Exhibition and Bronowski Prize, Jesus College, Cambridge Davies actively mentors students, having supervised multiple undergraduate and graduate research projects in areas such as redistricting and graph coloring. He is also involved in organizing academic workshops, including the upcoming Rocky Mountain Summer Workshop on Algorithms, Probability, and Combinatorics. His research is supported by the National Science Foundation, and he continues to contribute to both theoretical advances and interdisciplinary applications in computer science and mathematics. He leads research on graph structure via local occupancy, regularity inheritance in hypergraphs, and the algorithmic analysis of phase transitions in statistical mechanical models. His work on the occupancy fraction and fractional coloring has provided new insights into longstanding conjectures in graph theory.

• Distributed Algorithms
• Metric Graph Theory
• Theoretical Computer Science
• +۳ مورد دیگر

Jérémie Chalopin is a Directeur de Recherche (DR CNRS) at LIS (Laboratoire d'Informatique et Systèmes) in Marseille, where he is a member of the DALGO research team. His position at CNRS is affiliated with Aix-Marseille University, one of France's largest multidisciplinary universities. As a senior researcher with habilitation to supervise research (awarded in 2020), he plays a significant role in the French theoretical computer science community. Chalopin's research primarily focuses on distributed algorithms and metric graph theory , with substantial contributions to understanding the theoretical foundations of distributed computing systems and the geometric properties of graphs. His work bridges theoretical computer science with practical applications in mobile agent systems, programmable matter, and network algorithms. He has developed fundamental results in areas including leader election, graph exploration, metric embeddings, and sample compression schemes for graph structures. Analysis of his recent publications reveals a strong trend toward interdisciplinary work combining distributed computing with geometric graph theory. His research on balls in graphs has applications in machine learning, while his work on programmable matter addresses cutting-edge challenges in distributed robotics. The consistent high-quality output in top theoretical venues demonstrates sustained research productivity across multiple subfields. As a habilitated researcher at CNRS, Chalopin supervises PhD students and participates in research projects, though specific details about current students or grants aren't provided in the source material. His long-standing collaboration with Victor Chepoi (appearing in numerous publications) represents a significant research partnership in metric graph theory. Chalopin is based at LIS in the TPR2 building (office 05.28, 5th floor) where he works as part of the DALGO team, which focuses on algorithms and theoretical computer science. His research environment provides strong connections to both the French and international theoretical computer science communities through collaborations with researchers across Europe and beyond.

Nathan Lindzeyمشاهده پروفایل

استادیار

• Algebraic Combinatorics
• Graph Theory
• Discrete Mathematics
• +۳ مورد دیگر

Nathan Lindzey is an Assistant Professor in the Department of Mathematical Sciences at the University of Memphis. His research focuses on algebraic combinatorics, graph theory, and discrete mathematics, with particular emphasis on extremal combinatorics, permutation patterns, and computational complexity. He has published extensively on topics such as intersecting families of spanning trees, derangement graphs, and applications of algebraic methods in combinatorial optimization. Dr. Lindzey's work bridges theoretical foundations and practical applications, including studies on association schemes, semidefinite optimization, and harmonic polynomials. His recent articles address challenges in graph theory, coding theory, and algorithm analysis, reflecting a commitment to advancing interdisciplinary approaches in discrete mathematics. His research trends highlight contributions to understanding extremal problems in combinatorics, leveraging algebraic tools and computational techniques. Though no awards are explicitly listed, his prolific publication record underscores his active role in the academic community. Dr. Lindzey advises no listed students and has no documented grants in the provided text. He is affiliated with the University of Memphis' Mathematical Sciences department, contributing to both teaching and research initiatives in the field.