Staff profile
Overview
https://apps.dur.ac.uk/biography/image/5179
Tala Eagling-Vose
Postgraduate Student
Affiliation | Telephone |
---|---|
Postgraduate Student in the Department of Computer Science |
Research interests
- Structural and Algorithmic Graph Theory
- Computational Complexity of Problems Under Restricted Inputs
Publications
Conference Paper
- Finding d-Cuts in Probe H-Free GraphsDabrowski, K. K., Eagling-Vose, T., Johnson, M., Paesani, G., & Paulusma, D. (2026). Finding d-Cuts in Probe H-Free Graphs. In A. Jeż & J. Otop (Eds.), Fundamentals of Computation Theory (pp. 109-121). Springer Nature Switzerland. https://doi.org/10.1007/978-3-032-04700-7_9
- Finding d-cuts in claw-free graphsAhn, J., Eagling-Vose, T., Lucke, F., Paulusma, D., & Smith, S. (in press). Finding d-cuts in claw-free graphs. Presented at ISAAC 2025, Tainan, Taiwan.
- Bounding width on graph classes of constant diameterDabrowski, K. K., Eagling-Vose, T., Köhler, N., Ordyniak, S., & Paulusma, D. (in press). Bounding width on graph classes of constant diameter. In Lecture Notes in Computer Science.