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

• Computational Social Choice
• Algorithmic Game Theory
• Formal Methods
• +۶ مورد دیگر

Jie He is a PreDoc Researcher at the Department of Cyber-Physical Systems, Technische Universität Wien. His research spans computational social choice, algorithmic game theory, and formal methods in robotics and IoT systems. He works on multidisciplinary problems involving complexity analysis, fair division, and preference modeling. Current projects: EdgeAI (2022–2025), TAIGER (2023–2027), ADEX (2020–2024) Key collaborations: Research with R. Grosu, E. Bartocci, D. Nickovic Research interests focus on computational aspects of collective decision-making , including fair division, matching problems, and preference modeling. He works on both theoretical foundations (e.g., parameterized complexity) and practical applications (e.g., robotic-IoT systems). His publication history reveals deep expertise in computational complexity of social choice problems, with recent work on 3D stable roommates , fair division in graph-structured settings , and preference modeling through Euclidean and Manhattan geometries. As an advisor, he supervised diploma theses on: Optimization strategies for 5G transceivers Dynamic object detection in multi-agent systems His work appears in top conferences like ACM/IEEE DAC, ICSE, and various computational social choice venues.

Ahmad Abdiمشاهده پروفایل

دانشیار

• Combinatorial Optimization
• Integer Programming
• Linear Programming
• +۳ مورد دیگر

Ahmad Abdi is an Associate Professor in the Department of Mathematics at the London School of Economics and Political Science (LSE). He joined LSE as a tenure-track Assistant Professor in 2018 and was promoted to Associate Professor in 2023. He holds a PhD in Mathematics from the University of Waterloo, supervised by Bertrand Guenin, and completed a postdoctoral fellowship at Carnegie Mellon University under Gérard Cornuéjols. His research focuses on Combinatorial Optimization, Integer and Linear Programming, Matroid Theory, and Graph Theory, particularly the study of Ideal Clutters and their applications to open conjectures like Woodall’s and the Generalized Berge-Fulkerson conjecture. Education: PhD in Mathematics, University of Waterloo (2018) Postdoctoral Fellow, Carnegie Mellon University (2018–2019) Research Interests: Combinatorial Optimization and its applications to conjectures in Graph Theory (e.g., Woodall’s conjecture) Ideal Clutters and their connections to Linear Programming Matroid Theory and structural graph properties Grants: EPSRC New Investigator Award (2023–2026) for research on Woodall’s conjecture and the Generalized Berge-Fulkerson conjecture Students and Postdocs: PhD Students: Ruilan Wang (since 2019), Mahsa Dalirrooyfard (since 2022) Postdoctoral Fellows: Meike Neuwohner (since 2024), Tamás Schwarz (since 2025) Teaching: MA431 Spectral Graph Theory (2021/22) Combinatorial Optimization: Packing, Partitioning, and Covering (2023) Workshops: Co-organized the Cargese Workshop on Combinatorial Optimization (2022, 2024) and ACO@CMU Workshop (2020).

Wesley Pegdenمشاهده پروفایل

استاد

• Discrete Mathematics
• Probabilistic Combinatorics
• Combinatorial Game Theory
• +۷ مورد دیگر

Wesley Pegden is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University, affiliated with the Mellon College of Science. He holds a Ph.D. from Rutgers University. His research focuses on Discrete Mathematics, including probabilistic combinatorics, combinatorial game theory, graph theory, and discrete geometry. A central theme of his work is the Abelian sandpile model, where he has explored fractal patterns and connections to Apollonian circle packings. Collaborations with Lionel Levine and Charles Smart have advanced understanding of the sandpile's geometric properties through novel constructions of integer superharmonic functions. His work extends to applications in network science, epidemiological modeling, and statistical sampling biases (e.g., analyzing the Bangladesh mask trial). Notably, he contributed to studies on gerrymandering and congressional districting, including an expert analysis of Pennsylvania's district map. Awards include the Sloan Research Fellowship. Research Highlights: Abelian sandpile fractal geometry, algorithmic local lemma extensions, and random graph dynamics. Key Collaborations: Lionel Levine, Charles Smart, Alan Frieze.

