1 citations · 1 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Precoloring extension with demands on paths
Arun Kumar Das, Michal Opler, Tomáš Valla
Let be a graph with a set of precolored vertices, and let us be given an integer distance parameter and a set of integer demands . The Distance Precoloring E…
cs.DS2025
Pathfinding in Self-Deleting Graphs
Michal Dvořák, Dušan Knop, Michal Opler +3
In this paper, we study the problem of pathfinding on traversal-dependent graphs, i.e., graphs whose edges change depending on the previously visited vertices. In particular, we st…
cs.DS2025
Exact Algorithms for Distance to Unique Vertex Cover
Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos +2
Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach involved pre-assi…