معرفی
Puck Rombach is an Associate Professor in the Department of Mathematics and Statistics at the University of Vermont (UVM), affiliated with the College of Engineering and Mathematical Sciences. Prior to joining UVM, she held positions including Assistant Adjunct Professor at UCLA under Andrea Bertozzi. She earned her Ph.D. from the University of Oxford in 2013, advised by Mason Porter and Alex Scott. Her research bridges pure and applied graph/network theory, focusing on graph coloring, random graphs, algorithms, crime network modeling, and core-periphery detection in networks.
Education:
- Ph.D. in Mathematics, University of Oxford (2013)
Research Interests:
- Graph Coloring and Random Graphs
- Algorithm Design and Complexity Analysis
- Applications in Crime Network Modeling
- Core-Periphery Structure Analysis
- Matroid Representations in Graphs
Research Trends: Recent work emphasizes saturation problems in graphs, positroid theory, and algorithmic approaches to network reliability and node centrality. Applications span medical networks, satellite communication systems, and criminal network dynamics.
Grants & Advising: While specific grants are not listed, her work suggests involvement in interdisciplinary projects combining theoretical and applied network science. No student advisees are explicitly mentioned in the provided materials.
Labs/Teams: Collaborates with UCLA and Oxford networks; participates in interdisciplinary initiatives at UVM’s College of Engineering and Mathematical Sciences.