Prasad Tetaliمشاهده پروفایل

استاد

• Discrete Mathematics
• Probability Theory
• Theory of Computing
• +۶ مورد دیگر

Prasad Tetali is the Alexander M. Knaster Professor and Department Head of the Department of Mathematical Sciences at Carnegie Mellon University (CMU), located in Pittsburgh, PA. He also holds adjunct professorships at Emory University (Math/CS) and the Georgia Institute of Technology (Math/CoC). His academic journey includes a Ph.D. from the Courant Institute of Mathematical Sciences, NYU, and postdoctoral research at AT&T Bell Labs. Education: Ph.D. (1991), Courant Institute of Mathematical Sciences, NYU M.S. (1987), Indian Institute of Science, Bangalore, India Postdoctoral Appointments: Mathematical Sciences Research Center, AT&T Bell Labs Research Interests: Dr. Tetali's work focuses on Discrete Mathematics, Probability Theory, and Theoretical Computing. Key areas include Markov chains, isoperimetry, combinatorics, computational number theory, and algorithm design. His contributions span foundational theory and applications in optimization, statistical physics, and network analysis. Publications & Trends: His research has led to influential papers on topics like mixing times of Markov chains, entropy inequalities, and combinatorial optimization. Notable works include foundational studies on the Potts model, the Swendsen-Wang algorithm, and sharp threshold phenomena in number theory. Awards & Recognition: AAAS Fellow SIAM Fellow (Inaugural Class, 2009) Fellow of the American Mathematical Society AMS Fellow (Inaugural Class, 2012) Georgia Tech’s Regents Professor Advising & Grants: Dr. Tetali has mentored 11 PhD students and numerous postdocs. His grants include leadership roles in initiatives such as the SIAM Activity Group on Discrete Mathematics and the ACO PhD Program at Georgia Tech. He has also held editorial roles at top journals like SIAM Journal on Discrete Mathematics and Random Structures & Algorithms. Labs & Collaborations: His work often intersects with interdisciplinary teams, including contributions to distributed algorithms, network science, and computational mathematics. He actively collaborates with researchers in computer science, physics, and applied mathematics.

Tom Bohmanمشاهده پروفایل

استاد

• Extremal Combinatorics
• Probabilistic Combinatorics
• Discrete Mathematics
• +۳ مورد دیگر

Tom Bohman is a Professor of Mathematical Sciences at Carnegie Mellon University, affiliated with the Mellon College of Science. His research focuses on extremal and probabilistic combinatorics, exploring discrete structures inspired by mathematics, information theory, statistical physics, and computer science. He holds a Ph.D. from Rutgers University and has held postdoctoral positions at MIT and the Mathematical Sciences Research Institute (MSRI). Bohman's work includes studies on random graph processes, such as the triangle-free process and Hamilton cycles in random graphs, as well as hypergraph coloring and Ramsey numbers. His publications span over three decades, addressing topics like coprime matchings, lonely runner conjectures, and dynamic concentration phenomena in combinatorial systems. He teaches advanced courses in combinatorics and discrete mathematics, including Graph Theory and Random Structures & Algorithms. His research has contributed to understanding phase transitions in random processes and the interplay between combinatorial structures and probabilistic methods. While no awards are explicitly listed, his extensive publication record and editorial roles (e.g., with Random Structures & Algorithms ) highlight his academic impact. Bohman's work often bridges theoretical foundations with algorithmic applications, influencing both pure and applied combinatorics.

Syam Menonمشاهده پروفایل

استاد

• Privacy
• Data Mining
• Software Design Optimization
• +۳ مورد دیگر

