Find Academic Supervisors

Christiane LemieuxView profile

Professor

• Quasi-Monte Carlo Methods
• Low-discrepancy Sequences
• Computational Finance
• +3 more

Christiane Lemieux is a Professor in the Department of Statistics and Actuarial Science at the University of Waterloo and Associate Dean of Operations and Academic for the Faculty of Mathematics. Her research focuses on quasi-Monte Carlo methods, low-discrepancy sequences, and their applications in computational finance, machine learning, and risk management. Education includes a Ph.D. in Computer Science from Université de Montréal (2000), M.Sc. in Mathematics from Université de Montréal (1996), and B.Sc. in Actuarial Science from Université Laval (1994). Her research explores quasi-Monte Carlo methods for multidimensional integration, low-discrepancy sequence constructions, dependence concepts for point set characterization, machine learning-based construction paradigms, and applications in finance and risk management. Recent publications demonstrate strong emphasis on combining quasi-Monte Carlo methods with machine learning techniques, particularly graph neural networks for low-discrepancy point set generation and randomized methods for various computational applications. Awards include the Outstanding Performance Award from University of Waterloo (2012, 2018, 2022) and Journal of Complexity IBC Young Researcher Award (2004). She actively supervises graduate students and postdoctoral researchers, and has led several NSERC and MITACS grants supporting her research program.

James A. MingoView profile

Professor

• Free probability
• Random matrices
• Operator algebras
• +5 more

James A. Mingo is a Professor in the Department of Mathematics and Statistics at Queen's University. His research focuses on free probability, random matrices, operator algebras, and related areas. He holds a Ph.D. from Dalhousie University. Education: Ph.D. (Dalhousie University) Research Interests: Mingo's work explores the interplay between free probability and random matrices, with applications to operator algebras and mathematical physics. Key topics include infinitesimal freeness, asymptotic distributions of random matrices, and combinatorial structures in non-commutative probability. His contributions bridge abstract algebraic frameworks with probabilistic methods, addressing questions in both theoretical and applied contexts. Grants and Collaborations: Mingo collaborates widely, as evidenced by his co-authored papers with researchers like Roland Speicher, Mihai Popa, and Daniel Munoz George. His research has been supported by grants from institutions like the Simons Foundation. Teaching and Service: Mingo has taught courses such as STAT/MTHE 353 and MATH 892 at Queen's University, reflecting his commitment to both undergraduate and graduate education. He also organizes research seminars and workshops in free probability and random matrices.

• Discrete Mathematics
• Combinatorics
• Number Theory
• +5 more

Professor Peter Larcombe is a prominent academic in the College of Science and Engineering at the University of Derby, specializing in Discrete and Applied Mathematics. His research focuses on Horadam sequences, combinatorial identities, and mathematical communication. He has published extensively on topics including recurrence relations, matrix methods, and the philosophy of mathematics. Key areas of exploration include the properties of Horadam sequences, the interplay between writing and mathematical practice, and the sociocultural aspects of mathematical genius. His work often bridges theoretical mathematics with pedagogical and philosophical inquiries, emphasizing clarity and interdisciplinary approaches. Notable contributions include foundational studies on recurrence identities, generating functions, and the analysis of matrix invariants. His articles frequently appear in journals like the Palestine Journal of Mathematics and Fibonacci Quarterly , reflecting his deep engagement with number theory, combinatorics, and linear algebra. Research Themes: Sequence Theory, Mathematical Communication, Combinatorial Analysis Collaborators: Eric Fennessey, Ovidiu Bagdasar Key Tools: Generating functions, matrix exponentiation, recurrence relation techniques

Wayne GoddardView profile

Professor

• Graph Theory
• Discrete Mathematics
• Algorithms
• +1 more

Wayne Goddard is Professor at Clemson University with joint appointments in the School of Computing and School of Mathematical and Statistical Sciences within the College of Science. He specializes in discrete mathematics with research focusing on graph theory, algorithms, and combinatorial optimization. His research explores fundamental questions in graph theory including domination parameters, isolation numbers, packing problems, and graph toughness. Recent publications examine extremal values of graph invariants, structural properties of regular graphs, and combinatorial optimization techniques. Goddard has developed educational materials covering algorithms, graph theory, discrete mathematics, and programming. He teaches courses including Data Structures, Algorithms, Linear Algebra, and Graph Theory at both undergraduate and graduate levels. He is recognized as a Fellow of The Institute of Combinatorics and its Applications, reflecting his contributions to discrete mathematics. His research continues to advance understanding of structural graph properties and combinatorial optimization techniques.

