## I Overview – The Research Units

### Cached

### Download Links

### BibTeX

@MISC{_ioverview,

author = {},

title = {I Overview – The Research Units},

year = {}

}

### OpenURL

### Abstract

### Citations

59 | The Flow Complex: A Data Structure for Geometric Modeling - Giesen, John |

43 | Coordination mechanisms
- Christodoulou, Koutsoupias, et al.
- 2004
(Show Context)
Citation Context ...t is represented using the CGAL class Nef polyhedron S2 of the corresponding CGAL package [15]. Obviously, this approach is not applicable in all cases but it turned out to be a very efficient filter =-=[19]-=-. Given the information of the adjacency graph and the environment maps, it is now possible to initialize the boundary cycles of all faces of the arrangement A(Q). To initialize a cycle we start with ... |

43 | Speed scaling with an arbitrary power function
- Bansal, Chan, et al.
- 2009
(Show Context)
Citation Context ...unbounded faces. This also enables to represent a (two-dimensional) minimization diagram of a set of surfaces representing their lower envelope: Each face is labeled with the lowest surfaces above it =-=[22]-=-. On surfaces, in contrast to the standard sweep-line, we have to deal with certain additional issues, that occur, as we allow that the parameterization is not injective on the boundary of the possibl... |

40 | Classroom examples of robustness problems in geometric computations - Kettner, Mehlhorn, et al. - 2004 |

40 | ESTER: efficient search on text, entities, and relations - Bast, Chitea, et al. - 2007 |

39 | Rank-maximal matchings
- Irving, Michail, et al.
(Show Context)
Citation Context ...icularly, it was observed that there is a d ∗ k < dk such that all best known polynomial-time algorithms fail if d > d ∗ k , and succeed if d < d∗ k . In a remarkable paper Achlioptas and Coja-Oghlan =-=[1]-=- proved that this is no coincidence, confirming a hypothesis stated by statistical physicists in 2005 [3]. They showed for several random constraint satisfaction problems that the point where the algo... |

39 | A lower bound for scheduling mechanisms - Christodoulou, Koutsoupias, et al. - 2007 |

36 | Runtime analysis of a simple ant colony optimization algorithm - Neumann, Witt - 2006 |

36 | Speed scaling of tasks with precedence constraints - Pruhs, Stee, et al. |

32 | The wake-up problem in multi-hop radio networks
- Chrobak, Ga¸sieniec, et al.
- 2004
(Show Context)
Citation Context ... this arc using exact topological description of an algebraic curve and tracks the arc in two opposite directions. In each step it encounters 8 different directions (pixels) to follow. Range analysis =-=[21]-=- and some heuristic observations enable to compute quickly the next pixel in a curve trace. In case of a tie, the current pixel 6 http://www.macromedia.com/software/flash/about/ 832 The Algorithms an... |

30 | Fast and exact geometric analysis of real algebraic plane curves - Eigenwillig, Kerber, et al. - 2007 |

28 | Efficient Models for Timetable Information in Public Transportation Systems - Pyrga, Schulz, et al. |

27 | A quasi-PTAS for profitmaximizing pricing on line graphs - Elbassioni, Sitters, et al. - 2007 |

