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

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

استاد

• Discrete Geometry
• Tropical Geometry
• Algorithmic Geometry
• +۴ مورد دیگر

Michael Joswig is an Einstein Professor of Discrete Mathematics/Geometry at Technische Universität Berlin and a Max Planck Fellow at the Max Planck Institute for Mathematics in the Sciences, Leipzig. His research focuses on polyhedral, tropical, and algorithmic geometry, optimization, combinatorial topology, and mathematical software development (e.g., polymake and OSCAR). He holds a PhD from the University of Tübingen (1994) and a Habilitation from TU Berlin (2000). His career includes professorial roles at TU Darmstadt and TU Berlin, alongside visiting positions at institutions like the Mathematical Sciences Research Institute in Berkeley. Joswig has authored over 120 publications, supervised numerous PhD students, and led major grants such as the SFB/TRR 195 'Symbolic Tools in Mathematics.' Research interests span geometric algorithms, tropical geometry applications, and software for computational mathematics. Notable awards include the SIAM SIGEST Award (2021) and the MATH Distinguished Fellowship (2023). He co-develops the OSCAR computer algebra system and actively contributes to academic leadership roles, editorial boards, and conference organization. Current projects include tropical mechanism design, approximate convex hulls, and polyhedral geometry in algebraic software systems. His work bridges theoretical mathematics with practical computational tools, impacting fields from optimization to biology.

• Mathematical Optimization
• Algorithmic Game Theory
• Multi-Agent Systems
• +۳ مورد دیگر

Max Klimm is an Assistant Professor for Discrete Optimization at Technische Universität Berlin, affiliated with the Department of Mathematics within Faculty II – Mathematics and Natural Sciences. He holds a PhD in Mathematics from TU Berlin (2012) and previously served as an Assistant Professor for Operations Research at Humboldt-Universität zu Berlin (2014–2016) and led the Junior Research Group for Optimization under Uncertainty at the Einstein-Center for Mathematics (2014–2016). His research focuses on algorithmic game theory, mathematical optimization of multi-agent systems in traffic, telecommunications, and economics. Key areas include network flows, congestion games, mechanism design, and infrastructure networks. He actively contributes to academic activities as an associate editor for journals like International Journal of Game Theory and Operations Research Forum , and has served on program committees for conferences such as AAAI, EC, and WINE. Recent work includes studies on evolutionary road network reconstruction, robustness of potential-based flows, and algorithmic solutions for knapsack and assignment problems. His research bridges theoretical foundations with practical applications in transportation and resource allocation.

Jason Cantarellaمشاهده پروفایل

استاد

• Geometry
• Topology
• Geometric Knot Theory
• +۳ مورد دیگر

Jason Cantarella is a Professor in the Mathematics Department at the University of Georgia. His research focuses on geometric knot theory, particularly the shapes of random curves and polygons. He teaches Differential Geometry of Curves and Surfaces (MATH 4250) every spring and specializes in the Multivariable Mathematics (MATH 3500-3510) course sequence. His research interests center on geometric properties of random polygons and knots, using differential, algebraic, and symplectic geometry of polygon spaces. Dr. Cantarella is particularly interested in questions like how likely it is that a random curve is knotted or what can be expected from a random diagram of a random space curve. His work bridges pure mathematics with applications in polymer physics and molecular biology. His recent publications show a strong focus on random polygons, topological polymers, geometric probability, and computational methods for analyzing knotting phenomena. There's a clear progression from theoretical foundations to algorithm development and practical applications, particularly in understanding the statistical properties of knotted structures in physical systems. Dr. Cantarella leads a research group that includes graduate students Tom Needham, Michael Berglund, and Harrison Chapman, as well as postdoctoral fellow Clayton Shonkwiler. He collaborates with faculty members Jason Parsley and Matt Mastin at UGA, and internationally with researchers including Tetsuo Deguchi at Ochanomizu University, the Uehara group at Kyoto University, and Clayton Shonkwiler of Colorado State University. He has developed several computational tools including Octrope (for polygonal tube radius calculation), plCurve (polygon library), Ridgerunner (knot tightening software), and Tsnnls (sparse non-negative least squares solver). These tools have enabled significant advances in the computational study of geometric knot theory and random polygon spaces.

John C. Bowersمشاهده پروفایل

دانشیار

• Discrete Geometry
• Computational Geometry
• Circle Packings
• +۵ مورد دیگر

