Find Academic Supervisors

Auxiliadora Sarmiento VegaView profile

Professor

• Audio Source Separation
• Biomedical Signal Processing
• Machine Learning
• +5 more

Auxiliadora Sarmiento Vega is a full professor at the University of Seville 's School of Engineering within the Department of Signal Theory and Communications . With over two decades of research experience, her work bridges audio signal processing and biomedical applications, focusing on blind source separation, entropy-based methods, and machine learning for healthcare diagnostics. Research Pillars : Audio source separation, biomedical signal/image analysis, and virtual reality integration Key Projects : ACACIA (Signal Analysis), NEUBIAS (Bioimage Analysts Network), and multiple NIH-funded biomedical imaging initiatives Academic Contributions span 15+ years, with groundbreaking work in: Alpha-Beta divergence clustering algorithms EEG processing for motor imagery BCI systems Automated breast cancer grading from histological images Glaucoma and diabetic retinopathy diagnostics via retinal image analysis Virtual reality platforms for emotion analysis research She actively collaborates with institutions like the IEEE Women in Engineering (Spanish section secretary) and NEUBIAS network , while mentoring through outreach programs like g4g Day that empower young women in STEM.

Robert JohnsonView profile

Senior Lecturer

• extremal combinatorics
• graph theory
• probabilistic combinatorics
• +3 more

Dr. Robert Johnson is a Senior Lecturer in Pure Mathematics at Queen Mary University of London, affiliated with the School of Mathematical Sciences. He leads the Communication and Public Engagement for the Centre for Combinatorics, Algebra and Number Theory. His research focuses on extremal combinatorics, graph theory, and probabilistic combinatorics, with particular emphasis on extremal problems on graphs, set systems, permutations, and discrete hypercube structures. Robert Johnson earned his PhD from the University of Cambridge in 2003 and joined Queen Mary in 2004 after a postdoctoral position at the London School of Economics. His work has contributed significantly to combinatorial optimization, Ramsey theory, and hypercube graph analysis. He has supervised multiple PhD students, including Trevor Pinto (2016), A Nicholas Day (2017), and Natalie Behague (2020), with current advisees Belinda Wickes and Asier Calbet Ripodas. His research explores topics such as resistor network optimization, synchronizing automata, and extremal set systems, with applications in discrete mathematics and theoretical computer science. Notable contributions include studies on multicolour Ramsey numbers of odd cycles and Turán properties in hypercube intersection graphs. Johnson's publications span over two decades, covering areas like permutation correlation, hypercube saturation, and Kneser graph Hamiltonicity. He is actively involved in mentoring and welcomes inquiries from prospective PhD candidates. His affiliations include the Combinatorics group at Queen Mary’s School of Mathematical Sciences and the Centre for Combinatorics, Algebra and Number Theory, where he drives public engagement initiatives.

Matthew JustView profile

Lecturer

• Number Theory
• Combinatorics
• Arithmetic Geometry
• +1 more

Matthew Just is a Lecturer in the Department of Mathematics at the University of Georgia, where he completed his PhD in 2022 after earning BS (2012) and MS (2016) degrees from Georgia Southern University. He teaches mathematics courses for middle grades education majors and mentors undergraduate research. His educational background includes: BS in Mathematics, Georgia Southern University, 2012 MS in Mathematics, Georgia Southern University, 2016 PhD in Mathematics, University of Georgia, 2022 Just's research centers on number theory and combinatorics, investigating the interplay between additive and multiplicative structures, integer partitions, and analytic properties of power series/modular forms. His earlier work developed transmission models for Ebola and typhoid outbreaks, demonstrating cross-disciplinary applications in mathematical biology. His publication trends reveal deep integration of analytic methods across number theory and combinatorics, with emerging connections to arithmetic geometry through partition Eisenstein series and semi-modular forms, while maintaining relevance to real-world problems via epidemiological modeling. His academic honors include: Outstanding Graduate Teaching Assistant (2019) David Galewski Outstanding Graduate Teaching Award (2020) As an active mentor, Just guides over 10 undergraduate researchers through the Directed Reading Program and as Undergraduate Research Mentor for combinatorics/number theory, yielding one published paper and multiple manuscripts in preparation. He also provides specialized tutoring for students with diverse learning needs across all age groups. He participates in departmental seminars like Combinatorics SMARTS and contributes to the academic community through the UGA Duplicate Bridge Club, while balancing family life with his wife Erin and children Filly and August.

