30 citations · 100 across the 41 of their papers we have counts for
4 papers · 1 filter
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting gr…
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…
Assessing the Computational Complexity of Multi-Layer Subgraph Detection
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch +3
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple type…
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…