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

• The online replacement path problem
  David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
  Lecture Notes in Computer Science 8125, 2013, pp. 1-12
• Flip distance between triangulations of a simple polygon is NP-complete
  Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz
  Lecture Notes in Computer Science 8125, 2013, pp. 13-24
• Empirical evaluation of the parallel distribution sweeping framework on multicore architectures
  Deepak Ajwani, Nodari Sitchinava
  Lecture Notes in Computer Science 8125, 2013, pp. 25-36
• Computing the greedy spanner in linear space
  Sander P.A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
  Lecture Notes in Computer Science 8125, 2013, pp. 37-48
• Friendship and stable matching
  Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer
  Lecture Notes in Computer Science 8125, 2013, pp. 49-60
• An optimal and practical cache-oblivious algorithm for computing multiresolution rasters
  Lars Arge, Gerth Stlting Brodal, Jakob Truelsen, Constantinos Tsirogiannis
  Lecture Notes in Computer Science 8125, 2013, pp. 61-72
• Logit dynamics with concurrent updates for local interaction games
  Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
  Lecture Notes in Computer Science 8125, 2013, pp. 73-84
• On resilient graph spanners
  Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini
  Lecture Notes in Computer Science 8125, 2013, pp. 85-96
• Maximizing barrier coverage lifetime with mobile sensors
  Amotz Bar-Noy, Dror Rawitz, Peter Terlecky
  Lecture Notes in Computer Science 8125, 2013, pp. 97-108
• Theory and implementation of online multiselection algorithms
  Jérémy Barbay, Ankur Gupta, Seungbum Jo, Satti Srinivasa Rao, Jonathan Sorenson
  Lecture Notes in Computer Science 8125, 2013, pp. 109-120
• An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering
  Andreas Beckmann, Ulrich Meyer, David Veith
  Lecture Notes in Computer Science 8125, 2013, pp. 121-132
• Versatile succinct representations of the bidirectional Burrows-Wheeler transform
  Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
  Lecture Notes in Computer Science 8125, 2013, pp. 133-144
• Tight lower and upper bounds for the complexity of canonical colour refinement
  Christoph Berkholz, Paul Bonsma, Martin Grohe
  Lecture Notes in Computer Science 8125, 2013, pp. 145-156
• A faster computation of all the best swap edges of a shortest paths tree
  Davide Bilò, Luciano Gualà, Guido Proietti
  Lecture Notes in Computer Science 8125, 2013, pp. 157-168
• Parallel string sample sort
  Timo Bingmann, Peter Sanders
  Lecture Notes in Computer Science 8125, 2013, pp. 169-180
• Exclusive graph searching
  Lélia Blin, Janna Burman, Nicolas Nisse
  Lecture Notes in Computer Science 8125, 2013, pp. 181-192
• Largest chordal and interval subgraphs faster than 2^n
  Ivan Bliznets, Fedor V. Fomin, Michaƚ Pilipczuk, Yngve Villanger
  Lecture Notes in Computer Science 8125, 2013, pp. 193-204
• Revisiting the problem of searching on a line
  Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher
  Lecture Notes in Computer Science 8125, 2013, pp. 205-216
• On the existence of 0/1 polytopes with high semidefinite extension complexity
  Jop Briët, Daniel Dadush, Sebastian Pokutta
  Lecture Notes in Computer Science 8125, 2013, pp. 217-228
• The encoding complexity of two dimensional range minimum data structures
  Gerth Stlting Brodal, Andrej Brodnik, Pooya Davoodi
  Lecture Notes in Computer Science 8125, 2013, pp. 229-240
• Computing the Fréchet distance with a retractable leash
  Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer
  Lecture Notes in Computer Science 8125, 2013, pp. 241-252
• Vertex deletion for 3D Delaunay triangulations
  Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Shewchuk
  Lecture Notes in Computer Science 8125, 2013, pp. 253-264
• Economic 3-colored subdivision of triangulations
  Lucas Moutinho Bueno, Jorge Stolfi
  Lecture Notes in Computer Science 8125, 2013, pp. 265-276
• Limitations of deterministic auction design for correlated bidders
  Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
  Lecture Notes in Computer Science 8125, 2013, pp. 277-288
• Connectivity inference in mass spectrometry based structure determination
  Deepesh Agarwal, Julio-Cesar Silva Araujo, Christelle Caillouet, Frederic Cazals, David Coudert, Stephane Pérennes
  Lecture Notes in Computer Science 8125, 2013, pp. 289-300