43 citations · 187 across the 40 of their papers we have counts for
Showing 2017 · cs.CCShow all
2 papers · 2 filters
cs.CC2017
Kernelization Lower Bounds for Finding Constant-Size Subgraphs
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instan…
cs.CC2017
When can Graph Hyperbolicity be computed in Linear Time?
Till Fluschnik, Christian Komusiewicz, George B. Mertzios +3
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen int…