default search action
Markus Geyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j5]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The planar tree packing theorem. J. Comput. Geom. 8(2): 109-177 (2017) - 2016
- [c10]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. SoCG 2016: 41:1-41:15 - [i5]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. CoRR abs/1603.07737 (2016) - 2013
- [c9]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
Planar Packing of Binary Trees. WADS 2013: 353-364 - [i4]Aparna Das, Markus Geyer, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni:
Maximum Differential Coloring of Caterpillars and Spiders. CoRR abs/1302.7085 (2013) - 2012
- [j4]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. J. Graph Algorithms Appl. 16(1): 37-83 (2012) - 2011
- [j3]Ulrik Brandes, Cesim Erten
, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [c8]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze
Upward Point-Set Embeddability. SOFSEM 2011: 272-283 - 2010
- [c7]Markus Geyer, Benjamin Hiller, Sascha Meinert:
Modeling. Algorithm Engineering 2010: 16-57 - [c6]Patrizio Angelini
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - [c5]Patrizio Angelini
On a Tree and a Path with No Geometric Simultaneous Embedding. GD 2010: 38-49 - [c4]Markus Geyer, Michael Kaufmann, Robert Krug:
Visualizing Differences between Two Large Graphs. GD 2010: 393-394 - [i3]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. CoRR abs/1001.0555 (2010) - [i2]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point-Set Embeddability. CoRR abs/1010.5937 (2010)
2000 – 2009
- 2009
- [j2]Markus Geyer, Michael Kaufmann, Imrich Vrto:
Two trees which are self-intersecting when drawn simultaneously. Discret. Math. 309(7): 1909-1916 (2009) - [j1]Fabrizio Frati
Planar packing of trees and spider trees. Inf. Process. Lett. 109(6): 301-307 (2009) - 2008
- [i1]Mario Albrecht, Alejandro Estrella-Balderrama, Markus Geyer, Carsten Gutwenger, Karsten Klein, Oliver Kohlbacher, Michael Schulz:
08191 Working Group Summary - Visually Comparing a Set of Graphs. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [c3]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c2]Fabrizio Frati
Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405 - 2005
- [c1]Markus Geyer, Michael Kaufmann, Imrich Vrto:
Two Trees Which Are Self-intersecting When Drawn Simultaneously. GD 2005: 201-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: