research
∙
09/13/2021
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
The NP-hard Multiple Hitting Set problem is finding a minimum-cardinalit...
share
research
∙
11/08/2020
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable
The Hierarchical Chinese Postman Problem is finding a shortest traversal...
research
∙
12/25/2018
On (1+ε)-approximate problem kernels for the Rural Postman Problem
Given a graph G=(V,E) with edge weights ω E→ N∪{0} and a subset R⊆ E of ...
research
∙
06/29/2018
Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
We consider a variant of the matroid median problem introduced by Krishn...
research
∙
06/29/2018
Fixed-parameter algorithms for facility location under matroid constraints
We introduce a new uncapacitated discrete facility location problem, whe...
research
∙
06/29/2018
Facility location under matroid constraints: fixed-parameter algorithms and applications
We study an NP-hard uncapacitated discrete facility location problem: Th...
research
∙
06/25/2018
Parameterized algorithms and data reduction for the short secluded s-t-path problem
Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we sea...
research
∙
06/25/2018