John C. Bowers is an Associate Professor of Computer Science at James Madison University, teaching courses including Discrete Structures, Algorithms, and Computational Geometry. He serves as a first-year CS advisor and organizes the department's Research Seminar series. His research centers on discrete and computational geometry with emphasis on circle packings, polyhedral rigidity, and inversive geometry. He develops computational tools for geometric visualization and 3D printing applications, exploring connections between theoretical mathematics and practical algorithms through projects like Koebe.py and the Escher programming language. Recent publications reveal a strong trend toward computational methods in rigidity theory, with increasing focus on algorithmic implementations for circle packing problems. His 2024 work demonstrates the convergence of art and mathematics through combinatorial tiling engines, while earlier papers establish foundational rigidity results using geometric flows and hyperbolic geometry. As co-director of the Ars Geometrica lab, Bowers mentors undergraduate researchers in projects spanning 3D printing infill optimization (with Oak Ridge National Labs), spatial graph representations, and subdivision tiling languages. His lab actively bridges theoretical geometry with tangible computational outputs and manufacturing applications.

• Discrete Choice Modelling
• Multivariate Statistics
• Quantitative Psychology
• +۳ مورد دیگر

Michel Meulders serves as Associate Professor of Statistics at the Operations Research and Statistics Research Group (ORSTAT) within KU Leuven's Faculty of Economics and Business. His dual-campus appointments (Brussels and Leuven) reflect his interdisciplinary work bridging statistical methodology with psychological applications, particularly in discrete choice modeling and pain research. Education: 1994: Licentiate in Psychology 2000: PhD in Psychology Research Focus: Dr. Meulders' work centers on discrete choice modeling and multivariate statistics , with significant contributions to quantitative psychology and psychometrics . His methodological innovations address sample size determination , preference heterogeneity , and attribute non-attendance in choice experiments, while applied research explores pain perception and avoidance behavior modulation through positive affect and social support. Publication Trends: Recent work (2022-2025) reveals two converging streams: (1) advanced discrete choice methodologies (machine learning integration, experimental design optimization) and (2) psychological applications (VR pain interventions, social media impact on health behavior). This interdisciplinary approach uniquely connects econometric modeling with clinical psychology through rigorous statistical frameworks. Academic Leadership: PhD Supervision: Primary advisor for S.Y. Assele (discrete choice experiments) and A. Gutierrez Vargas (heterogeneity modeling) Current Projects: Topics in Discrete Choice Modeling (2022-2026) - Co-promotor Heterogeneity in Discrete Choice Models (2019-2023) - Co-promotor Discrete Choice Experiments: Screening & Framing (2018-2023) - Co-promotor Administrative Roles: Head of Subdivision 29 (Brussels Campus), Council member for FEB and Campus Council Research Ecosystem: Dr. Meulders operates at the intersection of ORSTAT's operations research expertise and the Quantitative Psychology group's behavioral science focus, facilitating cross-campus collaborations on statistical methodology development and psychological application testing. His work with the LStat General Assembly further extends methodological influence across KU Leuven's research infrastructure.

Joseph Hydeمشاهده پروفایل

پژوهشگر ارشد

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

Dr. Joseph Hyde is a Research Fellow in the Department of Mathematics at King’s College London, supervised by Matthew Jenssen. He holds a Research Associate position within the Probability research group. Previously, he was a Post-Doctoral Fellow at the University of Victoria (2022–2024) under Jonathan Noel, Natasha Morrison, and Bruce Reed, and a Research Assistant at the University of Warwick (2021–2022) with Hong Liu and Oleg Pikhurko. His research focuses on Extremal Combinatorics , Graph Theory , Ramsey Theory , and Combinatorial Number Theory . Notable contributions include resolving the 0-statement of Kohayakawa and Kreuter’s conjecture in random Ramsey theory, and work on spanning trees in pseudorandom graphs and clique subdivisions. Publications highlight interdisciplinary approaches in combinatorics and graph theory, often blending probabilistic methods with structural analysis. His work has been published in peer-reviewed journals and is available on his personal website.

• Numerical Analysis
• Approximation Theory
• Multiresolution Analysis
• +۷ مورد دیگر

