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
Hilfe
Suche: Series=LNCS AND Volume=7034
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Confluent Hasse diagrams
David Eppstein
,
Joseph A. Simons
Lecture Notes in Computer Science
7034
, 2012, pp. 2-13
Planar open rectangle-of-influence drawings with non-aligned frames
Soroush Alamdari
,
Therese Biedl
Lecture Notes in Computer Science
7034
, 2012, pp. 14-25
Proportional contact representations of planar graphs
Muhammad Jawaherul Alam
,
Therese Biedl
,
Stefan Felsner
,
Michael Kaufmann
,
Stephen G. Kobourov
Lecture Notes in Computer Science
7034
, 2012, pp. 26-38
Embedding plane 3-trees in
\mathbb R^2
and
\mathbb R^3
Stephane Durocher
,
Debajyoti Mondal
,
Rahnuma Islam Nishat
,
Md. Saidur Rahman
,
Sue Whitesides
Lecture Notes in Computer Science
7034
, 2012, pp. 39-51
Orthogeodesic point-set embedding of trees
Emilio Di Giacomo
,
Fabrizio Frati
,
Radoslav Fulek
,
Luca Grilli
,
Marcus Krug
Lecture Notes in Computer Science
7034
, 2012, pp. 52-63
On point-sets that support planar graphs
Vida Dujmovic
,
William Evans
,
Sylvain Lazard
,
William Lenhart
,
Giuseppe Liotta
,
David Rappaport
,
Stephen Wismath
Lecture Notes in Computer Science
7034
, 2012, pp. 64-74
Small point sets for simply-nested planar graphs
Patrizio Angelini
,
Giuseppe Di Battista
,
Michael Kaufmann
,
Tamara Mchedlidze
,
Vincenzo Roselli
,
Claudio Squarcella
Lecture Notes in Computer Science
7034
, 2012, pp. 75-85
Graph visualization
Jarke J. van Wijk
Lecture Notes in Computer Science
7034
, 2012, pp. 86-86
Advances in the planarization method: Effective multiple edge insertions
Markus Chimani
,
Carsten Gutwenger
Lecture Notes in Computer Science
7034
, 2012, pp. 87-98
A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
Ulrik Brandes
,
Martin Mader
Lecture Notes in Computer Science
7034
, 2012, pp. 99-110
Accelerated bend minimization
Sabine Cornelsen
,
Andreas Karrenbauer
Lecture Notes in Computer Science
7034
, 2012, pp. 111-122
TGI-EB: A new framework for edge bundling integrating topology, geometry and importance
Quan Nguyen
,
Seok-Hee Hong
,
Peter Eades
Lecture Notes in Computer Science
7034
, 2012, pp. 123-135
Edge routing with ordered bundles
Sergey Pupyrev
,
Lev Nachmanson
,
Sergey Bereg
,
Alexander E. Holroyd
Lecture Notes in Computer Science
7034
, 2012, pp. 136-147
Right angle crossing graphs and 1-planarity
Peter Eades
,
Giuseppe Liotta
Lecture Notes in Computer Science
7034
, 2012, pp. 148-153
Pinning balloons with perfect angles and optimal area
Immanuel Halupczok
,
André Schulz
Lecture Notes in Computer Science
7034
, 2012, pp. 154-165
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
Generalizing geometric graphs
Edith Brunel
,
Andreas Gemsa
,
Marcus Krug
,
Ignaz Rutter
,
Dorothea Wagner
Lecture Notes in Computer Science
7034
, 2012, pp. 179-190
How to visualize the K-root name server (demo)
Giuseppe Di Battista
,
Claudio Squarcella
,
Wolfgang Nagele
Lecture Notes in Computer Science
7034
, 2012, pp. 191-202
Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts
Maxime Dumas
,
Michael J. McGuffin
,
Jean-Marc Robert
,
Marie-Claire Willig
Lecture Notes in Computer Science
7034
, 2012, pp. 203-214
Visual community detection: An evaluation of 2D, 3D perspective and 3D stereoscopic displays
Nicolas Greffard
,
Fabien Picarougne
,
Pascale Kuntz
Lecture Notes in Computer Science
7034
, 2012, pp. 215-225
Evaluating partially drawn links for directed graph edges
Michael Burch
,
Corinna Vehlow
,
Natalia Konevtsova
,
Daniel Weiskopf
Lecture Notes in Computer Science
7034
, 2012, pp. 226-237
Realizing planar graphs as convex polytopes
Günter Rote
Lecture Notes in Computer Science
7034
, 2012, pp. 238-241
Overloaded orthogonal drawings
Evgenios M. Kornaropoulos
,
Ioannis G. Tollis
Lecture Notes in Computer Science
7034
, 2012, pp. 242-253
Drawing cubic graphs with the four basic slopes
Padmini Mukkamala
,
Dömötör Pálvölgyi
Lecture Notes in Computer Science
7034
, 2012, pp. 254-265
k
-quasi-planar graphs
Andrew Suk
Lecture Notes in Computer Science
7034
, 2012, pp. 266-277
Seiten 1
2
>