Skip to main content

Staff profile

Overview

Tala Eagling-Vose

Postgraduate Student

Affiliations
AffiliationTelephone
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 Graphs
    Dabrowski, 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
  • Bounding width on graph classes of constant diameter
    Dabrowski, K. K., Eagling-Vose, T., Köhler, N., Ordyniak, S., & Paulusma, D. (2026). Bounding width on graph classes of constant diameter. In H. Fernau & P. Kindermann (Eds.), Graph-Theoretic Concepts in Computer Science: 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11–13, 2025, Revised Selected Papers (pp. 162-176). https://doi.org/10.1007/978-3-032-11835-6_12
  • Finding d-cuts in claw-free graphs
    Ahn, J., Eagling-Vose, T., Lucke, F., Paulusma, D., & Smith, S. (2025). Finding d-cuts in claw-free graphs. In 36th International Symposium on Algorithms and Computation (ISAAC 2025) (pp. 4:1-4:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2025.4