Francesc Arandiga Llau is a Professor in the Department of Mathematics at the Faculty of Mathematics, Universitat de València, Spain. He is affiliated with the ANIMS (Numerical Analysis, Images, Multiresolution and Simulation) research group, where he conducts research in applied mathematics with a focus on numerical methods and their applications. Education: PhD from Universitat de València (1992), thesis on operator approximation and spectral radius continuity, supervised by Dr. Vicent Caselles Costa. His research interests center on Numerical Analysis , Approximation Theory , and Multiresolution Methods , with significant contributions to WENO schemes , nonlinear interpolation , and image and signal compression . His work often bridges theoretical developments with practical implementations in computational mathematics and engineering. He has made notable advances in the stability, accuracy, and adaptability of reconstruction techniques for piecewise smooth and discontinuous functions. The analysis of his recent publications reveals a consistent focus on high-order numerical methods, particularly in the context of image processing and data compression . His work leverages multiresolution analysis , radial basis functions , and adaptive interpolation to improve accuracy and efficiency. Themes across his articles include monotonicity preservation, error control, and the design of nonlinear schemes that avoid spurious oscillations near discontinuities. There are no scientific awards explicitly mentioned in the provided text. Francesc Arandiga has extensive collaborative research, particularly with scholars such as Rosa Donat, Dionisio F. Yáñez, Pep Mulet, and Antonio Baeza. His work has been supported through various research projects, though specific grants are not detailed in the text. He has advised students, including those who have completed theses under his supervision, although a full list is not provided. He is a key member of the ANIMS research group, which focuses on Numerical Analysis, Images, Multiresolution, and Simulation. This team works on developing and analyzing advanced computational methods for scientific and engineering applications, particularly in the areas of data representation, image processing, and numerical solutions to differential equations.

Hanmeng Zhanمشاهده پروفایل

استادیار

• Algebraic Graph Theory
• Quantum Information
• Quantum Computation
• +۹ مورد دیگر

Hanmeng Zhan is an Assistant Professor in the Computer Science Department at Worcester Polytechnic Institute (WPI), where he conducts research at the intersection of algebraic graph theory, quantum information, and quantum computation. His work focuses on discrete and continuous quantum walks, graph spectra, association schemes, and their applications to quantum algorithms and communication. Ph.D. in Combinatorics and Optimization, University of Waterloo (Supervisor: Chris Godsil) Postdoctoral Fellow, Simon Fraser University (with Bojan Mohar) York Science Fellow, York University (with Ada Chan) Postdoctoral Fellow, Université de Montréal (Centre de Recherches Mathématiques, with Luc Vinet) His research lies in the theoretical foundations of quantum walks, including perfect and fractional state transfer, uniform mixing, and spectral analysis of graphs. He has co-authored a book, Discrete Quantum Walks on Graphs and Digraphs (Cambridge University Press, 2023), and published in leading journals such as Linear Algebra and its Applications , Electronic Journal of Combinatorics , Quantum Information Processing , and Journal of Physics A . The most recent articles highlight a sustained focus on quantum walk dynamics, particularly on state transfer phenomena, Laplacian-based walks, and spectral characterizations in structured graphs like circulants, Johnson schemes, and distance-regular graphs. His work often combines deep algebraic techniques with quantum information applications. Organizer, QIT Thinking Seminar, WPI Session Organizer, CMS and AMS Meetings (2023–2025) Mini-course on Discrete Quantum Walks, CMS Winter Meeting 2022 He has supervised undergraduate research through the Fields Undergraduate Summer Research Program and teaches core computer science courses such as Foundations of Computer Science and Theory of Computation at WPI. Previously, he taught courses in discrete mathematics, linear algebra, and quantum walks at Simon Fraser University, York University, and the University of Waterloo. He is actively involved in the combinatorics and quantum information communities, regularly presenting at international conferences including the Joint Mathematics Meetings, CMS meetings, CanaDAM, and specialized workshops on quantum simulation and walks.

• Computational Neuroscience
• Neural Modeling
• Animal Genetics
• +۲ مورد دیگر

Maciej Gierdziewicz serves as a Lecturer at the Department of Applied Informatics within the Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering at AGH University of Science and Technology in Kraków, Poland. His primary workplace is room 305 in building C-2, and he holds both PhD and Engineer qualifications. His research spans Computational Neuroscience and Animal Genetics , with significant contributions in 3D modeling of presynaptic neural processes and genetic structure analysis of animal populations. In computational neuroscience, he develops sophisticated models of neurotransmitter flow and signal transmission in neurons, focusing on mesh quality and numerical simulation accuracy. His animal genetics work examines inbreeding coefficients, relationship matrices, and population structure in horse and dog breeds including Silesian horses, Tatra Shepherds, and Golden/Labrador Retrievers. Analysis of his 2013-2023 publications reveals two distinct but equally rigorous research trajectories: neural modeling (70% of recent work) emphasizing tetrahedral mesh optimization and diffusive modeling in presynaptic boutons, and animal genetics (30%) featuring detailed pedigree analyses of Polish-bred populations. Both lines demonstrate strong methodological focus on computational efficiency and geometric parameter optimization. No scientific awards or major fellowships are documented in available sources. There is no indication of graduate student advisement or external research grant management in the provided materials.

