3 papers
math.CO2026
Steiner Forest for -Subgraph-Free Graphs
Tala Eagling-Vose, David C. Kutner, Felicia Lucke +4
Our main result is a full classification, for every connected graph , of the computational complexity of Steiner Forest on -subgraph-free graphs. To obtain this dichotomy, we…
cs.DS2025
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
David C. Kutner, Anouk Sommer
In train networks, carefully-chosen delays may be beneficial for certain passengers, who would otherwise miss some connection. Given a simple (directed or undirected) temporal grap…
cs.HC2022
Vibration-based communication for deafblind people
David C. Kutner, Sunčica Hadžidedić
Deafblind people have both hearing and visual impairments, which makes communication with other people often dependent on expensive technologies e.g., Braille displays, or on careg…