#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1959

2015

- This year (0)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan
- INFORMS Journal on Computing
- 2013

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 is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T… (More)

- Karl Bringmann, Kurt Mehlhorn, Adrian Neumann
- ArXiv
- 2012

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. Sociologists conjecture that people find routes greedily by passing the message to an acquaintance that has more in common with the target than themselves, e. g. if a… (More)

- Michael Dirnberger, Adrian Neumann, Tim Kehl
- Scientific reports
- 2015

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 graphs is widely available and has been applied to study various types of networks. In some applications, graph acquisition is relatively simple. However, for… (More)

- Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
- Algorithmica
- 2013

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 is 3-edge-connected, it returns a construction sequence that constructs the input graph from the graph with two vertices and three parallel edges using only… (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 }mi=1. We want to open a set F ⊆ V of k facilities such that the worst case connection cost over all client sets is minimized; that is, minimize maxi ∑ v∈Si d(F, v).… (More)

- A NEUMANN
- Monatsschrift für Kinderheilkunde
- 1959

- A G Helminck, J Hilgert, A Neumann, G Olafsson
- 1998

In this paper we prove that two Cartan subspaces of a semisimple symmetric pair (g, τ) are conjugate under G = Int(g) if and only if they are conjugate under (Gτ )0. Moreover we derive a double coset decomposition for G, which improves the results of Oshima and Matsuki.

- Adrian Neumann
- 2015

- ‹
- 1
- ›