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

• Combinatorics
• Algebraic Combinatorics
• Rational Catalan Numbers
• +۵ مورد دیگر

Drew Armstrong is an Associate Professor in the Mathematics Department of the College of Arts and Sciences at the University of Miami. His academic career is centered on combinatorial mathematics with significant contributions to rational Catalan combinatorics and related fields. His research spans several key areas: Rational generalizations of Catalan combinatorics Parking functions and their algebraic connections Associahedra and simplicial complexes Noncrossing and nonnesting partitions Core partitions and their properties Sweep maps and combinatorial algorithms Armstrong's work demonstrates a consistent focus on extending classical combinatorial structures to rational parameters, creating new connections between combinatorics, algebra, and geometry. His publications reveal a progression from classical Catalan combinatorics toward more general rational frameworks, often revealing deeper structural insights through these generalizations. His scholarly contributions have appeared in leading mathematics journals including Advances in Mathematics, Annals of Combinatorics, and Transactions of the American Mathematical Society, reflecting the significance of his work within the mathematical community. As an academic, Armstrong maintains active collaborations with prominent combinatorialists including Victor Reiner, Brendon Rhoades, Nicholas Loehr, and Gregory Warrington, contributing to the vibrant research environment in algebraic combinatorics.

• Algebra
• Number Theory
• Numerical Semigroups
• +۲ مورد دیگر

Prof. Dr. Halil İbrahim Karakaş is a faculty member at Başkent University , specializing in Algebra and Number Theory . His work focuses on numerical semigroups, particularly Arf semigroups and the Frobenius Problem, with applications in integer programming and discrete mathematics. Email: halil.karakas@baskent.edu.tr Research Areas: Algebra, Number Theory, Numerical Semigroups, Integer Programming His recent publications (2017–2022) explore structural properties of numerical semigroups, parametrization techniques, and connections to Young Tableaux. Collaborations include researchers like Sedat İlhan and Nesrin Tutaş. His contributions span theoretical advancements and computational methods in semigroup theory.

Eduardo Feo Flushingمشاهده پروفایل

استاد آموزشی

• Robotics
• Multi-Agent Systems
• Machine Learning
• +۴ مورد دیگر

Dr. Eduardo Feo Flushing is an Assistant Teaching Professor in the Software and Societal Systems Department at Carnegie Mellon University's School of Computer Science , based in Pittsburgh, PA. His role involves academic instruction and research at the intersection of software engineering, societal computing, and intelligent systems. Research Focus: His work spans robotics, distributed AI, and networked systems, with applications in critical domains. Primary research themes include: Multi-robot coordination for spatially distributed tasks Machine learning in healthcare diagnostics and renewable energy Wireless network optimization for mobile systems Human-robot collaboration under uncertainty Publication Trends: Recent articles (2021-2025) demonstrate a strong emphasis on applied machine learning (LLMs for medical ECG, deep learning for solar panel inspection) and advanced robotics (indoor mapping, task allocation in communication-constrained environments). Earlier work (2016-2020) focused on foundational aspects of multi-robot coordination, optimization, and wireless network resilience.

Daniel Gnadمشاهده پروفایل

استادیار

• Artificial Intelligence
• AI Planning
• Model Checking
• +۳ مورد دیگر

Daniel Gnad is an Assistant Professor at Linköping University's Department of Computer Science (IDA), working within the Artificial Intelligence and Integrated Computing Systems (AIICS) division. He specializes in "Planning and model checking" within artificial intelligence, focusing on theoretical foundations and algorithmic approaches to complex planning problems. Dr. Gnad completed his Computer Science studies at Saarland University, earning his MSc before continuing as a PhD student under Prof. Jörg Hoffmann. In 2022, he joined the RLPLab at Linköping University as a postdoctoral researcher, becoming an assistant professor in 2023. His research primarily centers on AI planning, model checking, and decoupled state-space search methodologies. His recent publications demonstrate significant advancements in planning algorithms, pattern databases, and numeric planning techniques. Gnad's work bridges theoretical computer science with practical applications in artificial intelligence, particularly in developing more efficient search algorithms for complex planning problems. His research often involves transforming planning problems into more tractable forms through abstraction techniques and novel search topologies. Dr. Gnad has received numerous prestigious awards recognizing his contributions to the field: ICAPS 2022 Best Dissertation Award for "Star-Topology Decoupled State-Space Search in AI Planning and Model Checking" SoCS 2022 Best Paper Award for "Additive Pattern Databases for Decoupled Search" SPIN 2018 Best Paper Award for "Star-Topology Decoupling in SPIN" Dr.-Eduard-Martin-Preis for the best dissertation of the Faculty for Mathematics and Computer Science in 2021 Multiple recognitions at the International Planning Competition (IPC) 2018 for the "Saarplan" planning system As a researcher at AIICS, Dr. Gnad contributes to Linköping University's strong position in artificial intelligence research. His work is part of the broader research activities within the Wallenberg Autonomous Systems Program (WASP), one of Sweden's largest research initiatives. While specific details about his advisees aren't provided in the available information, his research group likely contributes to the department's doctoral programs in computer science. Dr. Gnad's laboratory work focuses on developing and analyzing planning algorithms, with applications ranging from theoretical computer science to practical AI systems. His recent integration of techniques like pattern databases with numeric planning represents an important direction in making planning algorithms more versatile for real-world applications.

