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=7704
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Point-set embeddability of 2-colored trees
Fabrizio Frati
,
Marc Glisse
,
William J. Lenhart
,
Giuseppe Liotta
,
Tamara Mchedlidze
,
Rahmuma Islam Nishat
Lecture Notes in Computer Science
7704
, 2013, pp. 291-302
Covering paths for planar point sets
Adrian Dumitrescu
,
Csaba D. Tóth
Lecture Notes in Computer Science
7704
, 2013, pp. 303-314
Grid drawings and the chromatic number
Martin Balko
Lecture Notes in Computer Science
7704
, 2013, pp. 315-326
On the density of maximal 1-planar graphs
Franz J. Brandenburg
,
David Eppstein
,
Andreas Gleißner
,
Michael T. Goodrich
,
Kathrin Hanauer
,
Josef Reislhuber
Lecture Notes in Computer Science
7704
, 2013, pp. 327-338
Testing maximal 1-planarity of graphs with a rotation system in linear time
Peter Eades
,
Seok-Hee Hong
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Lecture Notes in Computer Science
7704
, 2013, pp. 339-345
Tangles and degenerate tangles
Andres J. Ruiz-Vargas
Lecture Notes in Computer Science
7704
, 2013, pp. 346-351
Density theorems for intersection graphs of
t
-monotone curves
Andrew Suk
Lecture Notes in Computer Science
7704
, 2013, pp. 352-363
The visible perimeter of an arrangement of disks
Gabriel Nivasch
,
János Pach
,
Gábor Tardos
Lecture Notes in Computer Science
7704
, 2013, pp. 364-375
Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings
Luca Castelli Aleardi
,
Olivier Devillers
,
Éric Fusy
Lecture Notes in Computer Science
7704
, 2013, pp. 376-387
Planar preprocessing for spring embedders
J. Joseph Fowler
,
Stephen G. Kobourov
Lecture Notes in Computer Science
7704
, 2013, pp. 388-399
StreamEB: Stream edge bundling
Quan Nguyen
,
Peter Eades
,
Seok-Hee Hong
Lecture Notes in Computer Science
7704
, 2013, pp. 400-413
Force-directed graph drawing using social gravity and scaling
Michael J. Bannister
,
David Eppstein
,
Michael T. Goodrich
,
Lowell Trott
Lecture Notes in Computer Science
7704
, 2013, pp. 414-425
Drawing clustered graphs as topographic maps
Martin Gronemann
,
Michael Jünger
Lecture Notes in Computer Science
7704
, 2013, pp. 426-438
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
On the usability of Lombardi graph drawings
Helen C. Purchase
,
John Hamer
,
Martin Nöllenburg
,
Stephen G. Kobourov
Lecture Notes in Computer Science
7704
, 2013, pp. 451-462
Drawing metro maps using Bézier curves
Martin Fink
,
Herman Haverkort
,
Martin Nöllenburg
,
Maxwell Roberts
,
Julian Schuhmann
,
Alexander Wolff
Lecture Notes in Computer Science
7704
, 2013, pp. 463-474
Mental map preservation helps user orientation in dynamic graphs
Daniel Archambault
,
Helen C. Purchase
Lecture Notes in Computer Science
7704
, 2013, pp. 475-486
Clustering, visualizing, and navigating for large dynamic graphs
Arnaud Sallaberry
,
Chris Muelder
,
Kwan-Liu Ma
Lecture Notes in Computer Science
7704
, 2013, pp. 487-498
DAGView: An approach for visualizing large graphs
Evgenios M. Kornaropoulos
,
Ioannis G. Tollis
Lecture Notes in Computer Science
7704
, 2013, pp. 499-510
Time-space maps from triangulations
Sandra Bies
,
Marc van Kreveld
Lecture Notes in Computer Science
7704
, 2013, pp. 511-516
Graph drawing in Ti
k
Z
Till Tantau
Lecture Notes in Computer Science
7704
, 2013, pp. 517-528
Optical graph recognition
Christopher Auer
,
Christian Bachmaier
,
Franz J. Brandenburg
,
Andreas Gleißner
,
Josef Reislhuber
Lecture Notes in Computer Science
7704
, 2013, pp. 529-540
Interactive random graph generation with evolutionary algorithms
Benjamin Bach
,
Andre Spritzer
,
Evelyne Lutton
,
Jean-Daniel Fekete
Lecture Notes in Computer Science
7704
, 2013, pp. 541-552
Visualizing large hierarchically clustered graphs with a landscape metaphor
Jan Christoph Athenstädt
,
Robert Görke
,
Marcus Krug
,
Martin Nöllenburg
Lecture Notes in Computer Science
7704
, 2013, pp. 553-554
On sparse maximal 2-planar graphs
Christopher Auer
,
Franz J. Brandenburg
,
Andreas Gleißner
,
Kathrin Hanauer
Lecture Notes in Computer Science
7704
, 2013, pp. 555-556
Seiten
<
1
2
3
>