Andrew Owens

Andrew Owens is an Assistant Professor in the Department of Mathematics at Widener University. He holds a PhD in Mathematics from Auburn University (2019) and a BS from the University of Texas (2008).

His research focuses on discrete mathematics and graph theory, with specific emphasis on antimagic labelings, rainbow cycle forbidding in edge colorings, and combinatorial structures in finite graphs. He participated in the Graduate Research Workshop in Combinatorics and the MASAMU research workshop in Southern Africa.

Recent publications highlight his work on antimagic orientations, extremal graph theory, and rainbow-free edge colorings. His research intersects theoretical computer science and applied mathematics through problems in network analysis and combinatorial optimization.

At Auburn University, Owens coordinated outreach programs engaging ~100 middle school students annually in advanced mathematics problems. He plans to continue similar initiatives at Widener and other institutions nationwide.

Owens has collaborated on projects related to graph orientation constraints, multipartite graph structures, and rainbow-free combinatorics, with publications in journals like Discrete Mathematics and Graphs and Combinatorics.