Zafeirakis Zafeirakopoulosمشاهده پروفایل

پژوهشگر

• Symbolic Computation
• Discrete Mathematics
• Combinatorics
• +۴ مورد دیگر

Zafeirakis Zafeirakopoulos is a researcher at the National and Kapodistrian University of Athens (Greece) in the ELIDEK project led by Prof. Maria Chlouveraki. His academic career includes roles as an assistant professor at Gebze Technical University (2016-2022) and postdoctoral research at University of Athens (Greece), Galatasaray University (Turkey), and University of Geneva (Switzerland) under the Eccellenza project of Prof. Jehanne Dousse. PhD in RISC - Research Institute for Symbolic Computation (supervised by Prof. Peter Paule and Prof. Matthias Beck) Current affiliations: Mathematics department of National and Kapodistrian University of Athens Service roles: Information Director of ACM SIGSAM, Associate Editor of ACM CCA His research focuses on symbolic computation, discrete mathematics, and computational geometry. He has developed algorithms for parametric curve topology (PTOPO) and linear Diophantine systems (Polyhedral Omega), emphasizing efficiency and geometric interpretations. Recent work involves Julia/Maple implementations for practical applications. Publication trends highlight interdisciplinary work in symbolic algorithms, polyhedral geometry, and combinatorial optimization. He actively contributes to international conferences like ACA 2025 (co-organizer) and SCALE 2022.

Ye Heمشاهده پروفایل

مدرس

• Chinese Language Teaching
• Second Language Acquisition
• Applied Linguistics
• +۳ مورد دیگر

Ye He serves as a Lecturer (Chinese Language Teacher) at the Confucius Institute within the Language Centre of Queen Mary University of London's School of Languages, Linguistics and Film. Her primary role involves instructing Chinese language courses across undergraduate and postgraduate programs, with an office located in Arts Two 2.16. Her research profile spans two distinct domains: Chinese language pedagogy and advanced mathematical representation theory. In language education, she focuses on second-language acquisition methodologies and curriculum development for Chinese instruction. Concurrently, her mathematical research centers on symmetric groups, Hecke algebras, and modular representation theory, with emphasis on decomposition numbers, block structures, and combinatorial aspects of group representations. Analysis of her 15 most recent publications (2019–2025) reveals consistent contributions to algebraic combinatorics, particularly in characterizing irreducible representations under prime characteristics, ribbon block structures, and Fock space comparisons. These works demonstrate rigorous theoretical frameworks applicable to both pure mathematics and computational algebra. No scientific awards or fellowships were documented in the provided materials. Information regarding student supervision, research grants, or collaborative funding initiatives was not specified. Her sole documented scholarly presentation occurred at the QMUL Language Centre conference. No laboratory facilities, research teams, or institutional partnerships beyond her Confucius Institute affiliation were referenced in the source materials.

Alexander Barvinokمشاهده پروفایل

استاد

• Computational Complexity
• Algorithms
• Algebra
• +۶ مورد دیگر

Alexander Barvinok is a Professor in the Department of Mathematics at the University of Michigan, Ann Arbor. His office is located in East Hall (4066 East Hall), where he has been conducting research and teaching advanced courses in computational mathematics since receiving his Ph.D. from Leningrad State University in 1988. Professor Barvinok's research focuses on computational complexity and algorithms in algebra, geometry and combinatorics. He is particularly interested in connections between various notions of phase transition in statistical physics, analytical properties of partition functions and computational complexity. His work bridges theoretical mathematics with practical computational approaches, exploring how physical phenomena can inform algorithmic design and analysis. His research spans convex geometry, combinatorial optimization, and the computational aspects of polynomial systems. His recent publications (2016-2024) demonstrate a consistent focus on partition functions, computational aspects of convex bodies, and approximation algorithms for counting problems. He has made significant contributions to understanding the zeros of partition functions in statistical physics models, developing efficient volume estimation algorithms for polyhedra, and creating polynomial-time approximation schemes for problems previously thought to be computationally intractable. His work frequently connects algebraic properties of polynomials with computational feasibility. Professor Barvinok has authored several influential textbooks including "A Course in Convexity" (AMS Graduate Studies in Mathematics, 2002), "Integer Points in Polyhedra" (Zurich Lectures in Advanced Mathematics, 2008), and "Combinatorics and Complexity of Partition Functions" (Springer, 2016). He regularly teaches advanced graduate courses such as Math 669 on specialized topics including "Combinatorics, Geometry and Complexity of Integer Points" and "Topics in Convexity," with his lecture notes often evolving into significant research contributions.

Amanda Burcroffمشاهده پروفایل

پژوهشگر ارشد

• Algebraic Combinatorics
• Cluster Algebras
• Scattering Diagrams
• +۶ مورد دیگر

