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=4372
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Path simplification for metro map layout
Damian Merrick
,
Joachim Gudmundsson
Lecture Notes in Computer Science
4372
, 2007, pp. 258-269
Minimizing intra-edge crossings in wiring diagrams and public transportation maps
Marc Benkert
,
Martin Nöllenburg
,
Takeaki Uno
,
Alexander Wolff
Lecture Notes in Computer Science
4372
, 2007, pp. 270-281
st
-planar learning spaces
David Eppstein
Lecture Notes in Computer Science
4372
, 2007, pp. 282-293
Choosing colors for geometric graphs via color space embeddings
Michael B. Dillencourt
,
David Eppstein
,
Michael T. Goodrich
Lecture Notes in Computer Science
4372
, 2007, pp. 294-305
Morphing planar graphs in spherical space
Stephen G. Kobourov
,
Matthew Landis
Lecture Notes in Computer Science
4372
, 2007, pp. 306-317
k
-colored point-set embeddability of outerplanar graphs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
,
Francesco Trotta
,
Stephen K. Wismath
Lecture Notes in Computer Science
4372
, 2007, pp. 318-329
Thickness of bar 1-visibility graphs
Stefan Felsner
,
Mareike Massow
Lecture Notes in Computer Science
4372
, 2007, pp. 330-342
A new approximation algorithm for bend minimization in the Kandinsky model
Wilhelm Barth
,
Petra Mutzel
,
Canan Yıldız
Lecture Notes in Computer Science
4372
, 2007, pp. 343-354
Radial drawings of graphs: Geometric constraints and trade-offs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
Lecture Notes in Computer Science
4372
, 2007, pp. 355-366
Characterization of unlabeled level planar trees
Alejandro Estrella-Balderrama
,
J. Joseph Fowler
,
Stephen G. Kobourov
Lecture Notes in Computer Science
4372
, 2007, pp. 367-379
Drawing bipartite graphs on two curves
Emilio Di Giacomo
,
Luca Grilli
,
Giuseppe Liotta
Lecture Notes in Computer Science
4372
, 2007, pp. 380-385
Improved circular layouts
Emden R. Gansner
,
Yehuda Koren
Lecture Notes in Computer Science
4372
, 2007, pp. 386-398
Controllable and progressive edge clustering for large networks
Huamin Qu
,
Hong Zhou
,
Yingcai Wu
Lecture Notes in Computer Science
4372
, 2007, pp. 399-404
Biclique edge cover graphs and confluent drawings
Michael Hirsch
,
Henk Meijer
,
David Rappaport
Lecture Notes in Computer Science
4372
, 2007, pp. 405-416
Schnyder woods and orthogonal surfaces
Stefan Felsner
,
Florian Zickfeld
Lecture Notes in Computer Science
4372
, 2007, pp. 417-429
Partitions of graphs into trees
Therese Biedl
,
Franz J. Brandenburg
Lecture Notes in Computer Science
4372
, 2007, pp. 430-439
The website for graph visualization software references (GVSR)
Bruno Pinaud
,
Pascale Kuntz
,
Fabien Picarougne
Lecture Notes in Computer Science
4372
, 2007, pp. 440-441
Smoother transitions between breadth-first-spanning-tree-based drawings
Christopher Homan
,
Andrew Pavlo
,
Jonathan Schull
Lecture Notes in Computer Science
4372
, 2007, pp. 442-445
Fast node overlap removal - Correction
Tim Dwyer
,
Kim Marriott
,
Peter J. Stuckey
Lecture Notes in Computer Science
4372
, 2007, pp. 446-447
Graph-drawing contest report
Christian A. Duncan
,
Gunnar Klau
,
Stephen G. Kobourov
,
Georg Sander
Lecture Notes in Computer Science
4372
, 2007, pp. 448-452
Seiten
<
1
2