1998
[bibtex]Computational Geometry
Point-sets with few k-sets
In Proc. ACM Symposium on Computational Geometry, Pages 200-205, 1998.
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
[bibtex] [ps.gz]On the diameter of sets with maximum number of unit distances
Geombinatorics, Volume 8, Pages 149-153, 1998.
Peter Braß
appeared also as preprint Freie Universität Berlin, Fachbereich Mathematik und Informatik Serie B 98-02
[bibtex]Extremal orthoposets without forbidden substructures
Int. J. Theoretical Physics, Volume 38, Pages 3-9, 1998.
Peter Braß
[bibtex]Triangles in Euclidean Arrangements
In Proceedings WG'98, Springer Lecture Notes in Computer Science 1517, Lecture Notes in Comput. Sci., Volume 1517, Pages 137-148, Smolenice, 1998.
Stefan Felsner, Klaus Kriegel
[bibtex] [ps.gz]Moving an angle around a region
In Proceedings SWAT'98, Springer Lecture Notes in Computer Science 1432, Pages 71-82, Stockholm, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]The Polygon Exploration Problem II : The Angle Hull
Technical Report 245, Fernuniversität Hagen, Praktische Informatik VI, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex] [pdf]
Geometric Shape and Pattern Matching
Matching convex shapes with respect to the symmetric difference
Algorithmica, Volume 21, Pages 89-103, 1998.
Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
[bibtex] [pdf] [ps.gz]Matching 2D patterns of protein spots
In Proceedings SoCG'98, Pages 231-239, Minneapolis, 1998.
Frank Hoffmann, Klaus Kriegel, Carola Wenk
[bibtex]
Graph Theory and Algorithms
The Maximum Number of Edges in a Graph of Bounded Dimension, with Applications to Ring Theory
Technical Report B 98-10, Freie Universität Berlin, 1998.
Geir Agnarsson, Stefan Felsner, William T. Trotter
[bibtex] [ps.gz]Universal 3-Dimensional Visibility Representations for Graphs
Computational Geometry: Theory and Applications, Volume 9, Pages 111-125, 1998.
Helmut Alt, Michael Godau, Sue Whitesides
[bibtex]
Online Algorithms
The Polygon Exploration Problem I : A Competitive Strategy
Technical Report 241, Fernuniversität Hagen, Praktische Informatik VI, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex] [pdf]The Polygon Exploration Problem: A New Strategy and a New Analysis Technique
In Proceedings WAFR'98, Pages 211-222, A K Peters, Natick, Massachusetts, Houston, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]