#### Filter Results:

- Full text PDF available (79)

#### Publication Year

1995

2018

- This year (7)
- Last 5 years (46)
- Last 10 years (81)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Martin NÃ¶llenburg, Alexander Wolff
- IEEE Transactions on Visualization and Computerâ€¦
- 2011

Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automaticallyâ€¦ (More)

- Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
- Comput. Geom.
- 2007

- Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
- Comput. Geom.
- 1999

This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding labels allow moreâ€¦ (More)

- Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk
- Algorithmica
- 2001

The general label-placement problem consists in labeling a set of features (points, lines, regions) given a set of candidates (rectangles, circles, ellipses, irregularly shaped labels) for eachâ€¦ (More)

- Andreas Spillner, Alexander Wolff
- SOFSEM
- 2008

- Alexander Wolff
- Informatik - Forschung und Entwicklung
- 2007

This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such as flow charts orâ€¦ (More)

- Martin NÃ¶llenburg, Danny Holten, Markus VÃ¶lker, Alexander Wolff
- ALENEX
- 2009

A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierarchical clustering,â€¦ (More)

- Tycho Strijk, Alexander Wolff
- Int. J. Comput. Geometry Appl.
- 2001

We present a new algorithm for labeling points with circles of equal size. Our algorithm tries to maximize the label size. It improves the approximation factor of the only known algorithm for thisâ€¦ (More)

- Marc Benkert, Martin NÃ¶llenburg, Takeaki Uno, Alexander Wolff
- Graph Drawing
- 2006

In this paper we consider a new problem that occurs when drawing wiring diagrams or public transportation networks. Given an embedded graph G = (V, E) (e.g., the streets served by a bus network) andâ€¦ (More)

- Marc Benkert, Alexander Wolff, Florian Widmann
- JCDCG
- 2004

For many applications it is desirable to connect the nodes of a transportation or communication network by short paths within the network. In the Euclidean plane this can be achieved by connectingâ€¦ (More)