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=3383
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing radial drawings on the minimum number of circles
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Lecture Notes in Computer Science
3383
, 2004, pp. 251-261
Hamiltonian-with-handles graphs and the
k
-spine drawability problem
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Matthew Suderman
Lecture Notes in Computer Science
3383
, 2004, pp. 262-272
Distributed graph layout for sensor networks
Craig Gotsman
,
Yehuda Koren
Lecture Notes in Computer Science
3383
, 2004, pp. 273-284
Drawing large graphs with a potential-field-based multilevel algorithm
Stefan Hachul
,
Michael Jünger
Lecture Notes in Computer Science
3383
, 2004, pp. 285-295
Building blocks of upward planar digraphs
Patrick Healy
,
Karol Lynch
Lecture Notes in Computer Science
3383
, 2004, pp. 296-306
A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs
Seok-Hee Hong
,
Peter Eades
Lecture Notes in Computer Science
3383
, 2004, pp. 307-317
Train tracks and confluent drawings
Peter Hui
,
Marcus Schaefer
,
Daniel S̑tefankovic̑
Lecture Notes in Computer Science
3383
, 2004, pp. 318-328
The three dimensional logic engine
Matthew Kitching
,
Sue Whitesides
Lecture Notes in Computer Science
3383
, 2004, pp. 329-339
Long alternating paths in bicolored point sets
Jan Kync̑l
,
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
3383
, 2004, pp. 340-348
Intersection reverse sequences and geometric applications
Adam Marcus
,
Gábor Tardos
Lecture Notes in Computer Science
3383
, 2004, pp. 349-359
New exact results and bounds for bipartite crossing numbers of meshes
Matthew C. Newton
,
Ondrej Sýkora
,
Martin Uz̑ovic̑
,
Imrich Vrt'o
Lecture Notes in Computer Science
3383
, 2004, pp. 360-370
Drawing Pfaffian graphs
Serguei Norine
Lecture Notes in Computer Science
3383
, 2004, pp. 371-376
3D visualization of semantic metadata models and ontologies
Charalampos Papamanthou
,
Ioannis G. Tollis
,
Martin Doerr
Lecture Notes in Computer Science
3383
, 2004, pp. 377-388
A note on the self-similarity of some orthogonal drawings
Maurizio Patrignani
Lecture Notes in Computer Science
3383
, 2004, pp. 389-394
No-three-in-line-in-3D
Attila Pór
,
David R. Wood
Lecture Notes in Computer Science
3383
, 2004, pp. 395-402
Visual navigation of compound graphs
Marcus Raitner
Lecture Notes in Computer Science
3383
, 2004, pp. 403-413
Layout volumes of the hypercube
Lubomir Torok
,
Imrich Vrt'o
Lecture Notes in Computer Science
3383
, 2004, pp. 414-424
New theoretical bounds of visibility representation of plane graphs
Huaming Zhang
,
Xin He
Lecture Notes in Computer Science
3383
, 2004, pp. 425-430
Visualizing large graphs with compound-fisheye views and treemaps
James Abello
,
Stephen G. Kobourov
,
Roman Yusufov
Lecture Notes in Computer Science
3383
, 2004, pp. 431-441
A compound graph layout algorithm for biological pathways
Ugur Dogrusoz
,
Erhan Giral
,
Ahmet Cetintas
,
Ali Civril
,
Emek Demir
Lecture Notes in Computer Science
3383
, 2004, pp. 442-447
Curvilinear graph drawing using the force-directed method
Benjamin Finkel
,
Roberto Tamassia
Lecture Notes in Computer Science
3383
, 2004, pp. 448-453
Graphael: A system for generalized force-directed layouts
David Forrester
,
Stephen G. Kobourov
,
Armand Navabi
,
Kevin Wampler
,
Gary V. Yee
Lecture Notes in Computer Science
3383
, 2004, pp. 454-464
QUOGGLES: Query on graphs - A graphical largely extensible system
Paul Holleis
,
Franz J. Brandenburg
Lecture Notes in Computer Science
3383
, 2004, pp. 465-470
Visualisation of large and complex networks using PolyPlane
Seok-Hee Hong
,
Tom Murtagh
Lecture Notes in Computer Science
3383
, 2004, pp. 471-481
The metro map layout problem
Seok-Hee Hong
,
Damian Merrick
,
Hugo A.D. do Nascimento
Lecture Notes in Computer Science
3383
, 2004, pp. 482-491
Seiten
<
1
2
3
>