Frank Hoffmann

Affiliations:
  • FU Berlin, Institute of Computer Science


According to our database1, Frank Hoffmann authored at least 18 papers between 1990 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries.
Comput. Geom., 2018

2014
Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries.
CoRR, 2014

2012
Online Exploration of Polygons with Holes.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2004
Covering with Ellipses.
Algorithmica, 2004

Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation.
Proceedings of the Bildverarbeitung für die Medizin 2004, Algorithmen - Systeme, 2004

2002
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels.
J. Comput. Biol., 2002

Covering shapes by ellipses.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
The Polygon Exploration Problem.
SIAM J. Comput., 2001

2000
Covering Simple Polygonal Regions by Ellipses.
EuroCG, 2000

1999
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots.
Discret. Appl. Math., 1999

1998
Moving an Angle Around a Region.
Proceedings of the Algorithm Theory, 1998

Matching 2D Patterns of Protein Spots.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
A Competitive Strategy for Learning a Polygon.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems.
SIAM J. Discret. Math., 1996

Generalized Guarding and Partitioning for Rectilinear Polygons.
Comput. Geom., 1996

1993
A Graph Coloring Result and Its Consequences for Some Guarding Problems.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991
The Art Gallery Theorem for Polygons With Holes
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
On the Rectilinear Art Gallery Problem - Algorithmic Aspects.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990


  Loading...