Amanda Burcroff is a mathematician specializing in algebraic combinatorics, currently serving as a President's Postdoctoral Fellow at the University of California, Davis. Starting in September 2025, she will join MIT as a School of Science Dean's and NSF Postdoctoral Fellow. Her research explores the connections between cluster algebras, scattering diagrams, and algebraic geometry, with additional contributions to number theory, graph theory, and combinatorial structures. Harvard University (Ph.D., Mathematics) University of Cambridge (M.A.St, Mathematics) Durham University (M.A.S., Pure Mathematics) University of Michigan (B.S., Mathematics) Burcroff's research focuses on: Cluster algebra positivity and expansion formulas in low-rank settings Scattering diagram combinatorics and tropical geometry Hyperbolic Coxeter polytopes and dimension bounds Ehrhart theory and Hilbert bases for convex cones Combinatorics on words and pattern avoidance Domination polynomials and graph invariants Her publications reveal interdisciplinary trends spanning algebraic combinatorics, geometric structures, and number-theoretic patterns. Recent work examines quantum cluster algebras, continued fractions, and convex geometry. Burcroff's awards include prestigious Marshall, NSF, and President's Postdoctoral Fellowships. Marshall Scholarship (UK study funding) NSF Postdoctoral Fellowship (MIT appointment) President's Postdoctoral Fellowship (UC Davis) Burcroff actively promotes STEM diversity through mentorship programs like the Math Includes Mentorship Program and Graduate Research Opportunities for Women (GROW) Conference. Her mathematical outreach extends to high school initiatives including the Oakland University Summer Mathematics Institute and FIRST Robotics.

Frits C.R. Spieksmaمشاهده پروفایل

استاد

• Combinatorial Optimization
• Operations Research
• Scheduling
• +۷ مورد دیگر

Prof. Frits C.R. Spieksma is a full professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e) , where he leads research within the Combinatorial Optimization Group. He has held academic positions at Maastricht University, KU Leuven, and the University of British Columbia, and has been at TU/e since 2018. Education: M.Sc. in Econometrics, University of Groningen (1987) Ph.D. in Operations Research, Maastricht University (1992) Research Focus: His work lies at the intersection of combinatorial optimization and real-world applications . Key themes include: Scheduling and clustering problems, especially in sports tournaments Organ allocation optimization for Eurotransplant Assignment and transportation problems Approximation algorithms and graph-theoretic optimization Scientific Service & Leadership: Founder and ex-Chair, EURO Working Group OR in Sports Member, Steering Committees of MAPSP and MathSports International President, EURO (Association of European Operational Research Societies) Former Vice-President, IFORS Former President, Belgian Society of Operations Research (ORBEL) Editorial Boards: Associate Editor, 4OR (2015–present) Associate Editor, Journal of Quantitative Analysis in Sports (2014–present) Associate Editor, Operations Research Letters (2008–2024) Former Associate Editor, INFORMS Transactions on Education , OMEGA , Computers & Operations Research , IIE Transactions , Naval Research Logistics PhD Supervision & Mentoring: He has supervised more than 25 PhD theses at KU Leuven and TU/e, many of whom now hold academic positions worldwide. Conference & Workshop Organisation: Recent leadership roles include General Chair of IPCO 2022 (Eindhoven), organiser of Benders Day 2024 , and co-organiser of the Dagstuhl Seminar on Fairness in Scheduling and Resource Allocation (March 2025).

Alain Hertzمشاهده پروفایل

استاد

• Operations Research
• Management Science
• Combinatorial Optimization
• +۶ مورد دیگر

Alain Hertz is a Full Professor in the Department of Mathematics and Industrial Engineering at Polytechnique Montréal. He is affiliated with two major research centers: Institut de valorisation des données (IVADO) and Groupe d'études et de recherche en analyse des décisions (GERAD). His expertise spans operations research, management science, and algorithm development with applications across multiple industries. Professor Hertz specializes in combinatorial optimization, graph theory, algorithms, heuristics and metaheuristics. His research bridges theoretical mathematics with practical applications in scheduling, vehicle routing, and decision support systems. Recent work explores graph-based approaches for recommender systems and chemical graph theory, demonstrating the versatility of his mathematical frameworks. His publication record shows consistent output across top journals in operations research and graph theory. Recent articles (2021-2025) focus on extremal graph theory, chemical graphs, graph coloring variants, and applications of graph theory to recommender systems. This demonstrates both theoretical depth and practical relevance in his research trajectory. Prix de la ministre de l'Éducation, du Loisir et du Sport - Gouvernement du Québec (2011) Professor Hertz has supervised 13 doctoral students and 18 master's students, with thesis topics ranging from optimization methods for semi-supervised clustering to wind farm network design. His supervision approach emphasizes both theoretical foundations and practical applications, preparing students for careers in both academia and industry. His research has been supported by various grants enabling collaborative work with international partners. Through his affiliations with IVADO and GERAD, Professor Hertz contributes to interdisciplinary research initiatives that connect mathematical theory with real-world problems in data science, artificial intelligence, and industrial engineering.

Emil Petkov Kamenovمشاهده پروفایل

استادیار

• Probability
• Operations Research
• Statistics
• +۳ مورد دیگر

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.