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

• Balls into bins made faster
  Megha Khosla
  Lecture Notes in Computer Science 8125, 2013, pp. 601-612
• An alternative approach to alternative routes: HiDAR
  Moritz Kobitzsch
  Lecture Notes in Computer Science 8125, 2013, pp. 613-624
• Efficient indexes for jumbled pattern matching with constant-sized alphabet
  Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
  Lecture Notes in Computer Science 8125, 2013, pp. 625-636
• Better approximation algorithms for technology diffusion
  Jochen Könemann, Sina Sadeghian, Laura Sanità
  Lecture Notes in Computer Science 8125, 2013, pp. 637-646
• On polynomial kernels for integer linear programs: Covering, packing and feasibility
  Stefan Kratsch
  Lecture Notes in Computer Science 8125, 2013, pp. 647-658
• Balanced neighbor selection for BitTorrent-like networks
  Sándor Laki, Tamás Lukovszki
  Lecture Notes in Computer Science 8125, 2013, pp. 659-670
• Parameterized complexity of directed Steiner tree on sparse graphs
  Mark Jones, Daniel Lokshtanov, M.S. Ramanujan, Saket Saurabh, Ondȓej Suchý
  Lecture Notes in Computer Science 8125, 2013, pp. 671-682
• Improved approximation algorithms for projection games
  Pasin Manurangsi, Dana Moshkovitz
  Lecture Notes in Computer Science 8125, 2013, pp. 683-694
• The compressed annotation matrix: An efficient data structure for computing persistent cohomology
  Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria
  Lecture Notes in Computer Science 8125, 2013, pp. 695-706
• Approximation algorithms for facility location with capacitated and length-bounded tree connections
  Jannik Matuschke, Andreas Bley, Benjamin Müller
  Lecture Notes in Computer Science 8125, 2013, pp. 707-718
• The recognition of simple-triangle graphs and of linear-interval orders is polynomial
  George B. Mertzios
  Lecture Notes in Computer Science 8125, 2013, pp. 719-730
• Z-skip-links for fast traversal of ZDDs representing large-scale sparse datasets
  Shin-Ichi Minato
  Lecture Notes in Computer Science 8125, 2013, pp. 731-742
• Optimal color range reporting in one dimension
  Yakov Nekrich, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 8125, 2013, pp. 743-754
• Lagrangian duality in online scheduling with resource augmentation and speed scaling
  Kim Thang Nguyen
  Lecture Notes in Computer Science 8125, 2013, pp. 755-766
• Euclidean greedy drawings of trees
  Martin Nöllenburg, Roman Prutkin
  Lecture Notes in Computer Science 8125, 2013, pp. 767-778
• Sparse fault-tolerant BFS trees
  Merav Parter, David Peleg
  Lecture Notes in Computer Science 8125, 2013, pp. 779-790
• On the most likely convex hull of uncertain points
  Subhash Suri, Kevin Verbeek, Hakan Yıldız
  Lecture Notes in Computer Science 8125, 2013, pp. 791-802
• Top-k document retrieval in external memory
  Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 8125, 2013, pp. 803-814
• Shell: A spatial decomposition data structure for 3D curve traversal on many-core architectures
  Kai Xiao, Danny Ziyi Chen, Xiaobo Sharon Hu, Bo Zhou
  Lecture Notes in Computer Science 8125, 2013, pp. 815-826