Kehe Zhuمشاهده پروفایل

استاد

• Functional analysis
• Complex analysis
• Operator theory

Kehe Zhu is a Professor in the Department of Mathematics & Statistics at the University at Albany, SUNY . His research focuses on functional analysis, complex analysis, and operator theory, with significant contributions to spaces of analytic functions and operator properties. Contact: kzhu@albany.edu Research Interests : Functional analysis, complex analysis, and operator theory, particularly in the context of Bergman, Hardy, and Fock spaces. His work explores integral operators, embedding theorems, approximation theory, and spectral properties. Recent Article Trends : Recent publications highlight Fock spaces, Bergman spaces, Hardy spaces, and their compact embeddings. Topics include Carleson measures, kernel approximation, heat transforms, and Möbius group actions, reflecting deep interconnections between complex analysis and operator theory.

Rahnuma Islam Nishatمشاهده پروفایل

استادیار

• Graph Theory
• Computational Geometry
• Additive Manufacturing (3D Printing)
• +۵ مورد دیگر

Rahnuma Islam Nishat is an Assistant Professor in the Department of Computer Science at Brock University, located in St. Catharines, Ontario, Canada. She holds a BSc Engg from Bangladesh University of Engineering and Technology (BUET), and both MSc and PhD in Computer Science from the University of Victoria, BC, Canada. Her research focuses on theoretical and applied computer science, including graph theory, computational geometry, additive manufacturing (3D printing), data mining, and reconfiguration problems. She is supported by an NSERC Discovery Grant and has organized major conferences such as the 36th Canadian Conference on Computational Geometry (CCCG 2024) at Brock University. Her academic journey includes postdoctoral fellowships at the University of British Columbia Okanagan, Toronto Metropolitan University, and the University of Victoria. She has served on program committees for WALCOM 2023/2025, EuroCG 2025, and CCCG 2025. Her interdisciplinary work bridges mathematical puzzles and practical applications, particularly in additive manufacturing tool-paths and graph drawing visualization. Research highlights include contributions to Hamiltonian path reconfiguration in grid graphs, efficient spanning tree enumeration, and collision-free tool-paths for 3D printing. She actively engages with the computational geometry community through conference leadership and algorithmic problem-solving.

• Computational Geometry
• Facility Location Optimization
• Robot Motion Planning
• +۱ مورد دیگر

Ka Yaw Teo is an Assistant Professor in Computer Science and Software Engineering at California Polytechnic State University. With interdisciplinary training in biology, engineering, and computer science, his research develops geometric algorithms for facility location, robot motion planning, and biomedical applications. He holds a Ph.D. in Computer Science from the University of Texas at Dallas. Research pillars include: Geometric Optimization : Designing efficient algorithms for median line segmentation and facility location problems. Robotic Motion : Computing feasible trajectories for articulated probes in 2D/3D spaces. Biomedical Applications : Correlating imaging data with histopathology in oncology (osteosarcoma). Recent publications (2013–2023) demonstrate cross-disciplinary impact, spanning theoretical computational geometry, robotics, and biomaterial science. Algorithms address high-dimensional data approximation, motion planning with clearance constraints, and optimization in weighted subdivisions. Collaborations include biomedical engineers on tissue property analysis and cancer diagnostics.

Pierre Aboulkerمشاهده پروفایل

استادیار

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