• Commutative Algebra
• Factorization Theory
• Algebraic Number Theory
• +2 more

Dr. Jim Coykendall is Professor in the Department of Mathematical and Statistical Sciences at Clemson University's College of Science. He serves as Managing Editor of the Journal of Commutative Algebra and specializes in commutative algebra, factorization theory, and algebraic structures. Research includes: Generalizations of unique factorization domains Monoid algebras and atomicity Ideal graph theory Extensions of algebraic number fields Honors include: Carnegie Foundation U.S. Professor of the Year (North Dakota, 2005) E. T. Bell Prize for undergraduate research Multiple teaching awards from Cornell and NDSU He directs the Clemson Calculus Challenge and Math Club, with extensive PhD student mentorship in factorization theory.

Marcus ZibrowiusView profile

Professor

• Algebraic Geometry
• Topology
• K-Theory
• +3 more

Marcus Zibrowius is a Professor of Topology and Geometry at Heinrich Heine University Düsseldorf, affiliated with the Mathematical Institute within the Faculty of Mathematics and Natural Sciences. His research focuses on areas where mathematical rigor intersects with visual interpretation, particularly in topology and geometry. Research interests span Algebraic Geometry, K-Theory, and emerging applications of Topological Data Analysis in computational linguistics. His work integrates theoretical mathematics with computational approaches, exploring structures from Coxeter groups to vector bundles. Zibrowius has led the ADAM project (2022-2024), developing innovative educational tools like the Lean Game Server. He teaches courses ranging from Algebraic Topology to Linear Algebra and mentors students through seminars on quadratic forms and knot theory.

Pavlos TzermiasView profile

Professor

• Arithmetic Algebraic Geometry
• Algebraic Number Theory
• Analytic Number Theory
• +2 more

Professor Pavlos Tzermias is a faculty member at the Department of Mathematics, University of Patras, Greece. He holds a Ph.D. (1995) and M.Sc. (1991) in Mathematics from the University of California, Berkeley, and the University of Chicago, respectively, along with a B.Sc. from the University of Patras (1990). His research focuses on Arithmetic Algebraic Geometry and Algebraic/Analytic Number Theory , particularly on problems related to Fermat curves, torsion points, and Diophantine geometry. His recent publications explore themes such as Catalan’s constant , Mirimanoff polynomials , and p-adic series . Despite extensive collaborations with researchers like Yasuyuki Kachi and Martine Girard, no formal student advising or scientific awards are documented. Tzermias teaches Linear Algebra II , Algebraic Topology , and Algebra in the university’s graduate programs.

Harald UnkelbachView profile

Professor

• Operations Management
• Logistics
• Information Technology in Business
• +3 more

Prof. Harald Unkelbach is a distinguished academic and business leader affiliated with the University of Louisville, where he co-founded the Global MBA program in 2000 and has taught Operations Management since 2002. He holds a dual role as Head of the Würth Business Academy, an educational division of Adolf Würth GmbH & Co. KG, a global industrial wholesaler. His expertise spans mathematics, operations, logistics, and IT applied to business challenges. Education & Research : A mathematics doctoral graduate, his early research included seminal work on finite Hughes planes in geometry. His current focus integrates mathematical principles into business strategy and education. He was honored with a Doctor of Public Service (Honoris Causa) from the University of Louisville in 2013. Community & Arts : A prominent arts advocate, he curated a 15,000-piece art collection displayed in Würth-funded galleries. He serves as Chairman of the Philharmonia of Nations, and advises the International Bach Academy and Energy & Climate Protection Foundation.

• Number Theory
• Algebraic Geometry
• Representation Theory
• +3 more

