2005 |
31 | EE | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
Exploring Simple Grid Polygons.
COCOON 2005: 524-533 |
2004 |
30 | EE | Christian Icking,
Rolf Klein,
Elmar Langetepe,
Sven Schuierer,
Ines Semrau:
An Optimal Competitive Strategy for Walking in Streets.
SIAM J. Comput. 33(2): 462-486 (2004) |
2003 |
29 | EE | Christian Icking,
Rolf Klein,
Peter Köllner,
Lihong Ma:
Java Applets for the Dynamic Visualization of Voronoi Diagrams.
Computer Science in Perspective 2003: 191-205 |
28 | EE | Manuel Abellanas,
Ferran Hurtado,
Vera Sacristan,
Christian Icking,
Lihong Ma,
Rolf Klein,
Elmar Langetepe,
Belén Palop:
Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett. 86(5): 283-288 (2003) |
2001 |
27 | EE | Manuel Abellanas,
Ferran Hurtado,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Lihong Ma,
Belén Palop,
Vera Sacristan:
Smallest Color-Spanning Objects.
ESA 2001: 278-289 |
26 | EE | Christian Icking,
Lihong Ma:
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D.
STOC 2001: 316-321 |
25 | | Christian Icking,
Rolf Klein,
Lihong Ma,
Stefan Nickel,
Ansgar Weißler:
On bisectors for different distance functions.
Discrete Applied Mathematics 109(1-2): 139-161 (2001) |
24 | | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized self-approaching curves.
Discrete Applied Mathematics 109(1-2): 3-24 (2001) |
23 | EE | Frank Hoffmann,
Christian Icking,
Rolf Klein,
Klaus Kriegel:
The Polygon Exploration Problem.
SIAM J. Comput. 31(2): 577-600 (2001) |
2000 |
22 | | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
Exploring an Unknown Cellular Environment.
EWCG 2000: 140-143 |
21 | EE | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
On the Competitive Complexity of Navigation Tasks.
Sensor Based Intelligent Robots 2000: 245-258 |
1999 |
20 | EE | Christian Icking,
Rolf Klein,
Ngoc-Minh Lê,
Lihong Ma,
Francisco Santos:
On bisectors for convex distance functions in 3-space.
CCCG 1999 |
19 | EE | Christian Icking,
Rolf Klein,
Elmar Langetepe:
An Optimal Competitive Strategy for Walking in Streets.
STACS 1999: 110-120 |
18 | EE | Christian Icking,
Rolf Klein,
Lihong Ma,
Stefan Nickel,
Ansgar Weißler:
On Bisectors for Different Distance Functions.
Symposium on Computational Geometry 1999: 291-299 |
17 | | Amitava Datta,
Christian Icking:
Competitive searching in a generalized street.
Comput. Geom. 13(2): 109-120 (1999) |
16 | EE | Christoph A. Hipke,
Christian Icking,
Rolf Klein,
Elmar Langetepe:
How to Find a Point on a Line Within a Fixed Distance.
Discrete Applied Mathematics 93(1): 67-73 (1999) |
1998 |
15 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized Self-Approaching Curves.
ISAAC 1998: 317-326 |
14 | EE | Frank Hoffmann,
Christian Icking,
Rolf Klein,
Klaus Kriegel:
Moving an Angle Around a Region.
SWAT 1998: 71-82 |
1997 |
13 | | Frank Hoffmann,
Christian Icking,
Rolf Klein,
Klaus Kriegel:
A Competitive Strategy for Learning a Polygon.
SODA 1997: 166-174 |
1995 |
12 | EE | Christian Icking,
Rolf Klein:
Searching for the Kernel of a Polygon - A Competitive Strategy.
Symposium on Computational Geometry 1995: 258-266 |
11 | | Christian Icking,
Rolf Klein,
Ngoc-Minh Lê,
Lihong Ma:
Convex Distance Functions in 3-Space are Different.
Fundam. Inform. 22(4): 331-352 (1995) |
1994 |
10 | | Christian Icking,
Rolf Klein:
Competitive Strategies for Autonomous Systems.
Modelling and Planning for Sensor Based Intelligent Robot Systems 1994: 23-40 |
9 | EE | Amitava Datta,
Christian Icking:
Competitive Searching in a Generalized Street.
Symposium on Computational Geometry 1994: 175-182 |
1993 |
8 | | Christian Icking,
Rolf Klein,
Lihong Ma:
How to Look Around a Corner.
CCCG 1993: 443-448 |
7 | EE | Christian Icking,
Rolf Klein,
Ngoc-Minh Lê,
Lihong Ma:
Convex Distance Functions in 3-Space are Different.
Symposium on Computational Geometry 1993: 116-123 |
6 | | Christian Icking,
Günter Rote,
Emo Welzl,
Chee-Keng Yap:
Shortest Paths for Line Segments.
Algorithmica 10(2-4): 182-200 (1993) |
1992 |
5 | | Bengt J. Nilsson,
Thomas Ottmann,
Sven Schuierer,
Christian Icking:
Restricted Orientation Computational Geometry.
Data Structures and Efficient Algorithms 1992: 148-185 |
4 | | Christian Icking,
Rolf Klein:
The Two Guards Problem.
Int. J. Comput. Geometry Appl. 2(3): 257-285 (1992) |
1991 |
3 | EE | Christian Icking,
Rolf Klein:
The Two Guards Problem.
Symposium on Computational Geometry 1991: 166-175 |
1990 |
2 | | Arne Andersson,
Christian Icking,
Rolf Klein,
Thomas Ottmann:
Binary Search Trees of Almost Optimal Height.
Acta Inf. 28(2): 165-178 (1990) |
1987 |
1 | | Christian Icking,
Rolf Klein,
Thomas Ottmann:
Priority Search Trees in Secondary Memory (Extended Abstract).
WG 1987: 84-93 |