Find Academic Supervisors

• Programming Languages
• Functional Programming
• Logic Programming
• +4 more

Jan Christiansen is a Professor in the Department of Information and Communication at Flensburg University of Applied Sciences. He specializes in Programming Languages and Programming Theory, teaching in the Applied Computer Science program. His research focuses on functional logic programming, probabilistic programming, formal verification, and compiler design. His key research areas include the integration of functional logic programming into Haskell, probabilistic programming semantics, and formal methods for verifying Haskell programs in Coq. He has contributed to tools like Sloth for strictness analysis and has explored foundational aspects of encapsulated search in Curry. His work bridges functional programming, logic programming, and probabilistic models, emphasizing practical implementations and theoretical rigor. Christiansen leads the Academic Advisory Service and co-founded TechStartUp@HS-Flensburg. His recent publications span compiler plugins for embedding functional logic in Haskell, probabilistic library implementations, and monadic approaches to program verification. His research bridges academia and practical software development, with implications for both theory and industry.

Amy N. MyersView profile

Senior Lecturer

• Combinatorics
• Probability Theory
• Enumerative Combinatorics
• +3 more

Amy N. Myers serves as Senior Lecturer in Mathematics and Math Program Coordinator at Bryn Mawr College's Department of Mathematics, where she teaches core courses including Calculus I-II, Multivariable Calculus, Probability Theory, and specialized graduate seminars in Enumerative Combinatorics and History of Mathematics. Her academic credentials include a Ph.D. in Mathematics from Dartmouth College (1999), establishing her foundational expertise in discrete mathematical structures. Dr. Myers' research demonstrates exceptional depth in combinatorial mathematics , particularly in pattern avoidance phenomena and probabilistic enumeration . Her work on interval orders bridges order theory with topological combinatorics, while her contributions to the Coupon Collector's Problem reveal novel asymptotic behaviors with applications in computational biology. The SIGEST recognition of her probability research by SIAM Review underscores its interdisciplinary significance across theoretical computer science and stochastic modeling. Analysis of her publication trajectory shows consistent innovation in multiset permutation statistics and forbidden substring constraints, with recent focus on shellability properties in ordered structures. Her combinatorial frameworks increasingly incorporate computational topology, reflecting evolving methodological sophistication. No scientific awards are documented in the available institutional records. As Math Program Coordinator, Dr. Myers oversees curriculum development and student advising for mathematics majors, though specific mentorship details remain undisclosed. Grant funding information is not publicly accessible through current university channels. Research infrastructure details including laboratories or collaborative teams are not referenced in her official academic profile.

Sarita NemaniView profile

Professor

• Applied Mathematics
• Computational Mathematics
• Graph Theory
• +7 more

Sarita Nemani is a Professor of Mathematics at Georgian Court University, affiliated with the School of Arts, Sciences, and Education and the Department of Mathematics, Computer Information Systems, and Physics. She previously served as Chair of both the Mathematics & Computer Information Systems and Physics Departments from 2013 to 2019. Doctor of Philosophy (PhD) in Mathematics, University of New Brunswick, Canada Master of Philosophy (MPhil) in Mathematics, Indian Institute of Technology Bombay Master of Science (MS) in Mathematics, University of Bombay Bachelor of Science (BS) in Mathematics, Wilson College, University of Bombay Her research focuses on perturbation methods for linear systems with special matrices (banded, circulant, Toeplitz), parallel algorithms for computational efficiency, and graph theory (interlace polynomials, vertex magic labeling). She also explores mathematical education reform and curriculum innovation. Sarita’s recent publications highlight trends in algebraic stability analysis , graph labeling techniques , and high-performance matrix computation . Her work bridges theoretical mathematics with practical algorithmic implementations. She has designed undergraduate and graduate courses in linear algebra, differential equations, abstract algebra, and graph theory. Her leadership roles include directing the 'Girl Involved in Science and Technology' program (2010–present) and moderating the Georgian Court University Math Club and New Jersey Pi Mu Epsilon chapter.

• Machine Learning
• Causal Inference
• Signal Processing
• +4 more

