Dr. Tom Kamphans

Office	Braunschweig University of Technology Computer Science, Algorithms Group, Room 262B Mühlenpfordtstraße 23 38106 Braunschweig Germany		+49 (531) 391 3117
		Fax	+49 (531) 391 5936
Consulting hours	By appointment

Research areas

• Computational Geometry
• Robot Motion Planning
• Online Algorithms

Publications

Doctoral thesis

• Models and Algorithms for Online Exploration and Search
  University of Bonn, 2005.

Proceedings, articles, reports

• Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Nils Schweer, Jürgen Teich
  Virtual Area Management: Multitasking on Dynamically Partially Reconfigurable Devices
  Proc. 17th Reconf. Architect. Workshop, 2010.

• Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Nils Schweer, Jürgen Teich
  Maintaining Virtual Areas on FPGAs using Strip Packing with Delays
  Technical Report ArXiv:1001.4493, Computing Research Repository, 2010.

• Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Christiane Schmidt
  Robot Swarms for Exploration and Triangulation of Unknown Environments
  Abstracts 26th European Workshop Comput. Geom., 2010.

• Sándor P. Fekete, Tom Kamphans, Michael Stelzer, Jibin Sun, An-Ping Zeng
  Methods for Analyzing Bioreaction Databases
  In preparation, 2010.

• Tom Kamphans, Elmar Langetepe
  Inspecting a set of strips optimally
  Proc. 20th Algorithms and Data Structure Symposium (WADS),
  Lecture Notes Comput. Sci. 5664, Springer, 2009, pp. 423-434.

• Tom Kamphans, Elmar Langetepe
  Inspecting a set of strips optimally
  Abstracts 25th European Workshop Comput. Geom., 2009, pp. 163-166.

• Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer
  Maintaining Arrays of Contiguous Objects
  Proc. 17th Internat. Sympos. Fund. Comput. Theory,
  Lecture Notes Comput. Sci. 5699, 2009, pp. 14-25.

• Sándor P. Fekete, Tom Kamphans, Nils Schweer
  Online Square Packing
  Proc. 20th Algorithms and Data Structure Symposium (WADS),
  Lecture Notes Comput. Sci. 5664, Springer, 2009, pp. 302-314.

• Sándor P. Fekete, Tom Kamphans, Nils Schweer
  Online Square Packing
  Abstracts 25th European Workshop Comput. Geom., 2009, pp. 269-272.

• Ali Ahmadinia, Josef Angermeier, Sándor P. Fekete, Diana Göhringer, Tom Kamphans, Dirk Koch, Mateusz Majer, Nils Schweer, Jürgen Teich, Christopher Tessars, Jan C. van der Veen
  ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices
  In Dynamically Reconfigurable Systems: Architectures, Design Methods and Applications,
  edited by Marco Platzner, Jürgen Teich, Norbert Wehn, Springer, 2009, pp. 199-221.

• Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
  Competitive online approximation of the optimal search ratio
  Siam J. Comput., pp. 881-898, 2008.

• Daniel Herrmann, Tom Kamphans, Elmar Langetepe
  Exploring Simple Triangular and Hexagonal Grid Polygons Online
  Abstracts 24th European Workshop Comput. Geom., 2008, pp. 177-180.

• Rolf Klein, Tom Kamphans
  Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt
  In Taschenbuch der Algorithmen,
  edited by Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, eXamen.press , Springer, 2008, pp. 75-81.

• Tom Kamphans, Elmar Langetepe
  Leaving an unknown maze using an error-prone compass
  accepted for Internat. J. Comput. Geom. Appl., 2008.

• Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Dirk Koch, Nils Schweer, Jürgen Teich, Christopher Tessars, Jan C. van der Veen
  No-Break Dynamic Defragmentation of Reconfigurable Devices
  Proc. Internat. Conf. Field Program. Logic Appl., 2008, pp. 113-118.

• Daniel Herrmann, Tom Kamphans, Elmar Langetepe
  Exploring Simple Triangular and Hexagonal Grid Polygons Online
  Technical Report 007, Department of Computer Science I, University of Bonn, 2007.

• Bernd Brüggemann, Tom Kamphans, Elmar Langetepe
  Escaping from a Labyrinth with One-way Roads for Limited Robots
  Abstracts 3rd European Conf. Mobile Robots, 2007.

• Bernd Brüggemann, Tom Kamphans, Elmar Langetepe
  Leaving an Unknown Maze with One-Way Roads
  Abstracts 23rd European Workshop Comput. Geom., 2007, pp. 90-93.

• Bernd Brüggemann, Tom Kamphans, Elmar Langetepe
  Leaving an Unknown Maze with One-Way Roads
  Abstracts 12th European Conf. Operational Research, 2007, pp. 140.

• Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
  Searching for rays and lower bound constructions
  Abstracts 12th European Conf. Operational Research, 2007, pp. 65.

• Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
  Competitive Online Searching for a Ray in the Plane
  Robot Navigation,
  Dagstuhl Seminar Proceedings , Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.

