2008 |
24 | EE | Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput. 38(3): 881-898 (2008) |
2006 |
23 | EE | Andrea Eubeler,
Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane.
Robot Navigation 2006 |
2005 |
22 | EE | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
Exploring Simple Grid Polygons.
COCOON 2005: 524-533 |
21 | EE | Thomas Kamphans,
Elmar Langetepe:
Optimal Competitive Online Ray Search with an Error-Prone Robot.
WEA 2005: 593-596 |
2004 |
20 | EE | Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio.
ESA 2004: 335-346 |
19 | EE | Ferran Hurtado,
Rolf Klein,
Elmar Langetepe,
Vera Sacristan:
The weighted farthest color Voronoi diagram on trees and graphs.
Comput. Geom. 27(1): 13-26 (2004) |
18 | EE | Annette Ebbers-Baumann,
Rolf Klein,
Elmar Langetepe,
Andrzej Lingas:
A fast algorithm for approximating the detour of a polygonal chain.
Comput. Geom. 27(2): 123-134 (2004) |
17 | 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 |
16 | EE | Thomas Kamphans,
Elmar Langetepe:
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion.
WAOA 2003: 165-178 |
15 | 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 |
14 | 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 |
13 | EE | Annette Ebbers-Baumann,
Rolf Klein,
Elmar Langetepe,
Andrzej Lingas:
A Fast Algorithm for Approximating the Detour of a Polygonal Chain.
ESA 2001: 321-332 |
12 | | 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) |
2000 |
11 | | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
Exploring an Unknown Cellular Environment.
EWCG 2000: 140-143 |
10 | EE | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
On the Competitive Complexity of Navigation Tasks.
Sensor Based Intelligent Robots 2000: 245-258 |
1999 |
9 | EE | Christian Icking,
Rolf Klein,
Elmar Langetepe:
An Optimal Competitive Strategy for Walking in Streets.
STACS 1999: 110-120 |
8 | 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 |
7 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized Self-Approaching Curves.
ISAAC 1998: 317-326 |
1997 |
6 | | Grigoris Antoniou,
Elmar Langetepe:
A Correct Logic Programming Computation of Default Logic Extensions.
J. Autom. Reasoning 18(1): 25-46 (1997) |
1994 |
5 | | Grigoris Antoniou,
Elmar Langetepe:
Soundness and Completeness of a Logic Programming Approach to Default Logic.
AAAI 1994: 934-939 |
4 | | Grigoris Antoniou,
Elmar Langetepe,
Volker Sperschneider:
New Proofs in Default Logic Theory.
Ann. Math. Artif. Intell. 12(3-4): 215-229 (1994) |
3 | EE | Grigoris Antoniou,
Elmar Langetepe:
Applying SLD-resolution to a class of non-Horn logic programs.
Bulletin of the IGPL 2(2): 229-241 (1994) |
1993 |
2 | | Grigoris Antoniou,
Elmar Langetepe:
A Process Model for Default Logic and Its Realization in Logic Programming.
EPIA 1993: 213-225 |
1 | | Grigoris Antoniou,
Elmar Langetepe,
Volker Sperschneider:
Computing Extensions of Default Logic - Preliminary Report.
LPAR 1993: 19-27 |