Pierre Aboulker is an Assistant Professor at the École normale supérieure in Paris, France, affiliated with the Talgo (Theory, Algorithms, Graphs, and Optimization) research team. Previously, he held postdoctoral positions at Concordia University, Universidad Andrés Bello, INRIA Sophia Antipolis, and Université Libre de Bruxelles, and an ATER position at Université Grenoble-Alpes. Research Interests : Pierre's work spans graph theory (undirected and directed), metric geometry, and betweenness. He focuses on substructures in graphs with specific properties, such as chromatic number and dichromatic number generalizations. Notable problems include the Chen-Chvátal Conjecture and Erdős-Pósa function bounds. Recent article trends highlight directed graphs, dichromatic number analysis, and subgraphs in high-outdegree digraphs. Papers explore applications to metric spaces and combinatorial optimization. Advising : He has supervised PhD and master’s students including Guillaume Aubian (PhD), Samuel Coulomb (M2), and Juliette Schabanel (M2). Grants: Leads ANR DAGS (2021-2024, 203k EUR) and ALGORIDAM (2020-2024, 299k EUR), and secured smaller PEPS Blanc and ACI grants. Committee Involvement : Serves as editor for DMTCS (Graph Theory) since 2022, and was on the CNRS National Committee (Section 6) from 2019-2021. Organized workshops like JGA 2022 and Structures in Digraphs (2022).

Peter Martensمشاهده پروفایل

استاد

• Music Theory
• Music Cognition
• Rhythm Analysis
• +۴ مورد دیگر

Peter Martens is a Professor of Music Theory at Texas Tech University and currently serves as Chair of the Department of Interdisciplinary Arts within the Talkington College of Visual and Performing Arts. He holds degrees from Lawrence University and the University of Chicago, including a B.M. in Music Education, B.A. in Classics, and M.A./Ph.D. in the History and Theory of Music. Educational Background B.M. in Music Education, Lawrence University B.A. in Classics, Lawrence University M.A. in History and Theory of Music, University of Chicago Ph.D. in History and Theory of Music, University of Chicago His research explores the communication of musical rhythm and meter through compositional, performative, and perceptual lenses, intersecting music theory, cognitive psychology, and empirical aesthetics. He has published in journals like Music Perception and Music Theory Online , and edited a 2022 translation of Isaac Vossius’s Rhythm, Text, and the Recovery of the Past . His work has been presented at conferences such as the Society for Music Theory (SMT) and the International Conference on Music Perception and Cognition (ICMPC). Dr. Martens co-directs the Performing Arts Research Lab (TTU-PeARL), where recent projects examine music’s role in emotional recognition and autism spectrum research. He has held administrative roles including Associate Director for Graduate Programs (2017) and Associate Dean (2020). Lab members have received fellowships and grants, including the Arts in Medicine grant for a Burkhart Center collaboration. Scientific Awards $10,000 Arts in Medicine grant (2022, co-directed with TTU-PeARL and Burkhart Center) Leadership roles: President of Texas Society for Music Theory (2015-2018), Program Chair for SMPC (2019)

Martin Loeblمشاهده پروفایل

استاد

• Discrete Mathematics
• Graph Theory
• Combinatorial Optimization
• +۱۰ مورد دیگر

Professor Martin Loebl is a distinguished academic at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague. His extensive teaching portfolio includes Discrete and Continuous Optimization, Linear Programming, Nonlinear Optimization, Game Theory for intelligent networks, and Linear Algebra. His office is located in room S 325 on the 3rd floor in Lesser Town, Malostranské nám. 2/25, Prague 1. Loebl's research spans the breadth of discrete mathematics with particular emphasis on graph theory, combinatorial optimization, and applications to statistical physics. His work bridges theoretical mathematics with practical applications in network optimization, market equilibria, and critical distribution systems. He has made significant contributions to Kasteleyn theory, dimer models, Ising model applications, matroid theory, and matching theory. Analysis of his recent publications reveals a strong focus on the intersection of discrete mathematics with economic and social systems. His work increasingly addresses real-world challenges such as resource allocation during crises, market design, and fair division problems. The publications demonstrate sophisticated applications of graph theory and combinatorial optimization to game-theoretic models and distribution systems, with growing emphasis on practical implementations of theoretical frameworks. Scientific Awards: Prize of Rector of Charles University for the book 'Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the Occasion of his 60th birthday' Professor Loebl coordinates the H2020-MSCA-RISE-2018 project 'Combinatorial Structures and Processes (CoSP)' and previously coordinated the Czech Ministry of Interior's 'Critical Distribution System (CRISDIS)' project motivated by the COVID-19 pandemic. His research has practical applications in winter road maintenance routing, market equilibria design, and critical goods distribution systems. He maintains an active research laboratory focused on discrete mathematics applications, with particular emphasis on translating theoretical results into practical algorithms for optimization problems in network design, resource allocation, and market mechanisms. His group has produced significant work on dimer models, Kasteleyn orientations, and their applications to statistical physics problems.