1 citations · 2 across the 4 of their papers we have counts for
4 papers
Efficient Algorithms for Measuring the Funnel-likeness of DAGs
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier +1
Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if every source-sink path can be uniquely identified by one of its arcs. Funnels are an analog to trees f…
The Parameterized Complexity of Centrality Improvement in Networks
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applic…
The Complexity of Routing with Few Collisions
Till Fluschnik, Marco Morik, Manuel Sorge
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph with two distinct terminal verti…
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing
René van Bevern, Iyad Kanj, Christian Komusiewicz +2
Given a hypergraph , the Planar Support problem asks whether there is a planar graph on the same vertex set as such that each hyperedge induces a connected subgraph of $…