Syam Menon is a Professor in the Information Systems department at the School of Management , University of Texas at Dallas. He teaches courses such as MIS 6316 Data Communications, MIS 6324 Business Intelligence Software and Techniques, and MIS 6334 Advanced Business Intelligence. PhD , University of Chicago, 1997 MBA , University of Chicago, 1996 BTech , University of Kerala, India, 1989 His research focuses on Privacy , Data Mining , and Software Design Optimization . His work addresses network congestion in peer-to-peer systems, optimization of cellular networks, and privacy-preserving techniques in shared databases. He has published extensively in journals like Information Systems Research , IEEE Transactions on Communications , and Management Science . His recent publications highlight trends in Telecommunications and Computer Science , particularly in Network Optimization , Data Privacy , and Algorithm Design . He is affiliated with professional organizations such as INFORMS , IEEE , ACM , and Association for Information Systems . Contact Syam Menon via syam@utdallas.edu or at (972) 883-4779.

Laura Sanitàمشاهده پروفایل

دانشیار

• Combinatorial Optimization
• Approximation Algorithms
• Network Design
• +۳ مورد دیگر

Laura Sanità is an Associate Professor in the Department of Computing Sciences at Bocconi University, Milan, Italy. Previously, she held positions at TU Eindhoven (2020–2022) and the University of Waterloo, Canada, where she was an Assistant Professor (2012–2017) and later Associate Professor (2017–2020). She earned a Bachelor’s and Master’s in Management Engineering from Università di Roma Tor Vergata (2003–2005), followed by a PhD in Operations Research from Università Sapienza di Roma (2009). Her postdoctoral work (2009–2011) was at EPFL’s Discrete Optimization Group. Her research focuses on Combinatorial Optimization , Approximation Algorithms , Network Design , and Algorithmic Game Theory . Key contributions include advancements in node connectivity augmentation, graph stabilization, and polytope diameter analysis. She has received prestigious awards such as the NWO-VIDI Award (Netherlands), NSERC Discovery Accelerator Supplements, and the Early Researcher Award (Ontario). Laura co-organizes the Bocconi Theory Day (May 2024) and serves on program committees for conferences like SODA, ESA, and IPCO. She is an Associate Editor for Mathematical Programming , Mathematics of Operations Research , and Operations Research Letters . Current advisees include PhD students Sean Kafer, Dylan Hyatt-Denesik, and Lucy Verbeck. Her work bridges theoretical foundations and practical applications, with notable publications in Mathematical Programming , SIAM Journal on Optimization , and Operations Research . Recent projects explore stabilization of capacitated matching games and iterative randomized rounding techniques for combinatorial problems.

• Vehicle Routing Problems
• Stochastic Optimization
• Operations Research
• +۳ مورد دیگر

Ymro Hoogendoorn is an Assistant Professor at the Department of Technology and Operations Management at Rotterdam School of Management, Erasmus University Rotterdam. His research focuses on stochastic optimization, vehicle routing problems, and logistics management. He holds a PhD from the same institution (2024), with his thesis addressing vehicle routing under varying demand information conditions. His key research interests include developing robust algorithms for stochastic vehicle routing, integrating valid inequalities into optimization models, and enhancing computational efficiency in large-scale logistics systems. His work frequently addresses real-world challenges such as demand uncertainty and resource allocation. Hoogendoorn's publications span peer-reviewed journals like the European Journal of Operational Research and INFORMS Journal on Computing, as well as technical reports. His recent work emphasizes methodological advancements in stochastic programming and algorithmic improvements for vehicle routing variants. Notable contributions include the Improved Integer L-Shaped Method and resource-robust valid inequalities for combinatorial optimization problems. No scientific awards or grants are explicitly mentioned in the provided texts, though his research has garnered citations (e.g., 8 citations for his 2023 INFORMS paper). His academic advising and lab affiliations remain unspecified in the data provided.

Andrei Asinowskiمشاهده پروفایل

پژوهشگر

• Discrete Mathematics
• Combinatorics
• Computational Geometry
• +۳ مورد دیگر

