66 citations · 457 across the 33 of their papers we have counts for
5 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…
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…
Network-Based Vertex Dissolution
René van Bevern, Robert Bredereck, Jiehua Chen +3
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an…
Partitioning Perfect Graphs into Stars
René van Bevern, Robert Bredereck, Laurent Bulteau +4
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size st…
Interval scheduling and colorful independent sets
René van Bevern, Matthias Mnich, Rolf Niedermeier +1
Numerous applications in scheduling, such as resource allocation or steel manufacturing, can be modeled using the NP-hard Independent Set problem (given an undirected graph and an…