default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Eiglsperger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[r1]Ulrik Brandes, Markus Eiglsperger, Jürgen Lerner, Christian Pich:
Graph Markup Language (GraphML). Handbook of Graph Drawing and Visualization 2013: 517-541
2000 – 2009
- 2005
- [j3]Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann:
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. J. Graph Algorithms Appl. 9(3): 305-325 (2005) - 2004
- [j2]Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel
, Martin Siebenhaller:
Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3): 189-208 (2004) - [c10]Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann:
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. GD 2004: 155-166 - [p1]Roland Wiese, Markus Eiglsperger, Michael Kaufmann:
yFiles - Visualization and Automatic Layout of Graphs. Graph Drawing Software 2004: 173-191 - 2003
- [b1]Markus Eiglsperger:
Automatic layout of UML class diagrams: a topology-shape-metrics approach. University of Tübingen, Germany, 2003, pp. 1-172 - [j1]Markus Eiglsperger, Michael Kaufmann, Frank Eppinger:
An Approach for Mixed Upward Planarization. J. Graph Algorithms Appl. 7(2): 203-220 (2003) - [c9]Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller:
A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram. SOFTVIS 2003: 189-198 - 2002
- [c8]Marite Sirava, T. Schäfer, Markus Eiglsperger, Michael Kaufmann, Oliver Kohlbacher, Erich Bornberg-Bauer, Hans-Peter Lenhof:
BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks. ECCB 2002: 219-230 - [c7]Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner:
Sketch-Driven Orthogonal Graph Drawing. GD 2002: 1-11 - 2001
- [c6]Markus Eiglsperger, Michael Kaufmann:
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. GD 2001: 124-138 - [c5]Roland Wiese, Markus Eiglsperger, Michael Kaufmann:
yFiles: Visualization and Automatic Layout of Graphs. GD 2001: 453-454 - [c4]Ulrik Brandes, Markus Eiglsperger, Ivan Herman, Michael Himsolt, M. Scott Marshall:
GraphML Progress Report. GD 2001: 501-512 - [c3]Markus Eiglsperger, Michael Kaufmann:
An Approach for Mixed Upward Planarization. WADS 2001: 352-364 - 2000
- [c2]Markus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann:
Orthogonal graph drawing with constraints. SODA 2000: 3-11
1990 – 1999
- 1999
- [c1]Markus Eiglsperger, Sándor P. Fekete, Gunnar W. Klau:
Orthogonal Graph Drawing. Drawing Graphs 1999: 121-171
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 2024-04-25 05:57 CEST 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:
