10 citations · 20 across the 5 of their papers we have counts for
5 papers
NEFI: Network Extraction From Images
Michael Dirnberger, Adrian Neumann, Tim Kehl
Networks and network-like structures are amongst the central building blocks of many technological and biological systems. Given a mathematical graph representation of a network, m…
New Approximability Results for the Robust k-Median Problem
Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn +1
We consider a robust variant of the classical -median problem, introduced by Anthony et al. \cite{AnthonyGGN10}. In the \emph{Robust -Median problem}, we are given an -ver…
Online Checkpointing with Improved Worst-Case Guarantees
Karl Bringmann, Benjamin Doerr, Adrian Neumann +1
In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only…
Certifying 3-Edge-Connectivity
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in linear time. If the input graph is not 3-edge-connected, the algorithm returns a…
Remarks on Category-Based Routing in Social Networks
Karl Bringmann, Kurt Mehlhorn, Adrian Neumann
It is well known that individuals can route messages on short paths through social networks, given only simple information about the target and using only local knowledge about the…