• Birgit Engels, Tom Kamphans
  Randolph's Robot Game is NP-hard!
  Electronic Notes in Discrete Mathematics 25, pp. 49-53, 2006.

• Tom Kamphans, Elmar Langetepe
  Optimal competitive online ray search with an error-prone robot
  Technical Report 003, Department of Computer Science I, University of Bonn, 2005.

• Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe
  Exploring grid polygons online
  Technical Report 001, Department of Computer Science I, University of Bonn, 2005.

• Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
  Competitive Online Searching for a Ray in the Plane
  Abstracts 21st European Workshop Comput. Geom., 2005, pp. 107-110.

• Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe
  Exploring simple grid polygons
  11th Internat. Comput. Combin. Conf.,
  Lecture Notes Comput. Sci. 3595, Springer, 2005, pp. 524-533.

• Tom Kamphans, Elmar Langetepe
  Optimal competitive online ray search with an error-prone robot
  Proc. 4th Internat. Workshop Efficient Experim. Algorithms,
  Lecture Notes Comput. Sci. 3503, Springer, 2005, pp. 593-596.

• Tom Kamphans, Elmar Langetepe
  On optimizing multi-sequence functionals for competitive analysis
  Abstracts 21st European Workshop Comput. Geom., 2005, pp. 111-114.

• Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
  Competitive online approximation of the optimal search ratio
  Proc. 12th Annu. European Sympos. Algorithms,
  Lecture Notes Comput. Sci. 3221, Springer-Verlag, 2004, pp. 335-346.

• Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
  Competitive search ratio of graphs and polygons
  Abstracts 20th European Workshop Comput. Geom.,
  Universidad de Sevilla, 2004, pp. 127-130.

• Tom Kamphans, Elmar Langetepe
  Finding a door along a wall with an error afflicted robot
  Abstracts 20th European Workshop Comput. Geom.,
  Universidad de Sevilla, 2004, pp. 143-146.

• Tom Kamphans, Elmar Langetepe
  The Pledge Algorithm Reconsidered under Errors in Sensors and Motion
  Proc. of the 1th Workshop on Approximation and Online Algorithms,
  Lecture Notes Comput. Sci. 2909, Springer, 2003, pp. 165-178.

• Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
  On the competitive complexity of navigation tasks
  Sensor Based Intelligent Robots,
  Lecture Notes Comput. Sci. 2238, Springer, Berlin, 2002, pp. 245-258.

• Tom Kamphans, Elmar Langetepe
  Online Bewegungsplanung für Roboter
  Vorlesungsskript, Universität Bonn, Institut für Informatik, 2002.

• Tom Kamphans, Rolf Klein
  Bewegungsplanung für Roboter
  Vorlesungsskript, Universität Bonn, Institut für Informatik, 2001.

• Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
  Exploring an Unknown Cellular Environment
  Abstracts 16th European Workshop Comput. Geom.,
  Ben-Gurion University of the Negev, 2000, pp. 140-143.

Software

• Tom Kamphans, Michael Stelzer
  SPUL: Shortest Path with Unique Labels
  C++ program, 2008.

• Ulrich Handel, Tom Kamphans, Elmar Langetepe, Wolfgang Meiswinkel
  PolyRobot - an environment for simulating strategies for robot navigation in polygonal scenes
  Java Applet, 2002.

• Ulrich Handel, Christian Icking, Tom Kamphans, Elmar Langetepe, Wolfgang Meiswinkel
  GridRobot - an environment for simulating exploration strategies in unknown cellular areas
  Java Applet, 2000.

• Geometry-Lab

Photographs

• Roomba-Art

Some of my talks

• Robot Swarms for Exploration and Triangulation of Unknown Environments, FRONTS 2nd Year General Assembly Meeting, Feb. 01, 2010, Barcelona, Spain: Animated slides (Apple Keynote file), Printable slides (PDF)
• Project ReCoNodes, Project Summary, Sept. 25, 2009, Karlsruhe, Germany: Animated slides (Apple Keynote file), Printable slides (PDF)
• Maintaining Arrays of Contiguous Objects, FCT 2009, Wrocƚaw, Poland
• Exploring Simple Triangular and Hexagonal Grid Polygons Online, EuroCG 2008, Nancy, France (Animated slides, Printable slides with notes)
• Leaving an Unknown Maze with One-Way Roads, EURO 2007, Prag
• PhD Talk 04.04.2006 (Animated slides, Printable slides with notes)
• Exploring Simple Grid Polygons, Cocoon 2005, Kunming, China (Animated slides, Printable slides with notes)
• Exploring Simple Grid Polygons, Bonn, July 2005
• Optimal Competitive Online Ray Search with an Error-Prone Robot, WEA '05, Santorini, Greece
• The Pledge Algorithm Reconsidered under Errors in Sensors and Motion, WAOA 2003, Budapest

Master thesis

• Torsten Emmerich, Tom Kamphans
  Hardwareunterstützung octreebasierter 3D-Graphik
  Universität Dortmund, 1997.

Former Affiliations