4 citations · 10 across the 13 of their papers we have counts for
4 papers · 1 filter
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
Enumeration kernelization for parameterized enumeration problems was defined by Creignou et al. [Theory Comput. Syst. 2017] and was later refined by Golovach et al. [J. Comput. Sys…
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
Matthias Bentert, Jannik Schestag, Frank Sommer
We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we ass…
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
A graph is weakly -closed if every induced subgraph of contains one vertex such that for each non-neighbor of it holds that . The weak clo…
Exploiting -Closure in Kernelization Algorithms for Graph Problems
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number such that G is c-closed. Fox et al. [I…