NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (39)

cs.DS2018

Queue Layouts of Planar 3-Trees

Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2

cs.CG2013

Many-to-One Boundary Labeling with Backbones

Michael A. Bekos, Sabine Cornelsen, Martin Fink +5

cs.DS2017

An Interactive Tool to Explore and Improve the Ply Number of Drawings

Niklas Heinsohn, Michael Kaufmann

cs.CG2011

Optimal Polygonal Representation of Planar Graphs

Christian A. Duncan, Emden R. Gansner, Yifan Hu +2

cs.DM2018

On Dispersable Book Embeddings

Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2

cs.CG2013

Smooth Orthogonal Drawings of Planar Graphs

Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann +3

cs.DM2017

Beyond-Planarity: Density Results for Bipartite Graphs

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2

cs.DS2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Evmorfia Argyriou, Sabine Cornelsen, Henry Förster +5

cs.DS2011

Geometric Simultaneous RAC Drawings of Graphs

Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann +1

cs.CG2017

3D Visibility Representations of 1-planar Graphs

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1

cs.CG2017

On Optimal 2- and 3-Planar Graphs

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

cs.CG2015

Contact Representations of Sparse Planar Graphs

Md. Jawaherul Alam, David Eppstein, Michael Kaufmann +4

cs.CG2015

On Contact Graphs with Cubes and Proportional Boxes

Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov

cs.DM2014

The Maximum k-Differential Coloring Problem

Michael Bekos, Stephen Kobourov, Michael Kaufmann +1

cs.DS2011

Upward Point Set Embeddability for Convex Point Sets is in $P$

Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis

cs.DM2013

Threshold-Coloring and Unit-Cube Contact Representation of Graphs

Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž +3

cs.CG2015

On Embeddability of Buses in Point Sets

Till Bruckdorfer, Michael Kaufmann, Stephen Kobourov +1

cs.DS2017

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

Michael A. Bekos, Henry Förster, Michael Kaufmann

cs.DS2016

Vertex-Coloring with Star-Defects

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1

cs.DS2014

Planar Octilinear Drawings with One Bend Per Edge

Michael A. Bekos, Martin Gronemann, Michael Kaufmann +1

cs.DS2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs

William Evans, Michael Kaufmann, William Lenhart +3

cs.DS2018

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution

Michael A. Bekos, Henry Förster, Christian Geckeler +4

cs.DS2017

On Vertex- and Empty-Ply Proximity Drawings

Patrizio Angelini, Steven Chaplick, Felice De Luca +7

cs.DS2005

A New Approach for Boundary Recognition in Geometric Sensor Networks

Sandor P. Fekete, Michael Kaufmann, Alexander Kroeller +1

cs.CG2016

The Planar Tree Packing Theorem

Markus Geyer, Michael Hoffmann, Michael Kaufmann +2

cs.DS2010

Upward Point-Set Embeddability

Markus Geyer, Michael Kaufmann, Tamara Mchedlidze +1

cs.CG2010

On a Tree and a Path with no Geometric Simultaneous Embedding

Patrizio Angelini, Markus Geyer, Michael Kaufmann +1

cs.DS2016

Low Ply Drawings of Trees

Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer +5

cs.CG2015

A Universal Point Set for 2-Outerplanar Graphs

Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann +1

cs.LG2018

Elastic CoCoA: Scaling In to Improve Convergence

Michael Kaufmann, Thomas Parnell, Kornilios Kourtis

cs.DS2018

On RAC Drawings of Graphs with one Bend per Edge

Patrizio Angelini, Michael A. Bekos, Henry Förster +1

cs.CG2012

Approximating Minimum Manhattan Networks in Higher Dimensions

Aparna Das, Emden R. Gansner, Michael Kaufmann +3

cs.CG2015

On the Total Number of Bends for Planar Octilinear Drawings

Michael A. Bekos, Michael Kaufmann, Robert Krug

cs.DS2015

The Book Thickness of 1-Planar Graphs is Constant

Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann +1

cs.CG2012

Progress on Partial Edge Drawings

Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger +4

cs.CG2016

On the Density of non-Simple 3-Planar Graphs

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

cs.CG2018

1-Fan-Bundle-Planar Drawings of Graphs

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2

cs.DM2011

Computing Cartograms with Optimal Complexity

Md. Jawaherul Alam, Therese Biedl, Stefan Felsner +3

cs.CG2014

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

Michael A. Bekos, Sabine Cornelsen, Luca Grilli +2