Andrei Asinowski is a Researcher at the Institute of Mathematics at Alpen-Adria-Universität Klagenfurt. He has held academic appointments at institutions including Bielefeld University (2005–2006), University of Haifa (2006–2008), Technion (2008–2011), Free University of Berlin (2012–2015), and TU Wien (2015–2018). Since 2020, he leads the FWF-funded project 'Generic Rectangulations: Enumerative and Structural Aspects' (P32731). His research focuses on combinatorics, discrete mathematics, computational geometry, and enumerative combinatorics. Key interests include rectangulations, permutation patterns, lattice paths, and guillotine partitions. Research Interests: Combinatorics of rectangulations, permutation classes, enumerative combinatorics, geometric permutations, and algorithmic applications of discrete structures. His work bridges combinatorial theory and computational geometry, with recent emphasis on bijections between rectangulations and permutations, generating functions, and analytic methods. Grants & Projects: Principal Investigator of FWF Grant P32731 (since 2020), exploring enumerative and structural aspects of rectangulations. Collaborative projects include EuroGIGA's ComPoSe (2012–2015) and SFB F50's Algorithmic and Enumerative Combinatorics (2015–2018). Publications Trends: Recent work emphasizes rectangulation enumeration, permutation patterns, and analytic combinatorics techniques. Earlier contributions addressed geometric permutations, computational geometry, and lattice path enumeration.

Miki Hermannمشاهده پروفایل

پژوهشگر

• Computational Complexity
• Constraint Satisfaction Problems
• Satisfiability
• +۴ مورد دیگر

Miki Hermann is a CNRS Researcher at the Laboratory of Computer Science (LIX) at École Polytechnique, France. He is affiliated with the Algorithms and Complexity research group and maintains an active research program in theoretical computer science and computational logic. His research interests span computational complexity, constraint satisfaction problems, satisfiability, and logic in computer science. Hermann's work focuses on the theoretical foundations of computational problems, particularly examining complexity classifications, counting problems, and algorithmic solutions for logical and combinatorial structures. His research bridges theoretical computer science with practical applications in artificial intelligence and data analysis. The analysis of his recent publications reveals a consistent focus on computational complexity across various logical frameworks. His work demonstrates expertise in classifying the complexity of constraint satisfaction problems, propositional logic systems, and graph-theoretic problems. Notable research directions include minimal inference problems, counting complexity, and applications of satisfiability to big data transformation through his MCP project. Hermann is part of the Algorithms and Complexity research group at LIX (CNRS, UMR 7161), where he contributes to theoretical computer science research. He has developed significant software projects including MCP (Multi-Classification Project) for transforming datasets into propositional formulas and GYT (Generalized Young Tableaux) for solving variadic polynomial equations over non-negative integers.

• Coding Theory
• Discrete Geometry
• Finite Geometry
• +۵ مورد دیگر

Sascha Kurz is an Associate Professor at the Mathematical Institute of the Faculty of Mathematics, Physics and Computer Science at the University of Bayreuth, Germany. His research focuses on discrete structures, coding theory, voting systems, and combinatorial optimization. Professor Kurz's primary research interests span several interconnected fields in discrete mathematics and its applications: Coding Theory : With a focus on divisible codes, subspace codes, and constant dimension codes, his work explores the theoretical foundations and practical applications of error-correcting codes. Discrete Geometry : His research in finite geometry, particularly on arcs in projective spaces and vector space partitions, contributes to both theoretical understanding and coding applications. Game Theory and Voting Systems : He investigates power indices, weighted voting games, and their applications to political science and decision-making processes. Combinatorial Optimization : His work includes network coding, subspace packings, and algorithmic approaches to classification problems in coding theory. Analysis of Professor Kurz's recent publications reveals a strong focus on the intersection of coding theory and discrete geometry. His work consistently addresses fundamental questions about code parameters, classifications, and constructions, with particular attention to divisible codes and their properties. There's a clear progression from theoretical foundations to computational methods, as evidenced by his increasing use of computer-assisted classification techniques. His research demonstrates significant contributions to understanding the structure of linear codes, subspace codes, and their geometric interpretations. Professor Kurz has made notable contributions to both theoretical and applied aspects of his fields, collaborating with researchers across Europe and beyond. His work bridges pure mathematics with practical applications in information theory and network communication.

• Number Theory
• Modular Forms
• p-adic Properties
• +۳ مورد دیگر

