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

David M. McClendonمشاهده پروفایل

استاد

• Ergodic Theory
• Dynamical Systems
• Sports Analytics
• +۳ مورد دیگر

David M. McClendon is a Professor in the Department of Mathematics within the College of Arts, Sciences and Education at Ferris State University, where he has been a faculty member since 2012. Prior to joining Ferris, he held postdoctoral positions at Northwestern University and Swarthmore College. Education: PhD in Mathematics from the University of Maryland BS in Mathematics from the University of North Carolina Dr. McClendon teaches across the mathematics curriculum with recent focus on calculus, advanced probability/statistics, and real analysis courses. His research focuses on ergodic theory, specifically studying statistical properties of systems that evolve over time, with particular interest in speedups of dynamical systems and odometer factors. He has also developed research interests in sports analytics, particularly applying mathematical methods to analyze college football recruiting, and in the combinatorial mathematics of LEGO brick configurations. His publications demonstrate a consistent research trajectory in dynamical systems, with recent work expanding into interdisciplinary applications. The articles show progression from foundational theoretical work on semiflows and measure-preserving systems to more specialized investigations of Z^d actions, and finally to applied work in sports analytics and combinatorial problems related to LEGO structures. Dr. McClendon serves as faculty advisor for the university's chapter of Gamma Iota Sigma, the national risk management and actuarial science fraternity. He has presented his research at numerous professional conferences including the Joint Mathematics Meetings, Midwest Sports Analytics Meeting, and various dynamics symposia. His teaching spans from introductory courses like College Algebra and Calculus to advanced topics including Real Analysis, Abstract Algebra, and specialized courses in Dynamical Systems and Game Theory.

Niv Buchbinderمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Algorithmic Game Theory
• +۲ مورد دیگر

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.

Ivan Cherednikمشاهده پروفایل

استاد

• Representation theory
• Mathematical physics
• Combinatorics
• +۸ مورد دیگر

Ivan Cherednik is a Professor in the Department of Mathematics at the University of North Carolina at Chapel Hill. His research spans multiple disciplines in mathematics and its applications. Representation theory Mathematical physics Combinatorics Number theory Algebraic geometry Low-dimensional topology Mathematical biology Quantitative finance Cherednik's work has been revolutionary in several areas of mathematics. He's known for defining Double Affine Hecke Algebras (DAHA) and proving Macdonald's conjectures in q-combinatorics. His research has produced new theories of hypergeometric functions, DAHA invariants of algebraic knots and links, and new developments in the theory of Rogers-Ramanujan identities. Recent publications show his continued research activity, with work in 2024 on R-matrix quantization of formal loop groups, superpolynomials of algebraic links, and connections between zeta-polynomials, superpolynomials, DAHA, and plane curve singularities. He has also applied his mathematical expertise to real-world problems, particularly in modeling the spread of the COVID-19 virus using Bessel functions and other mathematical approaches.

András Frankمشاهده پروفایل

استاد

• Combinatorial Optimization
• Matroid Theory
• Submodular Functions
• +۳ مورد دیگر

András Frank is a Professor at the Department of Operations Research, Eötvös Loránd University, Budapest. As founder and leader of the MTA-ELTE Egerváry Research Group on Combinatorial Optimization (EGRES), he focuses on combinatorial optimization, matroid theory, submodular functions, matchings, graph theory, and polynomial-time algorithms. University: Eötvös Loránd University Department: Operations Research Research Group: EGRES (MTA-ELTE Egerváry Research Group on Combinatorial Optimization) His research addresses both theoretical and applied aspects of combinatorial optimization, including network flows, graph connectivity, and algorithmic applications. He authored the book Connections in Combinatorial Optimization (Oxford University Press, 2011), which explores polynomial-time algorithms and their role in graph theory and matroid theory. Key trends in his recent work include fair integral flows, discrete convex optimization, and algorithmic approaches to supermodular functions. While no specific scientific awards are listed in the provided texts, his contributions have been recognized through publications in top-tier venues and leadership in the EGRES group.