Dr. Annika Burmester is a Researcher affiliated with the Faculty of Mathematics at Bielefeld University. Her primary role involves advancing research within the Department of Mathematics, focusing on algebraic structures and number theory. She is an active member of the Collaborative Research Centre/Transregio 358 (SFB/TRR 358) 'Integral Structures in Geometry and Representation Theory', contributing to projects A1 and C1 which explore lattice structures, hyper-Kähler varieties, and moduli spaces. Her research interests bridge multiple areas including Number Theory, Algebraic Geometry, and Representation Theory, with particular emphasis on multiple zeta values, Eisenstein series, and q-series. Dr. Burmester’s work often intersects combinatorial algebra and modular forms, addressing foundational questions in these fields through innovative analytical and algebraic techniques. Her publications since 2020 reflect a deep engagement with formal zeta values, q-analogues, and their applications in understanding deeper algebraic structures. While no specific awards are listed, her involvement in high-profile SFB/TRR projects underscores her contributions to collaborative interdisciplinary research. Dr. Burmester collaborates within the university’s vibrant mathematical community, leveraging the Faculty of Mathematics’ strengths in theoretical and applied research. Her office is located in UHG V5-205, and she can be reached via annika.burmester@math.uni-bielefeld.de.

Ljiljana BrankovicView profile

Professor

• Cybersecurity and Privacy
• Algorithms
• Graph Theory
• +1 more

Dr. Ljiljana Brankovic is a Professor in Computational Science at the School of Science and Technology, University of New England (UNE). She holds a PhD in Computer Science from the University of Newcastle (1998) and a Graduate Electrical Engineer degree from the University of Belgrade (1987). Her research spans cybersecurity and privacy , algorithms , graph theory , and privacy-preserving machine learning , with significant funding from the Australian Research Council, German Research Foundation, London Mathematical Society, and Royal Society, UK. Education : PhD (Computer Science), University of Newcastle (1998); Graduate Electrical Engineer, University of Belgrade (1987). Her work on privacy integrates technological , ethical , legal , and psychological aspects . In algorithms, she focuses on parameterized approximation algorithms for NP-hard problems. Google Scholar articles (2025–2017) reflect her expertise in combinatorial algorithms , graph theory , privacy-preserving techniques , and machine learning applications in domains like healthcare , explosion prediction , and botanical identification . 2025 : Diverging Assessment: A Student Perspective; Advancements in Medicinal Plant Identification Using Deep Learning. 2024 : Diverging assessments: what, why, and experiences; Incremental and Zero-Shot Machine Learning for Vietnamese Medicinal Plant Classification. 2023–2017 : Domination chain complexity, ambient intelligence for health, upper domination facets, face-antimagic graphs. While no explicit awards are listed, her research funding and editorial roles (e.g., special issues on combinatorial algorithms and privacy) underscore her contributions. She has also co-authored works on statistical database security , mobile agent security , and network privacy , with over 150 publications in theoretical and applied domains.

Andrew SchopierayView profile

Assistant Professor

• Tensor categories
• Representation theory
• Algebra
• +3 more

Dr. Andrew Schopieray is an Assistant Professor in the Department of Mathematical and Statistical Sciences at Marquette University, with a teaching-focused role as a Teaching Assistant Professor. He concurrently holds an Assistant Professor position at the State University of New York (SUNY) at Plattsburgh. His research emphasizes advanced mathematical structures, including tensor categories, representation theory, and algebraic topology. His work spans publications in prestigious journals like the Journal of the London Mathematical Society and Quantum Topology, focusing on categorification, modular categories, and quantum symmetries. Personal interests include wildlife conservation and alpinism, alongside a decade of professional culinary experience. Dr. Schopieray’s academic contributions bridge pure mathematics with interdisciplinary applications, reflecting his dual commitment to teaching and research. His email addresses are accessible at both institutions, enabling academic collaboration.

Thorsten TheobaldView profile

Professor

• Optimization
• Algebraic Geometry
• Discrete Mathematics
• +3 more

