default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabian Schwarzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[c9]Matthew Smith, Fabian Schwarzer, Marian Harbach
, Thomas Noll, Bernd Freisleben:
A Streaming Intrusion Detection System for Grid Computing Environments. HPCC 2009: 44-51- 2005
- [j6]Fabian Schwarzer, Mitul Saha, Jean-Claude Latombe:
Adaptive dynamic collision checking for single and multiple articulated robots in complex environments. IEEE Trans. Robotics 21(3): 338-353 (2005) - 2004
- [j5]Itay Lotan, Fabian Schwarzer:
Approximation of Protein Structure for Fast Similarity Measures. J. Comput. Biol. 11(2/3): 299-317 (2004) - [j4]Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe:
Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins. J. Comput. Biol. 11(5): 902-932 (2004) - 2003
- [c8]Fabian Schwarzer, Itay Lotan:
Approximation of protein structure for fast similarity measures. RECOMB 2003: 267-276 - [c7]Itay Lotan, Fabian Schwarzer, Jean-Claude Latombe:
Efficient Energy Computation for Monte Carlo Simulation of Proteins. WABI 2003: 354-373 - 2002
- [j3]Fabian Schwarzer, Achim Schweikard:
On the complexity of one-shot translational separability. Inf. Process. Lett. 83(4): 187-194 (2002) - [c6]Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe:
Efficient maintenance and self-collision testing for Kinematic Chains. SCG 2002: 43-52 - [c5]Fabian Schwarzer, Mitul Saha, Jean-Claude Latombe:
Exact Collision Checking of Robot Paths. WAFR 2002: 25-42 - 2001
- [c4]Fabian Schwarzer, Achim Schweikard:
C-space Cell Defragmentation for General Translational Assembly Planning. ICRA 2001: 1537-1542 - 2000
- [b1]Fabian Schwarzer:
Geometric reasoning about translational motions. Technical University Munich, Germany, 2000, pp. 1-126 - [j2]Fabian Schwarzer, Achim Schweikard, Leo Joskowicz:
Efficient Linear Unboundedness Testing: Algorithm and Applications to Translational Assembly Planning. Int. J. Robotics Res. 19(9): 817-834 (2000)
1990 – 1999
- 1998
- [j1]Achim Schweikard, Fabian Schwarzer:
Detecting Geometric Infeasibility. Artif. Intell. 105(1-2): 139-159 (1998) - [c3]Fabian Schwarzer, Florian Bieberbach, Achim Schweikard, Leo Joskowicz:
Efficiently testing for unboundedness and m-handed assembly. IROS 1998: 1164-1169 - [c2]Michael Klupsch, Maximilian Lückenhaus, Christoph Zierl, Ivan Laptev, Thorsten Bandlow, Marc Grimme, Ignaz Kellerer, Fabian Schwarzer:
Agilo RoboCuppers: RoboCup Team Description. RoboCup 1998: 446-451 - 1997
- [c1]Achim Schweikard, Fabian Schwarzer:
General translational assembly planning. ICRA 1997: 612-619
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2025-01-09 13:15 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:
