6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.CG2016★ 1 cited
The Planar Tree Packing Theorem
Markus Geyer, Michael Hoffmann, Michael Kaufmann +2
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing…
cs.DM2013
On Maximum Differential Coloring of Planar Graphs
M. Bekos, A. Das, M. Geyer +3
We study the \emph{maximum differential coloring problem}, where the vertices of an -vertex graph must be labeled with distinct numbers ranging from to , so that the mini…
cs.DS2010★ 6 cited
Upward Point-Set Embeddability
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze +1
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph has an upward planar embedding into a point set $S…