Kristóf Bércziمشاهده پروفایل

پژوهشگر

• Approximation Algorithms
• Combinatorial Optimization
• Matroid Theory
• +۳ مورد دیگر

Kristóf Bérczi is a researcher at the Department of Operations Research, Eötvös Loránd University, Hungary. His work intersects computer science, mathematics, and operations research, focusing on theoretical and applied optimization problems. MSc and PhD in Operations Research, ELTE Postdoc at Hungarian Academy of Sciences Research Interests: Approximation algorithms Combinatorial optimization Matroid theory Submodular functions Algorithmic game theory Graph theory Recent Publication Trends: His 2024-2025 work explores matroid-constrained partitioning, inverse optimization algorithms, rainbow subgraph problems, and envy-free pricing models, often combining matroid theory with practical algorithm design. Scientific Contributions: Active in program committees (APPROX 2019, IPCO 2024, WALCOM 2025) Organized workshops on matroid optimization and matching theory Editorial board member of SIAM Journal on Discrete Mathematics Mentorship: Supervises PhD students Áron Jánosik, András Imolay, and others, with graduates now in postdoc/lecturer positions at institutions like CMM Chile and LSE UK.

Vince Lyzinskiمشاهده پروفایل

دانشیار

• Statistical Network Inference
• Graph Matching
• Vertex Nomination
• +۶ مورد دیگر

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.

Harris Kwongمشاهده پروفایل

استاد

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

Harris Kwong serves as a Professor at the State University of New York at Fredonia, where he has maintained continuous faculty service since completing his doctoral studies. His academic base operates from Houghton Hall, the dedicated mathematics building on campus. His educational foundation includes a Ph.D. earned from the University of Pennsylvania, following earlier academic pursuits completed entirely within the United States despite being born and raised in Hong Kong. Dr. Kwong's research program centers on combinatorial structures , number-theoretic properties , and graph-theoretical frameworks , with teaching responsibilities spanning discrete mathematics , linear algebra , combinatorics , number theory , and abstract algebra . His scholarly work emphasizes theoretical foundations while maintaining practical applications across mathematical disciplines.

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

استاد

• Computational Number Theory
• Modular Forms
• L-functions
• +۵ مورد دیگر

Nathan Ryan is Professor of Mathematics at Bucknell University and Affiliated Faculty in Latin American, Latinx & Caribbean Studies. Joining Bucknell in 2007, he has received three Fulbright Scholar Grants for research in Uruguay (2009), Ecuador (2017), and Costa Rica (2022), and spent a sabbatical year in Uruguay (2013-2014). Education: Ph.D. in Mathematics, Dartmouth College M.A. in Mathematics, Dartmouth College B.A. in Mathematics, Bard College Research Focus: Ryan maintains dual research programs in computational number theory (proving theorems and developing algorithms for modular forms and L-functions) and applied data science (interdisciplinary student projects spanning healthcare, transportation, film studies, and social justice). His work bridges theoretical mathematics with real-world applications through community-based projects. Publication Trends: Recent publications (2022-2024) increasingly integrate number theory with social impact, particularly in algorithmic fairness (e.g., carceral system analysis) while maintaining core contributions to modular forms and L-function theory. Collaborations with undergraduate researchers appear consistently across all publications since 2010. Awards: Fulbright Scholar Grant to Uruguay (2009) Fulbright Scholar Grant to Ecuador (2017) Fulbright Scholar Grant to Costa Rica (2022) Advising & Grants: Ryan mentors undergraduate researchers through Bucknell's departmental projects and honors theses, with students contributing to publications in medical informatics, film studies, and criminal justice. His Fulbright grants directly fund international research collaborations, while campus partnerships (e.g., Geisinger Health System, Film and Media Studies) support applied data science projects. He actively recruits students with programming skills for computational mathematics work. Teams & Affiliations: As an affiliate of Bucknell's Institute for the Quantitative Study of Inclusion, Diversity, and Equity, Ryan contributes quantitative expertise to social justice research. He serves as editor for Frontiers for Young Minds and collaborates across disciplines with Geography, Psychology, Film Studies, and Computer Science departments on ongoing projects including school bus routing optimization and Hollywood color analysis.

