Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Gansner, Emden R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
COAST: A convex optimization approach to stress-based embedding
Emden R. Gansner
,
Yifan Hu
,
Shankar Krishnan
Lecture Notes in Computer Science
8242
, 2013, pp. 268-279
Visualizing streaming text data with dynamic graphs and maps
Emden R. Gansner
,
Yifan Hu
,
Stephen North
Lecture Notes in Computer Science
7704
, 2013, pp. 439-450
Approximate proximity drawings
William Evans
,
Emden R. Gansner
,
Michael Kaufmann
,
Giuseppe Liotta
,
Henk Meijer
,
Andreas Spillner
Lecture Notes in Computer Science
7034
, 2012, pp. 166-178
Approximating minimum Manhattan networks in higher dimensions
Aparna Das
,
Emden R. Gansner
,
Michael Kaufmann
,
Stephen Kobourov
,
Joachim Spoerhase
,
Alexander Wolff
Lecture Notes in Computer Science
6942
, 2011, pp. 49-60
On touching triangle graphs
Emden R. Gansner
,
Yifan Hu
,
Stephen G. Kobourov
Lecture Notes in Computer Science
6502
, 2011, pp. 250-261
Visualization of complex BPEL models
Benjamin Albrecht
,
Philip Effinger
,
Markus Held
,
Michael Kaufmann
,
Stephan Kottler
Lecture Notes in Computer Science
5849
, 2010, pp. 421-423
On open problems in biological network visualization
Mario Albrecht
,
Andreas Kerren
,
Karsten Klein
,
Oliver Kohlbacher
,
Petra Mutzel
,
Wolfgang Paul
,
Falk Schreiber
,
Michael Wybrow
Lecture Notes in Computer Science
5849
, 2010, pp. 256-267
On the perspectives opened by right angle crossing drawings
Patrizio Angelini
,
Luca Cittadini
,
Giuseppe Di Battista
,
Walter Didimo
,
Fabrizio Frati
,
Michael Kaufmann
,
Antonios Symvonis
Lecture Notes in Computer Science
5849
, 2010, pp. 21-32
Succinct greedy drawings do not always exist
Patrizio Angelini
,
Giuseppe Di Battista
,
Fabrizio Frati
Lecture Notes in Computer Science
5849
, 2010, pp. 171-182
Splitting clusters to get C-planarity
Patrizio Angelini
,
Fabrizio Frati
,
Maurizio Patrignani
Lecture Notes in Computer Science
5849
, 2010, pp. 57-68
Leftist canonical ordering
Melanie Badent
,
Michael Baur
,
Ulrik Brandes
,
Sabine Cornelsen
Lecture Notes in Computer Science
5849
, 2010, pp. 159-170
4-labelings and grid embeddings of plane quadrangulations
Lali Barri`ere
,
Clemens Huemer
Lecture Notes in Computer Science
5849
, 2010, pp. 413-414
Drawing planar 3-trees with given face-areas
Therese Biedl
,
Lesvia Elena Ruiz Velázquez
Lecture Notes in Computer Science
5849
, 2010, pp. 316-322
Small drawings of series-parallel graphs and other subclasses of planar graphs
Therese Biedl
Lecture Notes in Computer Science
5849
, 2010, pp. 280-291
Drawing trees in a streaming model
Carla Binucci
,
Ulrik Brandes
,
Giuseppe Di Battista
,
Walter Didimo
,
Marco Gaertler
,
Pietro Palladino
,
Maurizio Patrignani
,
Antonios Symvonis
,
Katharina Zweig
Lecture Notes in Computer Science
5849
, 2010, pp. 292-303
More flexible radial layout
Ulrik Brandes
,
Christian Pich
Lecture Notes in Computer Science
5849
, 2010, pp. 107-118
Using high dimensions to compare drawings of graphs
Stina Bridgeman
Lecture Notes in Computer Science
5849
, 2010, pp. 408-410
On planar supports for hypergraphs
Kevin Buchin
,
Marc van Kreveld
,
Henk Meijer
,
Bettina Speckmann
,
Kevin Verbeek
Lecture Notes in Computer Science
5849
, 2010, pp. 345-356
Geometric simultaneous embeddings of a graph and a matching
Sergio Cabello
,
Marc van Kreveld
,
Giuseppe Liotta
,
Henk Meijer
,
Bettina Speckmann
,
Kevin Verbeek
Lecture Notes in Computer Science
5849
, 2010, pp. 183-194
Upward planarization layout
Markus Chimani
,
Carsten Gutwenger
,
Petra Mutzel
,
Hoi-Ming Wong
Lecture Notes in Computer Science
5849
, 2010, pp. 94-106
Area, curve complexity, and crossing resolution of non-planar graph drawings
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Lecture Notes in Computer Science
5849
, 2010, pp. 15-20
Drawing Hamiltonian cycles with no large angles
Adrian Dumitrescu
,
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
5849
, 2010, pp. 3-14
Planar drawings of higher-genus graphs
Christian A. Duncan
,
Michael T. Goodrich
,
Stephen G. Kobourov
Lecture Notes in Computer Science
5849
, 2010, pp. 45-56
Graph Drawing Contest Report
Christian A. Duncan
,
Carsten Gutwenger
,
Lev Nachmanson
,
Georg Sander
Lecture Notes in Computer Science
5849
, 2010, pp. 428-433
Fast edge-routing for large graphs
Tim Dwyer
,
Lev Nachmanson
Lecture Notes in Computer Science
5849
, 2010, pp. 147-158
Seiten 1
2
3
>