28 citations · 71 across the 13 of their papers we have counts for
4 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…
A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching
Václav Blažej, Ondřej Suchý, Tomáš Valla
The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching a…
On Directed Steiner Trees with Multiple Roots
Ondřej Suchý
We introduce a new Steiner-type problem for directed graphs named \textsc{-Root Steiner Tree}. Here one is given a directed graph and two subsets of its vertices, …