default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Hoffmann 0002
Person information
- affiliation: FU Berlin, Institute of Computer Science
Other persons with the same name
- Frank Hoffmann — disambiguation page
- Frank Hoffmann 0001
![[0000-0001-8394-4047]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8394-4047")
— TU Dortmund, Institute of Control Theory and Systems Engineering, Germany (and 2 more) - Frank Hoffmann 0003 — University of Hamburg, Institute of Inorganic Chemistry, Germany
- Frank Hoffmann 0004 — Akademie der Wissenschaften der DDR, Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j7]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. 73: 24-34 (2018)- 2004
- [j6]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering with Ellipses. Algorithmica 38(1): 145-160 (2004) - 2002
- [j5]Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk:
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. J. Comput. Biol. 9(2): 299-315 (2002) - 2001
- [j4]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
The Polygon Exploration Problem. SIAM J. Comput. 31(2): 577-600 (2001) - 1999
- [j3]Frank Hoffmann, Klaus Kriegel, Carola Wenk:
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. Discret. Appl. Math. 93(1): 75-88 (1999) - 1996
- [j2]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996) - [j1]Frank Hoffmann, Klaus Kriegel:
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. SIAM J. Discret. Math. 9(2): 210-224 (1996)
Conference and Workshop Papers
- 2015
- [c12]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. SoCG 2015: 421-435 - 2012
- [c11]Robert Georges, Frank Hoffmann, Klaus Kriegel:
Online Exploration of Polygons with Holes. WAOA 2012: 56-69 - 2004
- [c10]Sven Schönherr, Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Udo Warschewske:
Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. Bildverarbeitung für die Medizin 2004: 229-233 - 2002
- [c9]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering shapes by ellipses. SODA 2002: 453-454 - 2001
- [c8]Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk:
Geometric algorithms for the analysis of 2D-electrophoresis gels. RECOMB 2001: 114-123 - 1998
- [c7]Frank Hoffmann, Klaus Kriegel, Carola Wenk:
Matching 2D Patterns of Protein Spots. SCG 1998: 231-239 - [c6]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
Moving an Angle Around a Region. SWAT 1998: 71-82 - 1997
- [c5]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
A Competitive Strategy for Learning a Polygon. SODA 1997: 166-174 - 1994
- [c4]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307 - 1993
- [c3]Frank Hoffmann, Klaus Kriegel:
A Graph Coloring Result and Its Consequences for Some Guarding Problems. ISAAC 1993: 78-87 - 1991
- [c2]Frank Hoffmann, Michael Kaufmann, Klaus Kriegel:
The Art Gallery Theorem for Polygons With Holes. FOCS 1991: 39-48 - 1990
- [c1]Frank Hoffmann, Michael Kaufmann:
On the Rectilinear Art Gallery Problem - Algorithmic Aspects. WG 1990: 239-250
Informal and Other Publications
- 2014
- [i3]Frank Hoffmann, Klaus Kriegel, Max Willert:
Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries. CoRR abs/1412.3984 (2014) - 2012
- [i2]Robert Georges, Frank Hoffmann, Klaus Kriegel:
Online Exploration of Polygons with Holes. CoRR abs/1207.0240 (2012) - 2000
- [i1]Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz:
Covering Simple Polygonal Regions by Ellipses. EuroCG 2000: 89-92
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 2024-07-11 20:17 CEST 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:
