1 citations · 1 across the 13 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Bandwidth Parameterized by Cluster Vertex Deletion Number
Tatsuya Gima, Eun Jung Kim, Noleen Köhler +2
Given a graph and an integer , Bandwidth asks whether there exists a bijection from to such that $\max_{\{u, v \} \in E(G)} | π(u) - π(v)…
cs.DS2023
Structural Parameterizations for Two Bounded Degree Problems Revisited
Michael Lampis, Manolis Vasilakis
We revisit two well-studied problems, Bounded Degree Vertex Deletion and Defective Coloring, where the input is a graph and a target degree and we are asked either to edit…
cs.DS2023
Parameterized Max Min Feedback Vertex Set
Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
Given a graph and an integer , Max Min FVS asks whether there exists a minimal set of vertices of size at least whose deletion destroys all cycles. We present several re…