The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |