Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Kamphans
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j9]Verena Heinrich, Tom Kamphans, Stefan Mundlos, Peter N. Robinson, Peter M. Krawitz
:
A likelihood ratio-based method to predict exact pedigrees for complex families from next-generation sequencing data. Bioinform. 33(1): 72-78 (2017)- 2015
- [j8]Na Zhu, Verena Heinrich, Thorsten Dickhaus, Jochen Hecht, Peter N. Robinson, Stefan Mundlos, Tom Kamphans, Peter M. Krawitz:
Strategies to improve the performance of rare variant association studies by optimizing the selection of controls. Bioinform. 31(22): 3577-3583 (2015) - 2014
- [j7]Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Online Square Packing with Gravity. Algorithmica 68(4): 1019-1044 (2014) - 2012
- [j6]Tom Kamphans, Peter M. Krawitz:
GeneTalk: an expert exchange platform for assessing rare sequence variants in personal genomes. Bioinform. 28(19): 2515-2516 (2012) - [j5]Sándor P. Fekete, Tom Kamphans, Nils Schweer, Christopher Tessars, Jan van der Veen, Josef Angermeier, Dirk Koch, Jürgen Teich:
Dynamic Defragmentation of Reconfigurable Devices. ACM Trans. Reconfigurable Technol. Syst. 5(2): 8:1-8:20 (2012) - 2011
- [b1]Tom Kamphans:
Models and algorithms for online exploration and search. University of Bonn, Germany, Shaker 2011, ISBN 978-3-8322-9724-4, pp. 1-151 - [c13]Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt:
Exploring and Triangulating a Region by a Swarm of Robots. APPROX-RANDOM 2011: 206-217 - [p3]Rolf Klein, Tom Kamphans:
Pledge's Algorithm - How to Escape from a Dark Maze. Algorithms Unplugged 2011: 69-75 - [i13]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Maintaining Arrays of Contiguous Objects. CoRR abs/1101.5407 (2011) - 2010
- [j4]Tom Kamphans, Elmar Langetepe:
Leaving an Unknown Maze Using an Error-Prone Compass. Int. J. Comput. Geom. Appl. 20(3): 307-325 (2010) - [j3]Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
The Tourist in the Shopping Arcade. J. Univers. Comput. Sci. 16(5): 676-685 (2010) - [c12]Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Nils Schweer, Jürgen Teich:
Virtual area management: Multitasking on dynamically partially reconfigurable devices. IPDPS Workshops 2010: 1-4 - [c11]Tobias Baumgartner, Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Max Pagel:
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks. REALWSN 2010: 94-105 - [p2]Ali Ahmadinia, Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Dirk Koch, Mateusz Majer, Nils Schweer, Jürgen Teich, Christopher Tessars, Jan van der Veen:
ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices. Dynamically Reconfigurable Systems 2010: 199-221 - [i12]Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Nils Schweer, Jürgen Teich:
Maintaining Virtual Areas on FPGAs using Strip Packing with Delays. CoRR abs/1001.4493 (2010) - [i11]Tobias Baumgartner, Sándor P. Fekete, Tom Kamphans, Alexander Kroeller, Max Pagel:
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks. CoRR abs/1009.4870 (2010) - [i10]Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Online Square Packing. CoRR abs/1010.4502 (2010) - [i9]Sándor P. Fekete, Tom Kamphans, Michael Stelzer:
Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks. CoRR abs/1012.5024 (2010) - [i8]Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Grid Polygons Online. CoRR abs/1012.5240 (2010) - [i7]Daniel Herrmann, Tom Kamphans, Elmar Langetepe:
Exploring Simple Triangular and Hexagonal Grid Polygons Online. CoRR abs/1012.5253 (2010) - [i6]Tom Kamphans, Elmar Langetepe:
Optimal competitive online ray search with an error-prone robot. CoRR abs/1012.5259 (2010) - [i5]Sándor P. Fekete, Tom Kamphans, Nils Schweer, Christopher Tessars, Jan van der Veen, Josef Angermeier, Dirk Koch, Jürgen Teich:
No-Break Dynamic Defragmentation of Reconfigurable. CoRR abs/1012.5330 (2010)
2000 – 2009
- 2009
- [c10]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Maintaining Arrays of Contiguous Objects. FCT 2009: 14-25 - [c9]Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Online Square Packing. WADS 2009: 302-314 - [c8]Tom Kamphans, Elmar Langetepe:
Inspecting a Set of Strips Optimally. WADS 2009: 423-434 - 2008
- [j2]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) - [c7]Sándor P. Fekete, Tom Kamphans, Nils Schweer, Christopher Tessars, Jan van der Veen, Josef Angermeier, Dirk Koch, Jürgen Teich:
No-break dynamic defragmentation of reconfigurable devices. FPL 2008: 113-118 - [p1]Rolf Klein, Tom Kamphans:
Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt. Taschenbuch der Algorithmen 2008: 75-81 - 2007
- [c6]Bernd Brüggemann, Tom Kamphans, Elmar Langetepe:
Escaping from a Labyrinth with One-way Roads for Limited Robots. EMCR 2007 - 2006
- [j1]Birgit Engels, Tom Kamphans:
Randolphs Robot Game is NP-hard! Electron. Notes Discret. Math. 25: 49-53 (2006) - [i4]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
- [c5]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Simple Grid Polygons. COCOON 2005: 524-533 - [c4]Thomas Kamphans, Elmar Langetepe:
Optimal Competitive Online Ray Search with an Error-Prone Robot. WEA 2005: 593-596 - [i3]Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive online searching for a ray in the plane. EuroCG 2005: 107-110 - [i2]Tom Kamphans, Elmar Langetepe:
On optimizing multi-sequence functionals for competitive analysis. EuroCG 2005: 111-114 - 2004
- [c3]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346 - 2003
- [c2]Thomas Kamphans, Elmar Langetepe:
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion. WAOA 2003: 165-178 - 2000
- [c1]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
On the Competitive Complexity of Navigation Tasks. Sensor Based Intelligent Robots 2000: 245-258 - [i1]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring an Unknown Cellular Environment. EuroCG 2000: 140-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-03-26 01:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