Joseph S.B. Mitchellمشاهده پروفایل

استاد

• Computational Geometry
• Algorithms and Data Structures
• Optimization
• +۳ مورد دیگر

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)

• Probability Theory
• Limit Theorems
• Order Statistics
• +۴ مورد دیگر

Mikhail Georgievich Chebunin is a Senior Lecturer in the Department of Higher Mathematics at the Faculty of Physics, Novosibirsk State University (NSU), Russia. Since 2012 he has held continuous academic appointments at NSU, progressing from Assistant to Senior Lecturer following completion of his PhD in 2016. Education: 2012 – Graduated with honors, Novosibirsk State University. 2016 – PhD (specialty 01.01.05) with thesis "Limit theorems in the problem of servicing with multiple access and in the problem of an infinite urn scheme" . Research Focus: Dr. Chebunin concentrates on theoretical probability and its engineering applications. His core interests span limit theorems , order statistics , Markov chains , and the probabilistic analysis of data transmission systems . A recurring theme in his work is the infinite urn scheme , which serves as a versatile model for studying occupancy problems, heavy-tailed phenomena, and decentralized network protocols. Across his publications he has advanced functional central limit theorems for statistics arising in urn schemes, devised asymptotically normal estimators for power-law distributions (Zipf’s law), and analyzed ergodic algorithms governing random multiple-access communication systems with partial feedback. Scientific Communications: He has presented his findings internationally, notably as a poster presenter at the 40th Conference on Stochastic Processes and their Applications (SPA 2018) in Gothenburg, Sweden. Teaching & Service: Since 2012 he has taught within the Higher Mathematics department of NSU’s Faculty of Physics, guiding undergraduate and graduate students in advanced probability and stochastic modeling.

Ján Mazákمشاهده پروفایل

دانشیار

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

Ján Mazák serves as Associate Professor in the Department of Computer Science at the Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava. His office (M 255) is located at Mlynská dolina campus, reachable via phone 02/602 95 224. He maintains an active academic profile with current teaching duties and recent publications. Professor Mazák's research centers on Graph Theory with specialized focus on cubic graphs and snarks. His work investigates structural properties including cycle covers, oddness, resistance, and circumference deficit. This theoretical research bridges combinatorial mathematics and computer science, addressing fundamental problems in graph optimization and structural analysis. His publication record (2015-2022) demonstrates consistent output in top-tier journals like Electronic Journal of Combinatorics and Discrete Applied Mathematics . The research shows thematic continuity in cubic graph analysis, with increasing sophistication from 2015's snark studies to 2022's morphological investigations. Collaborative patterns indicate strong departmental ties with researchers Lukoťka, Mačajová, and Škoviera. No scientific awards are documented in the provided materials. Professor Mazák actively teaches Database Systems and Mathematical Propedeutics courses, maintaining a substantial teaching load with multiple weekly sessions across campus locations. While specific grant funding isn't mentioned, his sustained publication output suggests active research support. Prospective students should note his theoretical research orientation and contact him directly for supervision opportunities. The departmental structure provides standard academic resources, though no dedicated research laboratory is referenced in available information.

Maya Miteva Stoyanovaمشاهده پروفایل

استاد

• Coding Theory
• Spherical Codes and Designs
• Orthogonal Arrays
• +۴ مورد دیگر

