66 citations · 457 across the 33 of their papers we have counts for
5 papers · 1 filter
Fixed-Parameter Algorithms for DAG Partitioning
René van Bevern, Robert Bredereck, Morgan Chopin +4
Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. [ACM SIGKDD 2009] as DAG Partitioning: given an arc-weighted directed acyclic…
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
René van Bevern, Till Fluschnik, George B. Mertzios +3
This work studies the parameterized complexity of finding secluded solutions to classical combinatorial optimization problems on graphs such as finding minimum s-t separators, feed…
Precedence-constrained scheduling problems parameterized by partial order width
René van Bevern, Robert Bredereck, Laurent Bulteau +3
Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,|, the problem of finding a non-preempti…
h-Index Manipulation by Undoing Merges
René van Bevern, Christian Komusiewicz, Hendrik Molter +3
The h-index is an important bibliographic measure used to assess the performance of researchers. Dutiful researchers merge different versions of their articles in their Google Scho…
A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations
René van Bevern, Artem V. Pyatkin
The open shop problem is to find a minimum makespan schedule to process each job on each machine for time such that, at any time, each machine processes at mos…