55 citations · 188 across the 40 of their papers we have counts for
6 papers · 1 filter
Lombardi Drawings of Knots and Links
Philipp Kindermann, Stephen Kobourov, Maarten Löffler +3
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into , such that no more than two points project to the same point in . These dia…
Experimental analysis of the accessibility of drawings with few segments
Philipp Kindermann, Wouter Meulemans, André Schulz
The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.…
Placing your Coins on a Shelf
Helmut Alt, Kevin Buchin, Steven Chaplick +4
We consider the problem of packing a family of disks "on a shelf", that is, such that each disk touches the -axis from above and such that no two disks overlap. We prove that th…
On Gallai's conjecture for series-parallel graphs and planar 3-trees
Philipp Kindermann, Lena Schlipf, André Schulz
A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected -vertex graph has a path cover with at most $\lc…
Drawing Planar Graphs with Few Geometric Primitives
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans +1
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represe…
1-Fan-Bundle-Planar Drawings of Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2
Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established near-planarity models in graph drawing, we form…