Tom Kamphans

According to our database1, Tom Kamphans authored at least 33 papers between 2000 and 2017.

Collaborative distances:



In proceedings 
PhD thesis 





A likelihood ratio-based method to predict exact pedigrees for complex families from next-generation sequencing data.
Bioinformatics, 2017

Strategies to improve the performance of rare variant association studies by optimizing the selection of controls.
Bioinformatics, 2015

Online Square Packing with Gravity.
Algorithmica, 2014

Dynamic Defragmentation of Reconfigurable Devices.
TRETS, 2012

GeneTalk: an expert exchange platform for assessing rare sequence variants in personal genomes.
Bioinformatics, 2012

Models and algorithms for online exploration and search.
PhD thesis, 2011

Exploring and Triangulating a Region by a Swarm of Robots.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

Pledge's Algorithm - How to Escape from a Dark Maze.
Proceedings of the Algorithms Unplugged, 2011

The Tourist in the Shopping Arcade.
J. UCS, 2010

Leaving an Unknown Maze Using an Error-Prone Compass.
Int. J. Comput. Geometry Appl., 2010

No-Break Dynamic Defragmentation of Reconfigurable
CoRR, 2010

Exploring Simple Triangular and Hexagonal Grid Polygons Online
CoRR, 2010

Exploring Grid Polygons Online
CoRR, 2010

Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks
CoRR, 2010

Maintaining Virtual Areas on FPGAs using Strip Packing with Delays
CoRR, 2010

Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks.
Proceedings of the Real-World Wireless Sensor Networks - 4th International Workshop, 2010

Virtual area management: Multitasking on dynamically partially reconfigurable devices.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices.
Proceedings of the Dynamically Reconfigurable Systems - Architectures, 2010

Inspecting a Set of Strips Optimally.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Online Square Packing.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Maintaining Arrays of Contiguous Objects.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt.
Proceedings of the Taschenbuch der Algorithmen, 2008

Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput., 2008

No-break dynamic defragmentation of reconfigurable devices.
Proceedings of the FPL 2008, 2008

Escaping from a Labyrinth with One-way Roads for Limited Robots.
Proceedings of the 3rd European Conference on Mobile Robots, 2007

Randolphs Robot Game is NP-hard!
Electronic Notes in Discrete Mathematics, 2006

Competitive Online Searching for a Ray in the Plane.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Optimal Competitive Online Ray Search with an Error-Prone Robot.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

On optimizing multi-sequence functionals for competitive analysis.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Exploring Simple Grid Polygons.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

The Pledge Algorithm Reconsidered under Errors in Sensors and Motion.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Exploring an Unknown Cellular Environment.
EuroCG, 2000

On the Competitive Complexity of Navigation Tasks.
Proceedings of the Sensor Based Intelligent Robots, 2000