Markus Geyer

According to our database, Markus Geyer authored at least 14 papers between 2007 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

The planar tree packing theorem.

Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth

J. Comput. Geom., 2017

2013

Maximum Differential Coloring of Caterpillars and Spiders

Aparna Das, Markus Geyer, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni

CoRR, 2013

Planar Packing of Binary Trees.

Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

On a Tree and a Path with no Geometric Simultaneous Embedding.

Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth

J. Graph Algorithms Appl., 2012

2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.

Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis

Algorithmica, 2011

Upward Point-Set Embeddability.

Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

2010

Visualizing Differences between Two Large Graphs.

Markus Geyer, Michael Kaufmann, Robert Krug

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Upward Geometric Graph Embeddings into Point Sets.

Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Modeling.

Markus Geyer, Benjamin Hiller, Sascha Meinert

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009

Planar packing of trees and spider trees.

Fabrizio Frati, Markus Geyer, Michael Kaufmann

Inf. Process. Lett., 2009

Two trees which are self-intersecting when drawn simultaneously.

Markus Geyer, Michael Kaufmann, Imrich Vrto

Discret. Math., 2009

2008

08191 Working Group Summary - Visually Comparing a Set of Graphs.

Mario Albrecht, Alejandro Estrella-Balderrama, Markus Geyer, Carsten Gutwenger, Karsten Klein, Oliver Kohlbacher, Michael Schulz

Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

2007

Packing and Squeezing Subgraphs into Planar Graphs.

Fabrizio Frati, Markus Geyer, Michael Kaufmann

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Colored Simultaneous Geometric Embeddings.

Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007