معرفی
Brendan T. Nagle is Professor in the Department of Mathematics and Statistics at the University of South Florida's College of Arts and Sciences. He holds a PhD in Mathematics from Emory University. His research focuses on extremal and probabilistic combinatorics, with particular expertise in hypergraph regularity methods and algorithmic graph theory.
His research examines:
- Hypergraph regularity lemmas and computational implementations
- Combinatorial packing and covering problems
- Extremal properties of discrete structures
- Algorithmic aspects of graph theory
He has supervised 7 PhD students to completion on topics ranging from hypergraph regularity implementations to combinatorial Ramsey theory. His research has been continuously funded by NSF grants since 2005, supporting work on combinatorial algorithms and hypergraph applications.
Professional service includes directing graduate admissions for mathematics (2011-2018) and editorial contributions to multiple combinatorics journals.
