I have been a member of Seton Hall University's Department of Mathematics and Computer Science since 2005. Before that I received my Ph.D. and M.S. in Mathematics from Stevens Institute of Technology, and my M.A.T. (Masters of Arts in Teaching) and B.S. degrees from Duke University. In between attending those two institutions, I also spent a few years as a research analyst for an educational research firm.
Since joining the department I have had the pleasure of teaching just about every course offered, from the introductory Calculus and Statistics classes to the upper level History of Mathematics, our Analysis sequence, and our Junior seminar. I have also developed new courses, in Graph Algorithms and in Text Mining. I teach the latter course as part of our new M.S. in Data Science program.
My primary research area is graph theory, sometimes called network theory in applications, and I am one of the authors of a recent survey paper on the degree sequences of graphs and their relationship to various graph and network parameters. I have also written on the Tutte polynomials of graphs, network reliability, barrier sets in graphs, and matching theory.
- Ph.D., Stevens Institute of Technology
- M.S., Stevens Institute of Technology
- B.S., Duke University
- Faculty advisor for Marie Sokol's NASA-sponsored NJSGC 2020 Summer Student Research Fellowship project "Building Extremal Networks"
- Graph Vulnerability Parameters, Compression, and Quasi-Threshold Graphs. Discrete Applied Mathematics 259 (2019), 119-126.
- Tutte Polynomials and Graph Compression (invited talk), MAA-NJ Special Session on Graph Theory, Montclair, New Jersey, October 2018
- Tutte Polynomials and Graph Compression (invited talk), Graph Theory Day 75, Brooklyn College, Brooklyn, New York, April 2018
- On Constructing Rational Spanning Tree Edge Densities (invited talk), Special Session on Applications of Network Analysis, in Honor of Charlie Suffel's 75th Birthday, AMS Eastern Sectional Meeting, New York City, New York, May 2017
- On the Value of Independence Polynomials at -1 (invited talk), Special Session on Graph Vulnerability Parameters and their Role in Network Analysis, AMS Eastern Sectional Meeting, Stony Brook, New York, March 2016
- On Constructing Rational Spanning Tree Edge Densities. Discrete Applied Mathematics 213 (2016), 224-232.
- A Note on the Values of Independence Polynomials at -1. (with J. Cutler) Discrete Mathematics 339 (2016), 2723-2726.
- On a Conjecture of Levit and Mandrescu. (with H. Quense, and T. Wager) Congressus Numerantium 227 (2016), 177-185.
- Best Monotone Degree Conditions for Graph Properties: A Survey. (with D. Bauer, H.J. Broersma, J. van den Heuvel, A. Nevo, E. Schmeichel, D.R. Woodall, and M. Yatauro.) Graphs and Combinatorics 31 (2015), 1-22.
- Faculty editor for Locus: The Seton Hall Journal of Undergraduate Research