• Combinatorics
• Enumerative Mathematics
• Discrete Mathematics
• +1 more

Daniel Warren is an Associate Professor of Instruction in Mathematics at the University of Texas at Arlington's College of Science. Specializes in combinatorics and discrete mathematics with emphasis on enumerative problems and pattern avoidance. Research examines combinatorial structures including permutation patterns, packing densities, and discrete optimization problems. Current investigations focus on enumerative combinatorics and discrete mathematical relationships. Publications explore permutation avoidance, packing densities in combinatorial patterns, and discrete optimization frameworks, establishing foundational contributions to enumerative combinatorics. Awards: MAA Faculty of the Year (2019-2020) Supervision: Mentored undergraduate thesis on graphical representations of Grimm's conjecture and minimal interval lengths.

Zorah LähnerView profile

Professor

• Computer Vision
• Shape Matching
• Machine Learning
• +3 more

Prof. Dr. Zorah Lähner is a Professor at the University of Siegen, leading research in the Department of Computer Vision. She will be transitioning to an Assistant Professor position at the University of Bonn starting January 2025. Her work bridges computer vision, machine learning, and quantum computing, focusing on fundamental geometric and algorithmic challenges in 3D shape analysis. Research interests span: Advanced shape matching methodologies Neural field representations on manifolds Quantum annealing applications in computer vision Scale-invariant correspondence frameworks Latent space alignment techniques Her publications demonstrate consistent innovation in geometric deep learning, with recent works exploring quantum-hybrid approaches for shape matching and neural fields for manifold learning. Publications predominantly appear in top-tier venues like CVPR, ICCV, and NeurIPS. While no specific awards are listed in the provided text, she maintains active collaborations across European institutions and supervises research in computer graphics and vision through her Lehrstuhl position.

Matthias BeckView profile

Professor

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

Matthias Beck is a Professor of Mathematics at San Francisco State University (SFSU), where he has held positions since 2004. He specializes in combinatorics, number theory, and discrete geometry, focusing on lattice-point enumeration in polyhedra and Ehrhart theory. His research has led to influential textbooks such as Computing the Continuous Discretely (2007) and Combinatorial Reciprocity Theorems (2018). Beck has also contributed to education through the Art of Proof textbook and leadership roles like Associate Chair of the Mathematics Department. Beck's academic journey includes a Ph.D. from Temple University (2000) and postdoctoral fellowships at institutions like MSRI and the Max Planck Institute. His awards include the MAA's Deborah and Franklin Tepper Haimo Award for Distinguished Teaching (2013). He has advised numerous graduate and undergraduate students, fostering collaborations in research areas from magic squares to graph colorings. His work bridges pure and applied mathematics, with applications in music theory, optimization, and combinatorial geometry. Beck actively participates in academic service, including editorial roles at journals like the Electronic Journal of Combinatorics and leadership in initiatives like the National Alliance for Doctoral Studies in Mathematics.

Darij GrinbergView profile

Assistant Professor

• Algebraic Combinatorics
• Noncommutative Algebra
• Symmetric Functions
• +3 more

Darij Grinberg is an Assistant Professor in Mathematics at Drexel University, specializing in algebraic combinatorics and noncommutative algebra. He received his PhD from MIT in 2016 and previously served at the University of Minnesota. His research explores symmetric functions, Hopf algebras, and combinatorial structures through rigorous theoretical frameworks. Recent publications focus on combinatorial algebras, symmetric group representations, and Hopf algebra applications. His work shows a consistent pattern of advancing foundational theories in combinatorics while developing novel connections between algebraic structures and discrete mathematics.

Margaret BayerView profile

Professor

• Combinatorics
• Discrete Geometry
• Convex Polytopes
• +3 more

