#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Philipp Kindermann, Fabian Lipp, Alexander Wolff
- Graph Drawing
- 2014

- Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
- Graph Drawing
- 2016

We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections to other challenging graph-drawing problems such as small-area or small-volume drawings, layered or track drawings, and… (More)

- Fabian Lipp, Alexander Wolff, Johannes Zink
- Algorithms
- 2015

The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently. Most of these algorithms are, however, quite slow on large graphs, as they compute a quadratic number of forces in each iteration. We give a new algorithm that takes only O(m + n log n) time… (More)

- Steven Chaplick, Fabian Lipp, Ji-Won Park, Alexander Wolff
- Graph Drawing
- 2016

Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topologically open) polygon C and a finite set P of points in general position in the complement of C, the visibility graph G C (P) has a vertex for each point in P and an edge pq for… (More)

- Patrizio Angelini, Steven Chaplick, +7 authors Ignaz Rutter
- Graph Drawing
- 2016

We introduce and study the OrthoSEFE-k problem: Given k planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces… (More)

- Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek
- Electronic Colloquium on Computational Complexity
- 2011

Instances of optimization problems with multiple objectives can have several optimal solutions whose cost vectors are incomparable. This ambiguity leads to several reasonable notions for solving multiobjective problems. Each such notion defines a class of multivalued functions. We systematically investigate the computational complexity of these classes.… (More)

It is well known that any graph admits a crossing-free straight-line drawing in R 3 and that any planar graph admits the same even in R 2. For d ∈ {2, 3}, let ρ 1 d (G) denote the minimum number of lines in R d that together can accommodate all edges of a drawing of G, where ρ 1 2 (G) is defined for planar graphs. We investigate the complexity of computing… (More)

- Thomas C. van Dijk, Martin Fink, +5 authors Alexander Wolff
- Graph Drawing
- 2016

Storyline visualizations help visualize encounters of the characters in a story over time. Each character is represented by an x-monotone curve that goes from left to right. A meeting is represented by having the characters that participate in the meeting run close together for some time. In order to keep the visual complexity low, rather than just… (More)

- ‹
- 1
- ›