|
1 |
An efficient graph algorithm for dominance constraints
Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2004
|
|
|
|
2 |
Effiziente Algorithmen
Oberwolfach-Walke : Mathematisches Forschungsinstitut Oberwolfach, 2003
|
|
|
3 |
Maintaining dynamic sequences under equality tests in polylogarithmic time
Enthalten in Algorithmica Bd. 17, Nr. 2, date:2.1997: 183-198
|
|
|
|
4 |
Algorithms for routing in planar graphs
Enthalten in Acta informatica Bd. 23, Nr. 2, date:5.1986: 163-176
|
|
|
|
5 |
Space sweep solves intersection of convex polyhedra
Enthalten in Acta informatica Bd. 21, Nr. 5, date:12.1984: 501-519
|
|
|
|
6 |
A new data structure for representing sorted lists
Enthalten in Acta informatica Bd. 17, Nr. 2, date:6.1982: 157-184
|
|
|
|
7 |
Lower bounds on the efficiency of transforming static data structures into dynamic structures
Enthalten in Theory of computing systems Bd. 15, Nr. 1, date:12.1981: 1-16
|
|
|
|
8 |
A Separation Bound for Real Algebraic Expressions
Enthalten in Algorithmica Bd. 55, 4.12.2007, Nr. 1, date:9.2009: 14-28
|
|
|
|
9 |
Certifying 3-Edge-Connectivity
Enthalten in Algorithmica Bd. 77, 22.9.2015, Nr. 2, date:2.2017: 309-335
|
|
|
|
10 |
Congruence, similarity, and symmetries of geometric objects
Enthalten in Discrete & computational geometry Bd. 3, 1.9.1988, Nr. 3, date:9.1988: 237-256
|
|
Administration
