CiteSeerX — I Overview – The Research Units

I Overview – The Research Units

Cached

Download Links

by Unknown Authors

BibTeX

@MISC{_ioverview,
    author = {},
    title = {I Overview – The Research Units},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

44	The flow complex: a data structure for geometric modeling - Giesen, John
35	Coordination mechanisms - Christodoulou, Koutsoupias, et al. - 2004
29	Classroom examples of robustness problems in geometric computations - Kettner, Mehlhorn, et al. - 2004
29	K.: Speed scaling with an arbitrary power function - Bansal, Chan, et al. - 2009
28	D.: The wake-up problem in multi-hop radio networks - Chrobak, G¸asieniec, et al. - 2004
28	Ester: efficient search on text, entities, and relations - Bast, Chitea, et al. - 2007
28	A lower bound for scheduling mechanisms - Christodoulou, Koutsoupias, et al.
26	Popular matchings - Abraham, Irving, et al.
26	Speed scaling of tasks with precedence constraints - Pruhs, Stee, et al. - 2008
25	Runtime analysis of a simple ant colony optimization algorithm - Neumann, Witt - 2009
22	Fast and Exact Geometric Analysis of Real Algebraic Plane Curves - Eigenwilling, Kerber, et al. - 2007
22	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models - Friedrich, He, et al.
20	Expected runtimes of evolutionary algorithms for the Eulerian cycle problem - Neumann
17	The CompleteSearch Engine: Interactive, efficient - Bast, Weber
17	Nonclairvoyant speed scaling for flow and energy - Chan, Edmonds, et al. - 2009
17	Quasirandom rumor spreading - Doerr, Friedrich, et al. - 2008
16	Exact and efficient 2D-arrangements of arbitrary algebraic curves - Eigenwillig, Kerber - 2008
15	Speeding up evolutionary algorithms through asymmetric mutation operators - Doerr, Hebbinghaus, et al.
15	Bayesian combinatorial auctions - CHRISTODOULOU, KOVÁCS, et al. - 2008
14	A simple entropy-based algorithm for planar point location - Arya, Malamatos, et al. - 2001
14	Nearly optimal expected-case planar point location - Arya, Malamatos, et al. - 2000
14	Characterizing the performance of flash memory storage devices and its impact on algorithm design - Ajwani, Malinger, et al. - 2008
14	A quasi-PTAS for profitmaximizing pricing on line graphs - Elbassioni, Sitters, et al. - 2007
13	Deterministic random walks on the twodimensional grid. Available from arXiv:math/0703453 - Doerr, Friedrich
13	Boolean operations on 3d selective nef complexes: Data structure, algorithms, and implementation - Granados, Hachenberger, et al. - 2003
13	Generating All Vertices of a Polyhedron is Hard - Khachiyan, Boros, et al. - 2008
12	Mechanism Design for Fractional Scheduling on Unrelated Machines - Christodoulou, Koutsoupias, et al.
12	Osthus: Embeddings and Ramsey numbers of sparse k-uniform hypergraphs, submitted - Cooley, Fountoulakis, et al.
12	Efficient Models for Timetable Information in Public Transportation Systems - Pyrga, Schulz, et al.
12	Conflict-free coloring for rectangle ranges using O(n 0.382+ε ) colors - Ajwani, Elbassioni, et al. - 2007
12	R.: Sweeping and maintaining two-dimensional arrangements on surfaces: A first step - Berberich, Fogel, et al. - 2007
12	Efficient graphlet kernels for large graph comparison - Shervashidze, Vishwanathan, et al.
11	Small hop-diameter sparse spanners for doubling metrics - Chan, Gupta - 2006
11	An efficient indexing scheme for multi-dimensional moving objects - Elbassioni, Elmasry, et al. - 2003
10	Deterministic random walks on the integers - Cooper, Doerr, et al.
10	Computing H/D-exchange speeds of single residues from data of peptic fragments - Althaus, Canzar, et al. - 2008
10	On the separation and equivalence of paging strategies - Angelopoulos, Dorrigiv, et al. - 2007
10	M.: Exact arrangements on tori and Dupin cyclides - Berberich, Kerber - 2008
10	Do additional objectives make a problem harder - Brockhoff, Friedrich, et al. - 2007
10	Crossover can provably be useful in evolutionary computation - Doerr, Happ, et al. - 2008
10	Near-perfect load balancing by randomized rounding - Friedrich, Sauerwald - 2012
9	Osthus: 3-uniform hypergraphs of bounded degree have linear Ramsey numbers - Cooley, Fountoulakis, et al.
9	Deterministic random walks on regular trees - Cooper, Doerr, et al. - 2008
9	Approximating the volume of unions and intersections of high-dimensional geometric objects - Bringmann, Friedrich - 2008
9	Faster evolutionary algorithms by superior graph representations - Doerr, Klein, et al. - 2007
9	On the runtime analysis of the 1-ANT ACO algorithm - Doerr, Neumann, et al. - 2007
9	Fast Algorithms for Two Scheduling Problems - Kovács - 2007
8	Conjoint analysis to measure the perceived quality in volume rendering - Giesen, Mueller, et al.
8	Complexity of real root isolation using continued fractions - Sharma
8	Approximating the interval constrained coloring problem - Althaus, Canzar, et al. - 2008