Margaret Bayer is a Professor in the Department of Mathematics at the University of Kansas, within the College of Liberal Arts & Sciences. She specializes in combinatorics and discrete geometry, with research focusing on convex polytopes, hyperplane arrangements, Eulerian posets, and flag vectors. Her work bridges combinatorics with algebraic geometry, particularly through connections to toric varieties. Her research explores the combinatorial structure of geometric objects, including face lattices of polytopes and the interplay between algebraic and geometric properties. Recent work includes studies on cut complexes of graphs, matching complexes, and applications of combinatorial methods in education and algorithm design. Bayer has authored/co-authored over 40 publications, including foundational works on flag vectors, the cd-index of Eulerian posets, and lattice polytopes derived from Schur polynomials. Her articles often address topics like polytope enumeration, topological properties of graph complexes, and combinatorial optimization in exam design. She serves as Book Review Editor for the Association for Women in Mathematics Newsletter and has advised numerous collaborative projects. Her teaching includes intermediate analysis and discrete mathematics courses.

Neal MadrasView profile

Professor

• Probability Theory
• Discrete Mathematics
• Mathematical Modeling in the Sciences
• +5 more

Neal Madras is a Full Professor in the Department of Mathematics and Statistics at York University's Faculty of Science. His research focuses on probability theory, discrete mathematics, and mathematical modeling in the sciences. He explores applications in statistical mechanics, theoretical computer science, communications networks, and biological systems. Notable interests include self-avoiding walks, polymer behavior modeling, and disease progression mechanisms. Madras has contributed to interdisciplinary studies, such as HIV dynamics and mosquito population modeling under climate influences. He is also actively involved in mathematics competitions like the Canadian Mathematical Olympiad. His work bridges theoretical rigor and practical applications, with a focus on stochastic processes, combinatorial problems, and computational methods. Publications span topics from graph theory and knot invariants to epidemic control strategies and polymer adsorption. Madras maintains an active research program, engaging with both foundational mathematical questions and real-world problem-solving.

Karel CasteelsView profile

Lecturer

• Algebra
• Quantum Algebra
• Combinatorics
• +3 more

Dr. Karel Casteels is a Lecturer at the University of California, Santa Barbara (UCSB), with a cross-appointment between the Department of Mathematics (College of Letters and Science) and the College of Creative Studies. He holds a PhD from Simon Fraser University (2010), supervised by Jason Bell. His career includes a Visiting Assistant Professorship at UCSB and a Marie Curie Research Fellowship at the University of Kent (2013-2015). His research focuses on quantum algebras, combinatorial models, and their intersections with algebraic structures and representation theory. He mentors undergraduate students through the UCSB Research Experience for Undergraduates (REU) program. Education: PhD in Mathematics, Simon Fraser University, Canada (2010) Research Interests: Dr. Casteels explores quantum matrices, algebraic combinatorics, and the combinatorial structure of quantum algebras. His work bridges noncommutative algebra, representation theory, and graph theory. Key Achievements: Marie Curie Research Fellowship (2013-2015) Advising & Grants: He advises undergraduate researchers via the REU program but has no listed formal advisees. Grants or funding details are not specified in the text. Labs/Teams: No specific lab or team affiliations mentioned.

Michal StašView profile

Lecturer

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +3 more

Michal Staš is a Lecturer at the Technical University of Košice, Slovakia. His current contact information includes the email michal.stas@tuke.sk and office N32 619. He teaches courses in Linear and Quadratic Programming , Computer Modeling , and Mathematics II . His research focuses on Graph Theory , particularly on problems related to crossing numbers , cyclic permutations , and join graph operations . His recent publications (2020–2022) analyze crossing numbers of graphs combining wheels, paths, cycles, and discrete graphs, using techniques like cyclic permutations. Keywords from his work include Graph Theory , Combinatorics , Discrete Mathematics , and Computational Geometry .

Dana RandallView profile

Professor

• Theoretical Computer Science
• Randomized Algorithms
• Statistical Physics
• +4 more

