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

• D^{2}-tree: A new overlay with deterministic bounds
  Gerth Stlting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos Zaroliagis
  Lecture Notes in Computer Science 6507, 2010, pp. 1-12
• A cache-oblivious implicit dictionary with the working set property
  Gerth Stlting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
  Lecture Notes in Computer Science 6507, 2010, pp. 37-48
• Maximum overlap of convex polytopes under translation
  Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
  Lecture Notes in Computer Science 6507, 2010, pp. 97-108
• Approximate shortest homotopic paths in weighted regions
  Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang
  Lecture Notes in Computer Science 6507, 2010, pp. 109-120
• Approximation and hardness results for the maximum edge q-coloring problem
  Anna Adamaszek, Alexandru Popa
  Lecture Notes in Computer Science 6507, 2010, pp. 132-143
• On coloring graphs without induced forests
  Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
  Lecture Notes in Computer Science 6507, 2010, pp. 156-167
• On the approximability of the Maximum Interval Constrained Coloring problem
  Stefan Canzar, Khaled Elbassioni, Amr Elmasry, Rajiv Raman
  Lecture Notes in Computer Science 6507, 2010, pp. 168-179
• Approximation algorithms for the multi-vehicle scheduling problem
  Binay Bhattacharya, Yuzhuang Hu
  Lecture Notes in Computer Science 6507, 2010, pp. 192-205
• On greedy algorithms for decision trees
  Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber, Marco Molinaro
  Lecture Notes in Computer Science 6507, 2010, pp. 206-217
• The onion diagram: A Voronoi-like tessellation of a planar line space and its applications
  Sang Won Bae, Chan-Su Shin
  Lecture Notes in Computer Science 6507, 2010, pp. 230-241
• On the continuous CNN problem
  John Augustine, Nick Gravin
  Lecture Notes in Computer Science 6507, 2010, pp. 254-265
• Alphabet partitioning for compressed rank/select and applications
  Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
  Lecture Notes in Computer Science 6507, 2010, pp. 315-326
• Identifying approximate palindromes in run-length encoded strings
  Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
  Lecture Notes in Computer Science 6507, 2010, pp. 339-350
• Computing the discrete Fréchet distance with imprecise input
  Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  Lecture Notes in Computer Science 6507, 2010, pp. 422-433
• Connectivity graphs of uncertainty regions
  Erin Chambers, Alejandro Erickson, Sándor Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christoph Weibel, Sue Whitesides
  Lecture Notes in Computer Science 6507, 2010, pp. 434-445
• \pi/2-angle Yao graphs are spanners
  Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, Stefanie Wuhrer
  Lecture Notes in Computer Science 6507, 2010, pp. 446-457
• A 3/2-approximation algorithm for Generalized Steiner Trees in complete graphs with edge lengths 1 and 2
  Piotr Berman, Marek Karpinski, Alexander Zelikovsky
  Lecture Notes in Computer Science 6506, 2010, pp. 15-24
• Approximate periodicity
  Amihood Amir, Estrella Eisenberg, Avivit Levy
  Lecture Notes in Computer Science 6506, 2010, pp. 25-36
• Approximating the average stretch factor of geometric graphs
  Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel Smid
  Lecture Notes in Computer Science 6506, 2010, pp. 37-48
• Anonymous fuzzy identity-based encryption for similarity search
  David W. Cheung, Nikos Mamoulis, W.K. Wong, S.M. Yiu, Ye Zhang
  Lecture Notes in Computer Science 6506, 2010, pp. 61-72
• Should static search trees ever be unbalanced?
  Prosenjit Bose, Karim Douïeb
  Lecture Notes in Computer Science 6506, 2010, pp. 109-120
• Unit-time predecessor queries on massive data sets
  Andrej Brodnik, John Iacono
  Lecture Notes in Computer Science 6506, 2010, pp. 133-144
• Flows in one-crossing-minor-free graphs
  Erin Chambers, David Eppstein
  Lecture Notes in Computer Science 6506, 2010, pp. 241-252
• From Holant to \#CSP and back: Dichotomy for Holant^c problems
  Jin-Yi Cai, Sangxia Huang, Pinyan Lu
  Lecture Notes in Computer Science 6506, 2010, pp. 253-265
• New upper bounds on the average PTF density of Boolean functions
  Kazuyuki Amano
  Lecture Notes in Computer Science 6506, 2010, pp. 304-315