Michael Hanson is a Visiting Assistant Professor of Mathematics at the University of North Texas , focusing on number theory and modular forms. He earned his PhD in mathematics from the University of Tennessee, Knoxville in May 2023 under the supervision of Dr. Marie Jameson. Research Interests: Number Theory, Modular Forms, p-adic Properties, Divisibility of Coefficients, Integer Partitions, Applications of Automorphic Forms Contact: Michael.Hanson@unt.edu Office: General Academic Building room 471E, 225 E. Mulberry St, Denton, TX 76201

Marc Chamberlandمشاهده پروفایل

استاد

• Differential Equations
• Number Theory
• Classical Analysis
• +۳ مورد دیگر

Marc Chamberland is a Professor and the Department Chair of Mathematics and Statistics at Grinnell College. He holds the endowed Myra Steele Professorship in Natural Sciences and Mathematics. He received his B.M., M.M., and Ph.D. degrees from the University of Waterloo. His research spans differential equations, number theory, classical analysis, experimental mathematics, discrete dynamics, and combinatorics. Specific interests include the 3x+1 problem, Ducci sequences, the Jacobian Conjecture, and combinatorial identities. With NSF grant support, he has developed materials to integrate computer discovery into mathematics education. Awards: Myra Steele Professor of Natural Sciences and Mathematics (endowed chair) He mentors students in research and collaborates widely, with over 50 publications and 20 co-authors.

Peter J. Dukesمشاهده پروفایل

استاد

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

Professor Peter J. Dukes holds a faculty position in the Department of Mathematics and Statistics at the University of Victoria. His research focuses on combinatorics, particularly applying algebraic and analytic methods to combinatorial problems. He has held positions including postdoctoral fellowships at Arizona State University and the University of Toronto. Dukes teaches advanced courses such as MATH 427 (Combinatorial Designs) and MATH 529 (Topics in Discrete Mathematics). His work spans graph theory, coding theory, and quasirandomness, with recent publications addressing graph decomposition, matrix balancing, and permutation patterns. He actively participates in academic conferences and organizes sessions on combinatorial design theory. His teaching philosophy emphasizes problem-solving and the appreciation of mathematical beauty, supported by resources like lecture notes for MATH 413 (applied algebra). Dukes also engages in outreach through activities like the UVic Math Competition and triangle decomposition games. Education: B.Sc. Mathematics, University of Victoria, 1997 M.Sc. Mathematics, University of Toronto, 1998 Ph.D. Mathematics, California Institute of Technology (Caltech), 2003 Research Interests: Combinatorics, algebraic methods in combinatorics, extremal graph theory, quasirandom structures, and applications to coding theory. His work often explores the intersection of discrete mathematics with algebraic techniques, such as permutation balancing and matrix decomposition problems.

Tanya Khovanovaمشاهده پروفایل

مدرس

• Recreational Mathematics
• Combinatorics
• Probability
• +۷ مورد دیگر

Tanya Khovanova is a Lecturer at the Massachusetts Institute of Technology (MIT) in the Department of Mathematics . Her career spans academia and industry, with extensive experience in recreational mathematics, combinatorics, probability, and algorithm design. She has held positions at MIT since 2008, including Visiting Scholar and Research Affiliate, and has contributed to programs like PRIMES and RSI for mentoring high school students. Ph.D. in Mathematics from Moscow State University (1988), advised by I.M. Gelfand Former roles include Lead Analyst at BAE Systems (2003-2008) and Princeton University (2001-2003, 1996-1998) Her research bridges recreational mathematics with applications in game theory , coding theory , and combinatorial puzzles . She is a prolific blogger and popularizer of mathematics, known for her work in creating innovative puzzles and educational tools like the Math Alive course at Princeton. Recent publications include explorations of EvenQuads games (2025), Chip-Firing algorithms (2022-2025), and SET game generalizations (2025). Her work often intertwines group theory , graph theory , and error-correcting codes . Scientific Awards : 2021 MLK Leadership Award (MIT) 2019 Infinite Mile Award (MIT) 1976 Gold Medal at International Mathematics Olympiad 1975 Silver Medal at International Mathematics Olympiad She mentors students through programs like PRIMES and RSI , emphasizing puzzle-based learning. Her blog and public talks continue to engage global audiences with mathematics.