Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
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…
cs.DS2026
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
Michal DvoÅák, AntonÃn Novák, PÅemysl Šůcha +2
This paper studies the growing domain of Robotic Process Automation (RPA) problems. Motivated by scheduling problems arising in RPA, we study the parameterized complexity of the si…
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…