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 YEAR=2004

• Reconfiguring triangulations with edge flips and point moves
  Greg Aloupis, Prosenjit Bose, Pat Morin
  Lecture Notes in Computer Science 3383, 2004, pp. 1-11
• Drawing power law graphs
  Reid Andersen, Fan Chung, Lincoln Lu
  Lecture Notes in Computer Science 3383, 2004, pp. 12-17
• Hexagonal grid drawings: Algorithms and lower bounds
  Shabnam Aziza, Therese Biedl
  Lecture Notes in Computer Science 3383, 2004, pp. 18-24
• Improved bounds for the number of (\le k)-sets, convex quadrilaterals, and the rectilinear crossing number of K_n
  József Balogh, Gelasio Salazar
  Lecture Notes in Computer Science 3383, 2004, pp. 25-35
• On the realizable weaving patterns of polynomial curves in R^3
  Saugata Basu, Raghavan Dhandapani, Richard Pollack
  Lecture Notes in Computer Science 3383, 2004, pp. 36-42
• Drawing the AS graph in 2.5 dimensions
  Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner
  Lecture Notes in Computer Science 3383, 2004, pp. 43-48
• Boundary labeling: Models and efficient algorithms for rectangular maps
  Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
  Lecture Notes in Computer Science 3383, 2004, pp. 49-59
• Convex drawings of 3-connected plane graphs
  Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
  Lecture Notes in Computer Science 3383, 2004, pp. 60-70
• Partitions of complete geometric graphs into plane trees
  Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
  Lecture Notes in Computer Science 3383, 2004, pp. 71-81
• Additional PC-tree planarity conditions
  John M. Boyer
  Lecture Notes in Computer Science 3383, 2004, pp. 82-88
• GraphML transformation
  Ulrik Brandes, Christian Pich
  Lecture Notes in Computer Science 3383, 2004, pp. 89-99
• Clustering cycles into cycles of clusters
  Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 3383, 2004, pp. 100-110
• Unit bar-visibility layouts of triangulated polygons
  Alice M. Dean, Ellen Gethner, Joan P. Hutchinson
  Lecture Notes in Computer Science 3383, 2004, pp. 111-121
• Really straight graph drawings
  Vida Dujmović, Matthew Suderman, David R. Wood
  Lecture Notes in Computer Science 3383, 2004, pp. 122-132
• 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
• 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
• Gravisto: Graph visualization toolkit
  Christian Bachmaier, Franz J. Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner
  Lecture Notes in Computer Science 3383, 2004, pp. 502-503
• DNA secondary structures for probe design
  Yanga Byun, Kyungsook Han
  Lecture Notes in Computer Science 3383, 2004, pp. 504-507
• Graph-drawing contest report
  Franz J. Brandenburg, Christian A. Duncan, Emden Gansner, Stephen G. Kobourov
  Lecture Notes in Computer Science 3383, 2004, pp. 512-516
• Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth
  Erik D. Demaine, MohammadTaghi Hajiaghayi
  Lecture Notes in Computer Science 3383, 2004, pp. 517-533
• Lexicographic breadth first search - A survey
  Derek G. Corneil
  Lecture Notes in Computer Science 3353, 2004, pp. 1-19
• Treelike comparability graphs: Characterization, recognition, and applications
  Sabine Cornelsen, Gabriele di Stefano
  Lecture Notes in Computer Science 3353, 2004, pp. 46-57
• Collective tree spanners and routing in AT-free related graphs
  Feodor Dragan, Chenyu Yan, Derek G. Corneil
  Lecture Notes in Computer Science 3353, 2004, pp. 68-80