Dana Randall is the ADVANCE Professor of Computing and an Adjunct Professor of Mathematics at Georgia Institute of Technology. She serves as the Associate Dean for Access and Advancement in the College of Computing, Co-Executive Director of the Institute for Data Engineering and Science (IDEaS), and previously directed the Algorithms and Randomness Center (ARC). Her research bridges theoretical computer science, discrete mathematics, and statistical physics, focusing on randomized algorithms and stochastic processes. Education: A.B. in Mathematics, Harvard University (1988) Ph.D. in Computer Science, University of California, Berkeley (1994) Research Interests: Randomized algorithms and Markov chain Monte Carlo methods Computational problems in statistical physics Combinatorics, distributed algorithms, and collective computation Awards & Honors: Fellow of the American Mathematical Society (AMS) National Associate of the National Academies Former Sloan Fellow and NSF Career Award recipient Grants & Leadership: Principal Investigator on a $6.25M ARO MURI grant on collective emergent behavior (2019–2024) Co-founder and Co-Executive Director of IDEaS (2016–2019) Directed the Algorithms and Randomness Center (2014–2016) Labs & Teams: Active in the Algorithms and Randomness Center (ARC) and Institute for Data Engineering and Science (IDEaS), focusing on interdisciplinary research in algorithms, data science, and computational theory.

Thomas BerrettView profile

Associate Professor

• Nonparametric Statistics
• Statistical Methodology
• Machine Learning
• +3 more

Thomas Berrett is an Associate Professor (Reader) in the Department of Statistics at the University of Warwick. Previously, he held postdoctoral positions at CREST, ENSAE, Institut Polytechnique de Paris (2019–2020) and the Statistical Laboratory at the University of Cambridge (2017–2019). His research focuses on nonparametric statistical methods, including entropy estimation, independence testing, classification, and applications of nearest neighbor methods under privacy constraints. He has received prestigious awards such as the ERC Starting Grant (2024–2029) and the Royal Statistical Society Research Prize (2020). Berrett is also the Intercalated Year Coordinator at Warwick, guiding students in industry placements and study abroad programs at institutions like TU Dresden and the University of Hong Kong. Research Interests: Nonparametric statistics, statistical methodology, privacy-preserving analysis (e.g., differential privacy), missing data imputation, and applications in classification and hypothesis testing. His work bridges theoretical advancements with practical challenges in data privacy and robust statistical inference. Grants & Awards: ERC Starting Grant (2024–2029) Bernoulli Society New Researcher Award (2023, Honourable Mention) EPSRC New Investigator Award (2022–2024) IMS New Researcher Travel Award (2020) Royal Statistical Society Research Prize (2020) Teaching & Service: Fellow of the Higher Education Academy (FHEA). Taught courses on Multivariate Statistics, Nonparametric Estimation, and Statistical Theory at both Cambridge and Warwick. Organized workshops on distributed data analysis and entropy estimation in collaboration with leading institutions.

Nathan LindzeyView profile

Assistant Professor

• Algebraic Combinatorics
• Graph Theory
• Discrete Mathematics
• +3 more

Nathan Lindzey is an Assistant Professor in the Department of Mathematical Sciences at the University of Memphis. His research focuses on algebraic combinatorics, graph theory, and discrete mathematics, with particular emphasis on extremal combinatorics, permutation patterns, and computational complexity. He has published extensively on topics such as intersecting families of spanning trees, derangement graphs, and applications of algebraic methods in combinatorial optimization. Dr. Lindzey's work bridges theoretical foundations and practical applications, including studies on association schemes, semidefinite optimization, and harmonic polynomials. His recent articles address challenges in graph theory, coding theory, and algorithm analysis, reflecting a commitment to advancing interdisciplinary approaches in discrete mathematics. His research trends highlight contributions to understanding extremal problems in combinatorics, leveraging algebraic tools and computational techniques. Though no awards are explicitly listed, his prolific publication record underscores his active role in the academic community. Dr. Lindzey advises no listed students and has no documented grants in the provided text. He is affiliated with the University of Memphis' Mathematical Sciences department, contributing to both teaching and research initiatives in the field.

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.