The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties
N Fischer, M Künnemann, M Redzic - Proceedings of the 2024 Annual ACM …, 2024 - SIAM
We revisit the classic k-Dominating Set problem. Besides its importance as perhaps the most
natural W [2]-complete problem, it is among the first problems for which a tight nk-o (1) …
natural W [2]-complete problem, it is among the first problems for which a tight nk-o (1) …
Algorithms for sparse convolution and sublinear edit distance
N Fischer - 2023 - publikationen.sulb.uni-saarland.de
In this PhD thesis on fine-grained algorithm design and complexity, we investigate output-
sensitive and sublinear-time algorithms for two important problems.(1) Sparse Convolution …
sensitive and sublinear-time algorithms for two important problems.(1) Sparse Convolution …
On the Fine-Grained Complexity of Approximating Max k-Coverage
H Wang - International Workshop on Frontiers in Algorithmics, 2024 - Springer
The max k-coverage problem asks us to select k subsets from a collection S of subsets of a
universe U, such that the union of these k subsets covers as many elements of U as …
universe U, such that the union of these k subsets covers as many elements of U as …