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=7074

• Fast Fréchet queries
  Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
  Lecture Notes in Computer Science 7074, 2011, pp. 240-249
• Angle-restricted Steiner arborescences for flow map layout
  Kevin Buchin, Bettina Speckmann, Kevin Verbeek
  Lecture Notes in Computer Science 7074, 2011, pp. 250-259
• Treemaps with bounded aspect ratio
  Mark de Berg, Bettina Speckmann, Vincent van der Weele
  Lecture Notes in Computer Science 7074, 2011, pp. 260-270
• Simultaneous embedding of embedded planar graphs
  Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
  Lecture Notes in Computer Science 7074, 2011, pp. 271-280
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
  Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
  Lecture Notes in Computer Science 7074, 2011, pp. 281-291
• Fully retroactive approximate range and nearest neighbor searching
  Michael T. Goodrich, Joseph A. Simons
  Lecture Notes in Computer Science 7074, 2011, pp. 292-301
• Compact representation of posets
  Arash Farzan, Johannes Fischer
  Lecture Notes in Computer Science 7074, 2011, pp. 302-311
• Explicit array-based compact data structures for triangulations
  Luca Castelli Aleardi, Olivier Devillers
  Lecture Notes in Computer Science 7074, 2011, pp. 312-322
• Space-efficient data-analysis queries on grids
  Gonzalo Navarro, Luís M.S. Russo
  Lecture Notes in Computer Science 7074, 2011, pp. 323-332
• A polynomial kernel for Feedback Arc Set on bipartite tournaments
  Pranabendu Misra, Venkatesh Raman, M.S. Ramanujan, Saket Saurabh
  Lecture Notes in Computer Science 7074, 2011, pp. 333-343
• Fixed-parameter complexity of feedback vertex set in bipartite tournaments
  Sheng-Ying Hsiao
  Lecture Notes in Computer Science 7074, 2011, pp. 344-353
• Parameterized algorithms for inclusion of linear matchings
  Sylvain Guillemot
  Lecture Notes in Computer Science 7074, 2011, pp. 354-363
• Computational study on bidimensionality theory based algorithm for longest path problem
  Chunhao Wang, Qian-Ping Gu
  Lecture Notes in Computer Science 7074, 2011, pp. 364-373
• Sorting, searching, and simulation in the MapReduce framework
  Michael T. Goodrich, Nodari Sitchinava, Qin Zhang
  Lecture Notes in Computer Science 7074, 2011, pp. 374-383
• External-memory multimaps
  Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
  Lecture Notes in Computer Science 7074, 2011, pp. 384-394
• External memory orthogonal range reporting with fast updates
  Yakov Nekrich
  Lecture Notes in Computer Science 7074, 2011, pp. 395-404
• Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization
  Jörg Lässig, Dirk Sudholt
  Lecture Notes in Computer Science 7074, 2011, pp. 405-414
• Verifying Nash equilibria in PageRank games on undirected web graphs
  David Avis, Kazuo Iwama, Daichi Paku
  Lecture Notes in Computer Science 7074, 2011, pp. 415-424
• Improved collaborative filtering
  Aviv Nisgav, Boaz Patt-Shamir
  Lecture Notes in Computer Science 7074, 2011, pp. 425-434
• Asymptotic modularity of some graph classes
  Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
  Lecture Notes in Computer Science 7074, 2011, pp. 435-444
• Program size and temperature in self-assembly
  Ho-Lin Chen, David Doty, Shinnosuke Seki
  Lecture Notes in Computer Science 7074, 2011, pp. 445-453
• Optimization, randomized approximability, and Boolean constraint satisfaction problems
  Tomoyuki Yamakami
  Lecture Notes in Computer Science 7074, 2011, pp. 454-463
• Lower bounds for myopic DPLL algorithms with a cut heuristic
  Dmitry Itsykson, Dmitry Sokolov
  Lecture Notes in Computer Science 7074, 2011, pp. 464-473
• Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
  Ryuta Ando, Tomomi Matsui
  Lecture Notes in Computer Science 7074, 2011, pp. 474-483
• Packing-based approximation algorithm for the k-set cover problem
  Martin Fürer, Huiwen Yu
  Lecture Notes in Computer Science 7074, 2011, pp. 484-493