1 citations · 1 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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
Parameterized Critical Node Cut Revisited
Dušan Knop, Nikolaos Melissinos, Manolis Vasilakis
We study how to sparsify connectivity in graphs under a tight deletion budget. Given a graph and integers , Critical Node Cut (CNC) asks whether we can delete at mos…