Core team:


Puck Rombach

University of Vermont

Department of Mathematics and Statistics, Assistant Professor

Rombach's research bridges gaps between the pure and applied sides of graph/network theory. Sample areas of interest for Rombach include graph coloring, random graphs, algorithms and complexity, graph representations of matroids, crime network modeling, and core-periphery/centrality detection in networks. Prior to UVM, Rombach was an assistant adjunct professor at UCLA, working with Andrea Bertozzi. Rombach earned her PhD at the University of Oxford in 2013, under the supervision of Mason Porter and Alex Scott.


Most recent papers:


Role colouring graphs in hereditary classes.

Puck Rombach, Christopher Purcell. Preprint, 2018.
[pdf]

Rank Aggregation for Course Sequence Discovery.

Mihai Cucuringu, Charles Z. Marshak, Dillon Montag, Puck Rombach. Studies in Computational Intelligence, , , 2017.
[pdf] [journal page] [arXiv]

Core-Periphery Structure in Networks (Revisited).

Puck Rombach, Mason A. Porter, James H. Fowler, Peter J. Mucha. SIAM Rev., 619-649, 59, 2017.
[pdf]

Detection of core–periphery structure in networks using spectral methods and geodesic paths.

Puck Rombach, Mason A. Porter, Mihai Cucuringu, Sang Hoon Lee. European Journal of Applied Mathematics, , 27, 2016.
[pdf]

(show all)