30 citations · 158 across the 36 of their papers we have counts for
4 papers · 1 filter
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments
René van Bevern, Christian Komusiewicz, Rolf Niedermeier +2
An author's profile on Google Scholar consists of indexed articles and associated data, such as the number of citations and the H-index. The author is allowed to merge articles; th…
On Kernelization and Approximation for the Vector Connectivity Problem
Stefan Kratsch, Manuel Sorge
In the Vector Connectivity problem we are given an undirected graph , a demand function , and an integer . The question is whether there exi…
The Minimum Feasible Tileset problem
Yann Disser, Stefan Kratsch, Manuel Sorge
We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (t…
Constant-factor approximations for Capacitated Arc Routing without triangle inequality
René van Bevern, Sepp Hartung, André Nichterlein +1
Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all…