Professor Maya Miteva Stoyanova is a distinguished academic at Sofia University "St. Kliment Ohridski", serving as Dean of the Faculty of Mathematics and Informatics (FMI) and Professor in the Department of Algebra. She earned her M.Sc. in 1992 and Ph.D. in 2009 from the same institution, with a career progression from Assistant Professor (1999) to her current position as Professor (since 2021). Her research focuses on Coding Theory, particularly spherical codes and designs, orthogonal arrays, and energy minimization of combinatorial configurations in polynomial metric spaces. She also contributes significantly to Algebra, Combinatorics, and Number Theory. Her work bridges theoretical mathematics with practical applications in information theory and discrete geometry. Professor Stoyanova's recent publications (2018-2023) demonstrate a consistent research trajectory in spherical codes, orthogonal arrays, and energy bounds, primarily through collaborations with prominent mathematicians like Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, and Edward Saff. Her work appears in high-impact journals such as Journal of Mathematical Analysis and Applications, IEEE Transactions on Information Theory, and Designs, Codes and Cryptography. She has successfully supervised doctoral students including Tanya Todorova Marinova and Tedis Arben Ramaj, whose research continued her work on orthogonal arrays and combinatorial configurations. Her academic leadership is evident through her role as Head of the Department of Algebra (2016-2020) and her current position as Dean of FMI. Professor Stoyanova maintains an active research profile with numerous publications in top-tier mathematics journals, reflecting her significant contributions to discrete mathematics and coding theory. Her work on distance distributions, energy bounds, and spherical designs represents cutting-edge research in combinatorial geometry.

Daniel Kráľمشاهده پروفایل

استاد

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

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).

Andrew Owensمشاهده پروفایل

استادیار

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

Andrew Owens is an Assistant Professor in the Department of Mathematics at Widener University. He holds a PhD in Mathematics from Auburn University (2019) and a BS from the University of Texas (2008). His research focuses on discrete mathematics and graph theory, with specific emphasis on antimagic labelings, rainbow cycle forbidding in edge colorings, and combinatorial structures in finite graphs. He participated in the Graduate Research Workshop in Combinatorics and the MASAMU research workshop in Southern Africa. Recent publications highlight his work on antimagic orientations, extremal graph theory, and rainbow-free edge colorings. His research intersects theoretical computer science and applied mathematics through problems in network analysis and combinatorial optimization. At Auburn University, Owens coordinated outreach programs engaging ~100 middle school students annually in advanced mathematics problems. He plans to continue similar initiatives at Widener and other institutions nationwide. Owens has collaborated on projects related to graph orientation constraints, multipartite graph structures, and rainbow-free combinatorics, with publications in journals like Discrete Mathematics and Graphs and Combinatorics .

Vasilisa Shramchenkoمشاهده پروفایل

استاد

• Algebraic Geometry
• Mathematical Physics
• Integrable Systems
• +۴ مورد دیگر

Vasilisa Shramchenko serves as Full Professor and Associate Director of Graduate Studies and Research in the Department of Mathematics at the University of Sherbrooke. Her work bridges advanced algebraic geometry with mathematical physics, focusing on structural frameworks governing complex systems. Educational background: Master of Science in Mathematics, St. Petersburg State University (2000) Ph.D. in Mathematics, Concordia University (2005) Her research program integrates Frobenius manifolds, integrable systems, and Riemann surface theory through the lens of isomonodromic deformations and Riemann-Hilbert problems. Key contributions include foundational work on Hurwitz spaces, Painlevé equations, and Eynard-Orantin topological recursion, revealing deep connections between algebraic curves, moduli spaces, and differential equations. This interdisciplinary approach extends to combinatorial enumeration and quantum field theory applications. Publication trends indicate sustained focus on algebro-geometric methods for solving nonlinear systems, with recent work emphasizing cluster algebras and superelliptic curve structures. Her output consistently appears in high-impact journals spanning mathematical physics and pure mathematics. Scientific recognition: No awards explicitly documented in source material Administrative leadership in graduate studies complements her research role, though specific grant funding or advisee information remains unreported. She actively contributes to the Algebraic and Geometric Structures Research Team and the Sherbrooke Mathematics Circle, fostering collaborative exploration of mathematical frontiers.