
Generalized LRdrawings of trees
The LRdrawingmethod is a method of drawing an ordered rooted binary tr...
read it

Efficiently Partitioning the Edges of a 1Planar Graph into a Planar Graph and a Forest
1planar graphs are graphs that can be drawn in the plane such that any ...
read it

All Subgraphs of a Wheel are 5CoupledChoosable
A wheel graph consists of a cycle along with a center vertex connected t...
read it

Drawing outer1planar graphs revisited
In a recent article (Auer et al, Algorithmica 2016) it was claimed that ...
read it

Reconstructing a Polyhedron between Polygons in Parallel Slices
Given two nvertex polygons, P=(p_1, …, p_n) lying in the xyplane at z=...
read it

Drawing Halingraphs with small height
In this paper, we study how to draw Halingraphs, i.e., planar graphs th...
read it

Building a larger class of graphs for efficient reconfiguration of vertex colouring
A kcolouring of a graph G is an assignment of at most k colours to the ...
read it

Finding large matchings in 1planar graphs of minimum degree 3
A matching is a set of edges without common endpoint. It was recently sh...
read it

On Layered FanPlanar Graph Drawings
In this paper, we study fanplanar drawings that use h layers and are pr...
read it

Matchings in 1planar graphs with large minimum degree
In 1979, Nishizeki and Baybars showed that every planar graph with minim...
read it

Are highly connected 1planar graphs Hamiltonian?
It is wellknown that every planar 4connected graph has a Hamiltonian c...
read it

Quasiperiodic bobbin lace patterns
Bobbin lace is a fibre art form in which threads are braided together to...
read it

A note on 1planar graphs with minimum degree 7
It is wellknown that 1planar graphs have minimum degree at most 7, and...
read it

Line and Plane Cover Numbers Revisited
A measure for the visual complexity of a straightline crossingfree dra...
read it

Homotopy height, gridmajor height and graphdrawing height
It is wellknown that both the pathwidth and the outerplanarity of a gr...
read it

Packing BoundaryAnchored Rectangles and Squares
Consider a set P of n points on the boundary of an axisaligned square Q...
read it

Minimum Ply Covering of Points with Disks and Squares
Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we ...
read it

Finding big matchings in planar graphs quickly
It is wellknown that every nvertex planar graph with minimum degree 3 ...
read it

Maximum Matchings and Minimum Blocking Sets in Θ_6Graphs
Θ_6Graphs are important geometric graphs that have many applications es...
read it

Finding Tutte paths in linear time
It is wellknown that every 2connected planar graph has a Tutte path, i...
read it

Segment representations with small resolution
A segment representation of a graph is an assignment of line segments in...
read it

Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)
These are the revised accepted papers from the 26th International Sympos...
read it

Rollercoasters and Caterpillars
A rollercoaster is a sequence of real numbers for which every maximal co...
read it

4connected planar graphs are in B_3EPG
We show that every 4connected planar graph has a B_3EPG representation...
read it

Improved Bounds for Drawing Trees on Fixed Points with Lshaped Edges
Let T be an nnode tree of maximum degree 4, and let P be a set of n poi...
read it

Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of periodic graphs
In this paper, we study a class of graph drawings that arise from bobbin...
read it

EPGrepresentations with small gridsize
In an EPGrepresentation of a graph G each vertex is represented by a pa...
read it

A Note on PlusContacts, Rectangular Duals, and BoxOrthogonal Drawings
A pluscontact representation of a planar graph G is called cbalanced i...
read it

On Upward Drawings of Trees on a Given Grid
Computing a minimumarea planar straightline drawing of a graph is know...
read it

GridObstacle Representations with Connections to Staircase Guarding
In this paper, we study gridobstacle representations of graphs where we...
read it

On Guarding Orthogonal Polygons with Bounded Treewidth
There exist many variants of guarding an orthogonal polygon in an orthog...
read it
Therese Biedl
is this you? claim profile