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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=2006

• On constructing AG codes without basis functions for Riemann-Roch spaces
  Drue Coles
  Lecture Notes in Computer Science 3857, 2006, pp. 108-117
• A class of fermat curves for which Weil-Serre's bound can be improved
  Francis N. Castro, Ernesto Gomez, Oscar Moreno
  Lecture Notes in Computer Science 3857, 2006, pp. 128-135
• A genetic algorithm for cocyclic Hadamard matrices
  V. Álvarez, J.A. Armario, M.D. Frau, P. Real
  Lecture Notes in Computer Science 3857, 2006, pp. 144-153
• On achieving chosen ciphertext security with decryption errors
  Yang Cui, Kazukuni Kobara, Hideki Imai
  Lecture Notes in Computer Science 3857, 2006, pp. 173-182
• Low-floor Tanner codes via Hamming-Node or RSCC-node doping
  Shadi Abu-Surra, Gianluigi Liva, William E. Ryan
  Lecture Notes in Computer Science 3857, 2006, pp. 245-254
• Complementary sets and Reed-Muller codes for peak-to-average power ratio reduction in OFDM
  Chao-Yu Chen, Chung-Hsuan Wang, Chi-chao Chao
  Lecture Notes in Computer Science 3857, 2006, pp. 317-327
• Crossings and permutations
  Therese Biedl, Franz J. Brandenburg, Xiaotie Deng
  Lecture Notes in Computer Science 3843, 2006, pp. 1-12
• Morphing planar graphs while preserving edge directions
  Therese Biedl, Anna Lubiw, Michael J. Spriggs
  Lecture Notes in Computer Science 3843, 2006, pp. 13-24
• Dynamic spectral layout of small worlds
  Ulrik Brandes, Daniel Fleischer, Thomas Puppe
  Lecture Notes in Computer Science 3843, 2006, pp. 25-36
• Exact crossing minimization
  Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
  Lecture Notes in Computer Science 3843, 2006, pp. 37-48
• On embedding a cycle in a plane graph
  Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 3843, 2006, pp. 49-60
• Bar k-visibility graphs: Bounds on the number of edges, chromatic number, and thickness
  Alice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter
  Lecture Notes in Computer Science 3843, 2006, pp. 73-82
• Drawing K_n in three dimensions with one bend per edge
  Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
  Lecture Notes in Computer Science 3843, 2006, pp. 83-88
• Small area drawings of outerplanar graphs
  Giuseppe Di Battista, Fabrizio Frati
  Lecture Notes in Computer Science 3843, 2006, pp. 89-100
• Volume requirements of 3D upward drawings
  Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
  Lecture Notes in Computer Science 3843, 2006, pp. 101-110
• How to embed a path onto two sets of points
  Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta
  Lecture Notes in Computer Science 3843, 2006, pp. 111-116
• Upward spirality and upward planarity testing
  Walter Didimo, Francesco Giordano, Giuseppe Liotta
  Lecture Notes in Computer Science 3843, 2006, pp. 117-128
• Graph treewidth and geometric thickness parameters
  Vida Dujmović, David R. Wood
  Lecture Notes in Computer Science 3843, 2006, pp. 129-140
• GEOMI: GEOmetry for maximum insight
  Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, Kai Xu
  Lecture Notes in Computer Science 3843, 2006, pp. 468-479
• WhatsOnWeb: Using graph drawing to search the Web
  Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
  Lecture Notes in Computer Science 3843, 2006, pp. 480-491
• BLer: A \underlineBoundary \underlineLabell\underlineer for technical drawings
  Michael A. Bekos, Antonios Symvonis
  Lecture Notes in Computer Science 3843, 2006, pp. 503-504
• D-Dupe: An interactive tool for entity resolution in social networks
  Mustafa Bilgic, Louis Licamele, Lise Getoor, Ben Shneiderman
  Lecture Notes in Computer Science 3843, 2006, pp. 505-507
• A new method for efficiently generating planar graph visibility representations
  John M. Boyer
  Lecture Notes in Computer Science 3843, 2006, pp. 508-511
• SDE: Graph drawing using spectral distance embedding
  Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
  Lecture Notes in Computer Science 3843, 2006, pp. 512-513
• Graph-drawing contest report
  Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner
  Lecture Notes in Computer Science 3843, 2006, pp. 528-531