#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2002

2018

- This year (4)
- Last 5 years (12)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- André Berger, Rudolf Müller, Seyed Hossein Naeemi
- SAGT
- 2009

We study implementability in dominant strategies of social choice functions when types are multi-dimensional, sets of outcomes are arbitrary, valuations for outcomes are convex functions in the type,… (More)

- Martin Claussen, Lawrence A. Mysak, +16 authors Zhaomin Wang

We propose a new perspective on the hierarchy of climate models which goes beyond thè`classical'' climate modeling pyramid that is restricted mainly to atmospheric processes. Most notably, we… (More)

Many polynomial-time solvable combinatorial optimization problems become NP-hard if an additional complicating constraint is added to restrict the set of feasible solutions. In this paper, we… (More)

- André Berger, Michelangelo Grigni
- ICALP
- 2007

We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15],… (More)

We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex… (More)

- André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
- Theor. Comput. Sci.
- 2007

In this paper, we discuss the approximability of the capacitated b-edge dominating set problem, which generalizes the edge dominating set problem by introducing capacities and demands on the edges.… (More)

- André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller
- Simulation
- 2011

Delays in a railway network are a common problem that railway companies face in their daily operations. When a train is delayed, it may either be beneficial to let a connecting train wait so that… (More)

- André Berger, Ojas Parekh
- 2005

In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS problem. We present an exact… (More)

In this paper we consider the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of connected components. We present the picture of the… (More)

We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight… (More)