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

• Losing weight by gaining edges
  Amir Abboud, Kevin Lewi, Ryan Williams
  Lecture Notes in Computer Science 8737, 2014, pp. 1-12
• Optimal coordination mechanisms for multi-job scheduling games
  Fidaa Abed, José R. Correa, Chien-Chung Huang
  Lecture Notes in Computer Science 8737, 2014, pp. 13-24
• Theory and practice of chunked sequences
  Umut A. Acar, Arthur Charguéraud, Mike Rainey
  Lecture Notes in Computer Science 8737, 2014, pp. 25-36
• Convex hulls under uncertainty
  Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yıldız, Wuzhou Zhang
  Lecture Notes in Computer Science 8737, 2014, pp. 37-48
• The space-stretch-time tradeoff in distance oracles
  Rachit Agarwal
  Lecture Notes in Computer Science 8737, 2014, pp. 49-60
• Distribution-sensitive construction of the greedy spanner
  Sander P.A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink
  Lecture Notes in Computer Science 8737, 2014, pp. 61-73
• Recognizing shrinkable complexes is NP-complete
  Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard
  Lecture Notes in Computer Science 8737, 2014, pp. 74-86
• Improved approximation algorithms for box contact representations
  Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
  Lecture Notes in Computer Science 8737, 2014, pp. 87-99
• Minimum partial-matching and Hausdorff RMS-distance under translation: Combinatorics and algorithms
  Rinat Ben-Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
  Lecture Notes in Computer Science 8737, 2014, pp. 100-111
• The batched predecessor problem in external memory
  Michael A. Bender, Martín Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai
  Lecture Notes in Computer Science 8737, 2014, pp. 112-124
• Polynomial decompositions in polynomial time
  Arnab Bhattacharyya
  Lecture Notes in Computer Science 8737, 2014, pp. 125-136
• Fault-tolerant approximate shortest-path trees
  Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
  Lecture Notes in Computer Science 8737, 2014, pp. 137-148
• Fast witness extraction using a decision oracle
  Andreas Björklund, Petteri Kaski, Łukasz Kowalik
  Lecture Notes in Computer Science 8737, 2014, pp. 149-160
• Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
  Thomas Bläsius, Guido Brückner, Ignaz Rutter
  Lecture Notes in Computer Science 8737, 2014, pp. 161-172
• A subexponential parameterized algorithm for proper interval completion
  Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michaƚ Pilipczuk
  Lecture Notes in Computer Science 8737, 2014, pp. 173-184
• Computing persistent homology with various coefficient fields in a single pass
  Jean-Daniel Boissonnat, Clément Maria
  Lecture Notes in Computer Science 8737, 2014, pp. 185-196
• De-anonymization of heterogeneous random graphs in quasilinear time
  Karl Bringmann, Tobias Friedrich, Anton Krohmer
  Lecture Notes in Computer Science 8737, 2014, pp. 197-208
• Competitive algorithms for restricted caching and matroid caching
  Niv Buchbinder, Shahar Chen, Joseph (Seffi) Naor
  Lecture Notes in Computer Science 8737, 2014, pp. 209-221
• Improved algorithms for resource allocation under varying capacity
  Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal
  Lecture Notes in Computer Science 8737, 2014, pp. 222-234
• Nearly tight approximability results for minimum biclique cover and partition
  Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer
  Lecture Notes in Computer Science 8737, 2014, pp. 235-246
• Succinct indices for path minimum, with applications to path reporting
  Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
  Lecture Notes in Computer Science 8737, 2014, pp. 247-259
• Online bipartite matching with decomposable weights
  Moses Charikar, Monika Henzinger, Huy L. Nguy\skew1\tilde{\mbox{\^e}}n
  Lecture Notes in Computer Science 8737, 2014, pp. 260-271
• A faster algorithm for computing straight skeletons
  Siu-Wing Cheng, Liam Mencel, Antoine Vigneron
  Lecture Notes in Computer Science 8737, 2014, pp. 272-283
• Optimal time-space tradeoff for the 2D convex-hull problem
  Omar Darwish, Amr Elmasry
  Lecture Notes in Computer Science 8737, 2014, pp. 284-295
• Cache-oblivious persistence
  Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
  Lecture Notes in Computer Science 8737, 2014, pp. 296-308