Yongqiang Chen is a Professor at the Chinese Academy of Sciences in the School of Engineering, Department of Computer Science and Engineering. With over 15 years of continuous research contributions spanning from 2005 to 2025, Dr. Chen has established himself as a versatile scholar working at the intersection of theoretical mathematics, machine learning, and practical engineering applications. Dr. Chen's research expertise encompasses: Machine Learning and Causal Inference, with recent focus on large language models and out-of-distribution generalization Signal and Image Processing, particularly in keyword spotting and watermarking applications Optimization Algorithms for engineering and management problems Theoretical Mathematics, including partition functions and combinatorial identities Engineering Management and Project Governance in construction contexts His recent publication trajectory (2023-2025) reveals a strategic evolution toward integrating causal reasoning with modern neural architectures, while maintaining strong connections to practical applications. Dr. Chen's work demonstrates exceptional interdisciplinary range, bridging pure mathematics with cutting-edge AI development and engineering solutions. His publications in venues like AAAI, NeurIPS, and IEEE Transactions reflect both theoretical rigor and practical relevance across multiple domains including renewable energy, neuroscience, and construction management. Dr. Chen maintains active collaborations with researchers across institutions, particularly with Bo Han on causal language models, James Cheng and Yiping Ke on brain network analysis, and various colleagues in engineering management. His research group appears to focus on developing theoretically sound yet practically applicable computational frameworks that address real-world challenges while advancing fundamental knowledge in machine learning and optimization.

Debbie YusterView profile

Associate Professor

• Combinatorics
• Polyhedral Geometry
• Machine Learning
• +3 more

Debbie Yuster is an Associate Professor of Data Science and Mathematics at Ramapo College of New Jersey, joining in 2020. She holds a Ph.D. in Mathematics from Columbia University and a B.A. in Mathematics with a Computer Science concentration from Cornell University. Her research focuses on combinatorics, polyhedral geometry, and machine learning, with contributions to algebraic geometry and STEM education. Education: Ph.D., Mathematics, Columbia University B.A., Mathematics (Computer Science concentration), Cornell University Research Interests: Combinatorics: Cluster methods, enumerative problems Polyhedral Geometry: Hyperdeterminants, triangulations Machine Learning: Interdisciplinary applications STEM Education: K-12 collaboration and curriculum development Publications: Her work bridges pure mathematics and computational biology, with key contributions in tropical geometry and epistatic modeling. Recent focus includes applying combinatorial techniques to high-dimensional geometric problems. Awards/Grants: None listed in current materials. Advising/Teaching: Teaches courses in data science (Python, ethics), mathematics (calculus, linear algebra), and collaborates on interdisciplinary programs. No formal advisees listed in profile. Labs/Teams: Active in the School of Theoretical and Applied Science's research initiatives, including the STEM Center and bioinformatics programs.

Anna De Mier VinueView profile

Associate Professor

• Combinatorics
• Graph Theory
• Matroid Theory
• +3 more

Anna De Mier Vinue is an Associate Professor at the Department of Mathematics, Universitat Politècnica de Catalunya (UPC), affiliated with the Facultat d'Informàtica de Barcelona (FIB). She leads research in combinatorics, graph theory, and matroid theory as part of the UPC's GAPCOMB research group (Geometric, Algebraic and Probabilistic Combinatorics). Her work focuses on structural combinatorics, polynomial invariants, and discrete geometry. Education: Holds a PhD in Applied Mathematics from UPC. Research Interests: Combinatorial enumeration, graph polynomials (Tutte, U-polynomials), matroid representations, non-crossing structures, and algorithmic combinatorics. Her contributions bridge algebraic methods with geometric and probabilistic approaches. Publications: Over 77 works including articles in Discrete Mathematics, European Journal of Combinatorics, and SIAM Journal on Discrete Mathematics. Recent research explores marked graphs, Tutte polynomial evaluations, and lattice approximations in clutter theory. Active in international projects like COCOA and R+D+I initiatives. Grants & Collaborations: Co-leads projects on extremal combinatorics, geometric algorithms, and mathematical education. Collaborates with researchers from BarcelonaTech and international institutions. Involved in initiatives addressing gender equality in STEM education through statistical analysis. Labs/Teams: Core member of the UPC's GAPCOMB group, contributing to interdisciplinary projects at the Institut de Matemàtiques de la UPC-BarcelonaTech. Supervises research in combinatorial geometry and algebraic structures.

Katharina JochemkoView profile

Associate Professor

• Geometric Combinatorics
• Discrete Geometry
• Algebraic Combinatorics
• +3 more

Katharina Jochemko is an Associate Professor in the Department of Mathematics at KTH Royal Institute of Technology. She holds a PhD (summa cum laude) from Freie Universität Berlin and a Diplom in Mathematics (with distinction) from LMU Munich. Her research focuses on geometric and algebraic combinatorics, discrete geometry, and the geometry of polynomials, with recent explorations into applications in artificial intelligence. She leads multiple research projects funded by prestigious organizations including the Wallenberg AI, Autonomous Systems and Software Program and the Swedish Research Council. Her academic contributions include groundbreaking work on Ehrhart polynomials, lattice polytopes, and syzygy bundles, as evidenced by her extensive publication record and the Best Paper Award 2018 from TU Wien. She actively supervises PhD students and postdocs, with current advisees including Jon Pål Hamre and Aryaman Jal. She serves as an associate editor for Beiträge zur Algebra und Geometrie and represents the Swedish Mathematical Society at institutional levels. Her teaching includes advanced courses in enumerative combinatorics and graph theory at KTH. She co-organizes international research initiatives like the Polytopes and Friends conference and the MaP-Trop seminar series on matroids and tropical geometry. Her research spans foundational work in geometric combinatorics with interdisciplinary applications.