27 | C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation 18(4 - Friedrich, He, et al. - 2010 |

26 | Bayesian combinatorial auctions - Christodoulou, Kovács, et al. - 2008 |

26 | K.M.: Efficient graphlet kernels for large graph comparison - Shervashidze, Vishwanathan, et al. - 2009 |

24 | Generating all vertices of a polyhedron is hard - Khachiyan, Boros, et al. - 2006 |

24 | I.: The completesearch engine: interactive, efficient - Bast, Weber - 2007 |

24 | Quasirandom rumor spreading - Doerr, Friedrich, et al. - 2008 |

23 | Approximating the volume of unions and intersections of high-dimensional geometric objects - Bringmann, Friedrich - 2008 |

23 | Nonclairvoyant speed scaling for flow and energy - Chan, Edmonds, et al. - 2009 |

22 | Exact and efficient 2D-arrangements of arbitrary algebraic curves - Eigenwillig, Kerber |

20 | A simple entropy-based algorithm for planar point location
- Arya, Malamatos, et al.
(Show Context)
Citation Context ...antly distributed in its list. We prove that if ℓ is the distance between two gates, then with high probability ℓ − (1 − ɛ)(log 2 ℓ + ln ℓ) additional rounds are needed to inform all vertices. Pittel =-=[4]-=- proved that the randomized protocol on the complete graph on n vertices informs all vertices within log 2 n + ln n ± ω(n) stages with probability 1 − o(1), for every function ω(n) such that ω(n) → ∞ ... |

19 | Boolean operations on 3d selective nef complexes : data structure, algorithms, optimized implementation and experiments - HACHENBERGER, KETTNER, et al. - 2007 |

19 | Expected runtimes of evolutionary algorithms for the Eulerian cycle problem - Neumann - 2008 |

19 |
S.: Characterizing the performance of flash memory storage devices and its impact on algorithm design
- Ajwani, Malinger, et al.
- 2008
(Show Context)
Citation Context ...ied the distribution of the sizes of 3-connected components inside random biconnected graphs. To this aim, a recursive description of biconnected graphs in terms of 3-connected graphs by Trakhtenbrot =-=[4]-=- turned out to be very helpful. There, a biconnected graph is decomposed into so-called cores of higher connectivity, i.e., 3-connected graphs. We investigated whether random biconnected graphs with r... |

18 | Small hop-diameter sparse spanners for doubling metrics
- Chan, Gupta
- 2006
(Show Context)
Citation Context ... the sufficiently good approximation of the tangent planes of the quadrics at the given vertex. The arrangement is represented using the CGAL class Nef polyhedron S2 of the corresponding CGAL package =-=[15]-=-. Obviously, this approach is not applicable in all cases but it turned out to be a very efficient filter [19]. Given the information of the adjacency graph and the environment maps, it is now possibl... |

17 | Optimal expected-case planar point location
- Arya, Malamatos, et al.
(Show Context)
Citation Context ... be presented [2], which provides the same type of discrepancy guarantee, while having an improved running time and allowing much simpler implementations. In recent work (manuscript under preparation =-=[5]-=-), we perform an experimental evaluation of the quality of the point sets produced by the algorithm. Our results show that the point sets produced by our method are comparable in quality to those of m... |

17 |
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms
- Baswana, Sen
- 2007
(Show Context)
Citation Context ...d M. Theile. Improved analysis methods for crossover-based algorithms. In G. Raidl and F. Rothlauf, eds., Genetic and Evolutionary Computation Conference 2009, Montreal, Canada, 2009. ACM. To appear. =-=[7]-=- M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, 2004. [8] A. El-Fallahi, C. Prins, and R. W. Calvo. A memetic algorithm and a tabu search for the multi-compartment vehicle routing probl... |

17 | Deterministic random walks on the two-dimensional grid - Doerr, Friedrich |

17 | Approximating the least hypervolume contributor: NP-Hard in general, but fast in practice - Bringmann, Friedrich - 2009 |

16 | Mechanism design for fractional scheduling on unrelated machines
- Christodoulou, Kovacs
(Show Context)
Citation Context ...rboloid of one sheet (green). To the right: The sphere maps of the four vertices and a face on the hyperboloid. ellipsoids, cones, cylinders, hyperboloids, planes, and double planes. In Hemmer et al. =-=[8, 18]-=-, we recently reached a major goal towards the arrangement of quadrics, namely an implementation for the computation of the adjacency graph G(Q). The approach is based on Dupont et al. [9, 20], which ... |

16 | Sweeping and maintaining twodimensional arrangements on surfaces: A first step - BERBERICH, FOGEL, et al. - 2007 |

15 | Do additional objectives make a problem harder - Brockhoff, Friedrich, et al. |

15 | Guaranteed-delivery geographic routing under uncertain node locations - Funke, Milosavljevic - 2007 |

14 | Deterministic random walks on the integers - COOPER, DOERR, et al. |

14 | Speeding up evolutionary algorithms through asymmetric mutation operators - Doerr, Hebbinghaus, et al. - 2007 |

14 | Conflict-Free Coloring for Rectangle Ranges Using
- Ajwani, Elbassioni, et al.
(Show Context)
Citation Context ...estigator: Kurt Mehlhorn in cooperation with Peter Sanders (Karlsruhe Institute of Technology) Kurt Mehlhorn and Peter Sanders published a textbook “Data Structures and Algorithms: The Basic Toolbox” =-=[1]-=-. The book appeared with Springer Verlag and is intended for undergraduate courses in algorithms. The preface states: “Algorithms are at the heart of every nontrivial computer application. Therefore e... |

14 | H.: Computing H/D-exchange speeds of single residues from data of peptic fragments
- Althaus, Canzar, et al.
- 2008
(Show Context)
Citation Context ...ation of time since its arrival until it completes its service requirement. The first non-trivial algorithms with poly-logarithmic competitive ratio for this problem were obtained relatively recently =-=[11, 8]-=-, and it was widely believed that the problem admits a constant factor competitive algorithm. In [6], we showed an ω(1) lower bound on the competitive ratio of any deterministic online algorithm. Our ... |

13 | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs, Combinatorica 29 - Cooley, Fountoulakis, et al. - 2009 |

13 | Conjoint analysis to measure the perceived quality in volume rendering - Giesen, Mueller, et al. |

13 | Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems - Boros, Elbassioni, et al. |

12 |
Algorithms and Data Structures: The Basic Toolbox
- Mehlhorn, Sanders
- 2008
(Show Context)
Citation Context ...H such that the problem can be solved in plain-exponential time O ∗ (c n(G)+n(H) ) for some constant c. We unify and extend the previously known classes by considering graphs H of bounded cliquewidth =-=[2]-=-. A k-expression is an expression that creates a labelled graph using four basic operations, with k different labels used for the vertices. The cliquewidth cwd(H) of a graph H is the smallest k for wh... |

12 | Deterministic Random Walks on Regular Trees. Random Structures and Algorithms - Cooper, Doerr, et al. - 2010 |

12 | Complexity of real root isolation using continued fractions - Sharma |

12 |
On the separation and equivalence of paging strategies
- Angelopoulos, Dorrigiv, et al.
- 2007
(Show Context)
Citation Context ... which is conceptually embedded on a sphere surrounding the vertex. We call this arrangement the environment map of a vertex. This is similar to the existing approach for the arrangement of planes in =-=[16]-=-. Following the generic programming paradigm [2] we do not enforce that such an environment map is constructed via the intersection with a certain bounding object. So far, we have investigated two app... |

12 | Exact arrangements on tori and Dupin cyclides - Berberich, Kerber - 2008 |

12 | Exact geometric-topological analysis of algebraic surfaces - Berberich, Kerber, et al. - 2008 |

12 | Faster evolutionary algorithms by superior graph representations - Doerr, Klein, et al. - 2007 |

12 | Near-perfect load balancing by randomized rounding - Friedrich, Sauerwald - 2009 |