most citedExploring Simple Triangular and Hexagonal Grid Polygons Online

5 citations · 14 across the 9 of their papers we have counts for

collaborators

9 papers

cs.DS2011★ 1 cited

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…

cs.CG2010

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…

cs.CG2010★ 5 cited

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…

cs.CG2010★ 1 cited

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…

cs.DS2010★ 3 cited

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…

cs.DS2010

No-Break Dynamic Defragmentation of Reconfigurable Devices

Sandor Fekete, Tom Kamphans, Nils Schweer +5

We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules a…