Thorsten Theobald Thorsten Theobald is a Professor of Mathematics at the Goethe University Frankfurt am Main, affiliated with the Institute of Mathematics within the Department of Mathematics and Computer Science. His research focuses on discrete and computational geometry, algebraic geometry, optimization, and their applications. He has held visiting positions at institutions such as the Simons Institute for the Theory of Computing (Berkeley), the Mittag-Leffler Institute (Sweden), and Yale University. Education and Career Ph.D. (Dr. rer. nat.) in Computer Science, University of Trier (1997) Habilitation in Mathematics, Technical University of Munich (2003) Professor (W3) at Goethe University Frankfurt since 2006 Research and Awards His work bridges algebraic geometry and optimization, with contributions to polynomial optimization, tropical geometry, and semidefinite programming. Key awards include the Felix Klein Teaching Award (2003), Walther von Dyck Award (2000), and recognition as a Fellow of the German National Merit Foundation (1991–1995). Teaching and Mentorship He teaches courses on optimization, algebraic geometry, and discrete mathematics, and has mentored over 70 students (Bachelor, Master, and Ph.D.). Notable Ph.D. students include Constantin Ickstadt and Timo de Wolff. He has also mentored postdoctoral researchers such as Giulia Codenotti and Mahsa Sayyary Namin. Professional Activities Principal Investigator in DFG Priority Program 2458 (Combinatorial Synergies) Editorial Board Member of Beiträge zur Algebra und Geometrie and SIAM Journal on Applied Algebra and Geometry Organizer of conferences such as the Summer School on Nonlinear Optimization and Combinatorics (2025) and the Frankfurt-Darmstadt Afternoons on Optimization Labs and Collaborations He co-leads the DIGO Research Seminar (Discrete Mathematics, Geometry, and Optimization) and collaborates with institutions like École Polytechnique (Paris) and the Simons Institute. His work integrates theoretical advances with computational tools, emphasizing interdisciplinary applications.

Nataša JonoskaView profile

Professor

• Biomolecular computation
• Symbolic dynamics
• Formal languages

Nataša Jonoska is Distinguished University Professor in Mathematics & Statistics at USF, specializing in biomolecular computation, symbolic dynamics and formal languages. She investigates how biological processes solve computational problems using mathematical tools from algebra, combinatorics, and topology. Honors: AAAS Fellow (elected), MAA-FL Distinguished Teaching Award (2021), Rozenberg Tulip Award (2007). Current research focuses on DNA self-assembly computations and spatial graph models for DNA recombination.

Alex BeltonView profile

Professor

• Matrix Positivity
• Quantum Probability
• Open Quantum Systems
• +3 more

Professor Alex Belton is Head of School and Professor of Mathematics at the University of Plymouth's School of Engineering, Computing and Mathematics. Previously at Lancaster University (15 years) where he served as Head of Mathematics and Statistics and co-founded the School of Mathematics. Research focuses on matrix positivity, quantum probability, open quantum systems, and operator semigroups. Developed theoretical frameworks for quantum stochastic flows and matrix analysis techniques with applications in mathematical physics. Recent work (2020-2024) advances matrix positivity preservers, kernel functions, and quantum stochastic processes. Supervised PhD completions include Michał Gnacik (2014) and Jason Hancox (2018). Current teaching includes MATH1705 Probability. Serves as external examiner for Manchester Metropolitan University, University College Cork, and other institutions. Professional experience includes postdoctoral positions at University College Cork, Université Claude Bernard Lyon 1, and Université Louis Pasteur Strasbourg 1. Trustee of Lancaster University School of Mathematics governing body.

Marcus GarvieView profile

Associate Professor

• Computational Geometry
• Numerical Analysis
• Reaction-Diffusion Equations
• +4 more

Dr. Marcus Garvie is an Associate Professor of Mathematics in the Department of Mathematics & Statistics at the University of Guelph, within the College of Engineering and Physical Sciences. His research focuses on computational geometry, numerical analysis, and mathematical biology, with a particular emphasis on polyomino tiling problems, predator-prey dynamics, and reaction-diffusion equations. He collaborates extensively with researchers like John Burkardt and Catalin Trenchea, publishing in journals such as Theoretical Computer Science and Contributions to Discrete Mathematics . Garvie's teaching experience spans secondary education, community colleges, and Arizona State University, where he funded his PhD through teaching roles. At Guelph, he teaches large undergraduate courses in Business Mathematics, Linear Algebra, and Numerical Methods, emphasizing real-world applications and textbook-independent workbooks. His MATLAB-based repositories on Zenodo highlight practical implementations of his research. His academic journey includes doctoral training in numerical analysis of parabolic PDEs and finite element methods. Current projects explore linear programming approaches to tiling puzzles like the Eternity puzzle, while prior work addressed optimal control theory and Turing patterns in ecological systems. Publications span computational mathematics, ecology, and algorithm design, with a focus on bridging theoretical insights and computational tools. His work often integrates numerical methods with biological applications, reflecting a dual commitment to mathematical rigor and applied problem-solving.