9 citations · 47 across the 26 of their papers we have counts for
5 papers · 1 filter
Diminishable Parameterized Problems and Strict Polynomial Kernelization
Henning Fernau, Till Fluschnik, Danny Hermelin +3
Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has trigg…
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…
Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in Temporal Graphs
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier +1
Dynamics of interactions play an increasingly important role in the analysis of complex networks. A modeling framework to capture this are temporal graphs which consist of a set of…
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…