Serigne GueyeView profile

Lecturer

• Operational Research
• Combinatorial Optimization
• Urban Planning
• +3 more

Serigne Gueye is a Lecturer in Computer Science at Avignon Université, affiliated with the Research and Innovation Support Department (DARI). His research focuses on operational research, combinatorial optimization, and their applications in urban planning and transportation systems. Key interests include graph partitioning, mathematical optimization, and multi-agent simulation for solving real-world problems with societal impact. Notable contributions include winning the 2015 Data Crossing Prize for work on mobile phone data exploitation and co-authoring impactful studies on urban planning optimization and air passenger flow estimation. His work bridges theoretical research and practical applications, often collaborating with international teams (e.g., Senegal, Brazil). Projects include OPTIDENS (urban accessibility modeling) and mobility analysis in smart cities. Technical expertise spans hybrid algorithms, quadratic programming, and network flow analysis. His research narrative emphasizes interdisciplinary approaches, combining optimization techniques with computational methods to address complex societal challenges. Awards: Data Crossing Prize (Data for Development Challenge, 2015). Key Collaborations: Multi-national teams in Senegal, Brazil, and France. Labs/Platforms: Contributed to Avignon Université’s Metaboscope Platform and Science Ouverte initiatives.

Laszlo KozmaView profile

Assistant Professor

• Data Structures
• Algorithms
• Combinatorics
• +4 more

László Kozma is an Assistant Professor at Freie Universität Berlin in the Theoretical Computer Science department. He obtained his PhD at Saarland University under Raimund Seidel, followed by postdocs at Tel Aviv University and TU Eindhoven. His work focuses on data structures , combinatorics , and algorithmic adaptivity , with significant contributions to self-adjusting heaps, binary search trees, and geometric optimization. Recent research includes pattern-avoiding sequences and saddlepoint algorithms . His publications span exponential algorithms , TSP variants , and heap structures , with a recurring theme of connecting combinatorial geometry to algorithm design. Co-authors include leading researchers like Robert Tarjan, Uri Zwick, and Haim Kaplan. Key software implementations (e.g., smooth heap ) are publicly available. He has developed tools like Cuckoo Hashing Visualization and the historical WikipediaVision project, demonstrating practical engagement with algorithmic concepts. His mathematical genealogy traces back to classical researchers.

• Algebraic Topology
• Hyperplane Arrangements
• Braid Groups
• +2 more

Daniel C. Cohen is a Professor in the Department of Mathematics at Louisiana State University. His research focuses on algebraic topology, particularly hyperplane arrangements, braid groups, and configuration spaces. He has organized several major conferences including the 'Topological Complexity and Motion Planning' conference in Mexico and has been recognized as an Honorary Fellow at the University of Wisconsin and Simons Visiting Professor. Research interests include topological robotics, combinatorial arrangements, and geometric group theory, with applications to motion planning algorithms and computational geometry.

• Combinatorial optimization
• Structural and algorithmic graph theory
• Computational complexity
• +3 more

Bernard Ries is a Professor in the Department of Informatics at the University of Fribourg, Switzerland. He holds a PhD in Mathematics from the École Polytechnique Fédérale de Lausanne (2007) and has held academic positions at Columbia University (2008-2009), the University of Warwick (2009-2010), and Université Paris Dauphine (2010-2015). He currently heads the Decision Support & Operations Research Group with Marino Widmer. His research focuses on structural and algorithmic graph theory, combinatorial optimization, and computational complexity. He has supervised multiple PhD students and has been involved in projects like the Smart Living Lab. Ries has organized conferences such as the 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023). His work includes contributions to graph coloring, domination problems, and algorithmic graph theory. Education: PhD in Mathematics (2007, EPFL), Postdoctoral Research Fellow (Columbia University), Assistant Professor (Warwick), Associate Professor (Paris Dauphine). Research Interests: Combinatorial optimization, graph theory, algorithmic complexity, mathematical modeling. His work often bridges theoretical results with practical applications, such as optimization in waste management systems and discrete tomography. Advising and Grants: Supervised over 10 PhD students, including Esther Galby (Chalmers University) and Vera Fischer (La Poste). Involved in research projects like "Efficient and Sustainable Waste Collection" (2019-2022). Active in organizing academic events and editorial roles in journals. Labs/Teams: Leads the Decision Support & Operations Research Group. Collaborates with the Smart Living Lab and international researchers in graph theory and optimization.

