Networks are amongst the central building blocks of many systems. Given a graph of a network, methods from graph theory enable a precise investigation of its properties. Software for the analysis ofâ€¦ (More)

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 2-edge-cut. If itâ€¦ (More)

We consider a variant of the classical k-median problem, introduced by Anthony et al. [1]. In the Robust k-Median problem, we are given an n-vertex metric space (V, d) and m client sets {Si âŠ† Vâ€¦ (More)

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 operation allowedâ€¦ (More)

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 operation allowedâ€¦ (More)

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 topology.â€¦ (More)