5 citations · 10 across the 6 of their papers we have counts for
6 papers
Maintaining Arrays of Contiguous Objects
Michael A. Bender, Sándor P. Fekete, Tom Kamphans +1
In this paper we consider methods for dynamically storing a set of different objects ("modules") in a physical array. Each module requires one free contiguous subinterval in order…
Optimal competitive online ray search with an error-prone robot
Tom Kamphans, Elmar Langetepe
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be sol…
Exploring Simple Triangular and Hexagonal Grid Polygons Online
Daniel Herrmann, Tom Kamphans, Elmar Langetepe
We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells…
Exploring Grid Polygons Online
Christian Icking, Tom Kamphans, Rolf Klein +1
We investigate the exploration problem of a short-sighted mobile robot moving in an unknown cellular room. To explore a cell, the robot must enter it. Once inside, the robot knows…
Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks
Sandor Fekete, Tom Kamphans, Michael Stelzer
A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect bioch…
Online Square Packing
Sandor P. Fekete, Tom Kamphans, Nils Schweer
We analyze the problem of packing squares in an online fashion: Given a semi-infinite strip of width 1 and an unknown sequence of squares of side length in [0,1] that arrive from a…