Bárány ImreView profile

Research Professor

• Discrete Geometry
• Combinatorics
• Convex Geometry
• +7 more

Imre Bárány is a Research Professor at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, and holds the Astor Professor of Pure Mathematics position at University College London (half-time). His career spans over four decades with visiting roles at Yale University, MSRI, Microsoft Research, and others. Bárány graduated from Eötvös University (1971), earned his PhD (1982) and Doctor of Sciences (1993) from the Hungarian Academy of Sciences, and became a member of the Hungarian Academy of Sciences in 2010. His research interests include discrete geometry, combinatorics, convexity, algebraic topology, and their applications in computer science and operations research. Key areas of focus are random polytopes, lattice points, Helly-type theorems, and geometric optimization. Bárány’s recent work, such as his 2020 paper on Carathéodory-Helly-Tverberg theorems and 2016 analysis of curve-hyperplane interactions, showcases advancements in geometric combinatorics. Over 170 publications span journals like Discrete & Computational Geometry and Annals of Probability. Awards: Rényi Prize (1988), Hungarian Academy Prize (1998), ERC Advanced Grant (2011), AMS Fellow (2012), Szechenyi Prize (2016). Grants & Leadership: Led the ERC-funded 'Discrete and Convex Geometry' project. Editorial roles include Discrete & Computational Geometry (since 1991) and Combinatorica (Editor-in-Chief since 2020).

• Phylogenetics
• Biodiversity Conservation
• Mathematical Biology
• +3 more

Kristina Wicke is an Assistant Professor in Mathematical Sciences at the New Jersey Institute of Technology (NJIT). Her research focuses on phylogenetics, biodiversity conservation, and mathematical biology, with particular emphasis on phylogenetic networks and evolutionary analysis. She collaborates on projects funded by the Royal Society Te Apārangi, including the 2023 grant investigating 'The tree complexity of reticulate evolution.' Dr. Wicke's work bridges combinatorial mathematics and biology, addressing challenges in phylogenetic tree balance, network optimization, and biodiversity indices. Key contributions include analyses of Fair Proportion Index robustness, cophenetic indices for network balance, and algorithmic approaches to phylogenetic network reconstruction (e.g., NANUQ+). Her research output includes 29 peer-reviewed articles across 2017–2025. Notable projects involve quantifying tree balance, bounding parsimony scores, and exploring network topology's implications for evolutionary models. She co-led a federal grant examining reticulate evolution's tree complexity and contributes to interdisciplinary initiatives merging computational methods with ecological conservation.

• Deep Learning
• Bayesian Statistics
• Nonparametric Methods
• +3 more

Zuofeng Shang is an Associate Professor in the Department of Mathematical Sciences at New Jersey Institute of Technology (NJIT). His research focuses on advanced statistical methodologies, including Bayesian statistics, nonparametric learning, and deep learning applications for complex data. He has received multiple National Science Foundation grants for projects addressing statistical guarantees in massive data analysis, sleep disorder management, and scalable learning algorithms. Shang's work spans theoretical foundations (e.g., minimax optimality, spline smoothing) and applied domains (e.g., financial data integration, ODE calibration via neural networks). His collaborations include interdisciplinary projects with medical researchers to improve obstructive sleep apnea management. Notable contributions include developing fast tensor completion algorithms and deep learning frameworks for functional data analysis. He has authored over 45 peer-reviewed publications and actively participates in academic outreach, as evidenced by media coverage of his research advancements in statistical methodologies.

Islam FoniqiView profile

Researcher

• Group Theory
• Geometric Group Theory
• Algebra
• +3 more

Islam Foniqi is a Senior Research Associate at the University of East Anglia (UEA), affiliated with the School of Engineering, Mathematics and Physics. He is a member of the Algebra, Number Theory, Logic, and Representations (ANTLR) research group. His work focuses on geometric group theory, particularly Artin groups, subgroup structures, and combinatorial algebraic problems. Foniqi has conducted research visits funded by the London Mathematical Society, collaborating with Prof. Bruno A. Cisneros De La Cruz at the Institute of Mathematics of UNAM, Oaxaca. His research explores topics such as twisted Artin groups, parabolic subgroups, and algorithmic aspects of group theory. He has published in high-impact journals like the Canadian Journal of Mathematics and the Journal of Group Theory, with a strong emphasis on subgroup separability and membership problems in algebraic structures. Key projects include 'Exploring twisted graph groups, algebras, and applications' (2023–2025) and a 2024 research collaboration with the London Mathematical Society. His work bridges pure mathematics with algorithmic challenges, contributing to foundational theories in algebraic combinatorics and geometric topology.