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

• Lightweight approximate selection
  Brian C. Dean, Rommel Jalasutram, Chad Waters
  Lecture Notes in Computer Science 8737, 2014, pp. 309-320
• Robust distance queries on massive networks
  Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
  Lecture Notes in Computer Science 8737, 2014, pp. 321-333
• A dynamic data structure for MSO properties in graphs with bounded tree-depth
  Zdenȇk Dvoȓák, Martin Kupec, Vojtȇch Tůma
  Lecture Notes in Computer Science 8737, 2014, pp. 334-345
• Large independent sets in triangle-free planar graphs
  Zdenȇk Dvoȓák, Matthias Mnich
  Lecture Notes in Computer Science 8737, 2014, pp. 346-357
• GRASP. Extending graph separators for the single-source shortest-path problem
  Alexandros Efentakis, Dieter Pfoser
  Lecture Notes in Computer Science 8737, 2014, pp. 358-370
• Switching colouring of G(n,d/n) for sampling up to Gibbs uniqueness threshold
  Charilaos Efthymiou
  Lecture Notes in Computer Science 8737, 2014, pp. 371-381
• From graph to hypergraph multiway partition: Is the single threshold the only route?
  Alina Ene, Huy L. Nguy\skew1\tilde{\mbox{\^e}}n
  Lecture Notes in Computer Science 8737, 2014, pp. 382-393
• Deterministic stateless centralized local algorithms for bounded degree graphs
  Guy Even, Moti Medina, Dana Ron
  Lecture Notes in Computer Science 8737, 2014, pp. 394-405
• Bicriteria data compression: Efficient and usable
  Andrea Farruggia, Paolo Ferragina, Rossano Venturini
  Lecture Notes in Computer Science 8737, 2014, pp. 406-417
• Amortized \tilde{O}(|V|)-delay algorithm for listing chordless cycles in undirected graphs
  Rui Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
  Lecture Notes in Computer Science 8737, 2014, pp. 418-429
• LP approaches to improved approximation for clique transversal in perfect graphs
  Samuel Fiorini, R. Krithika, N.S. Narayanaswamy, Venkatesh Raman
  Lecture Notes in Computer Science 8737, 2014, pp. 430-442
• Representative sets of product families
  Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
  Lecture Notes in Computer Science 8737, 2014, pp. 443-454
• Weighted ancestors in suffix trees
  Paweƚ Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson
  Lecture Notes in Computer Science 8737, 2014, pp. 455-466
• Improved practical matrix sketching with guarantees
  Mina Ghashami, Amey Desai, Jeff M. Phillips
  Lecture Notes in Computer Science 8737, 2014, pp. 467-479
• Computing regions decomposable into m stars
  Matt Gibson, Kasturi Varadarajan, Xiaodong Wu
  Lecture Notes in Computer Science 8737, 2014, pp. 480-491
• The parameterized complexity of graph cyclability
  Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 8737, 2014, pp. 492-504
• Dimension reduction via colour refinement
  Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman
  Lecture Notes in Computer Science 8737, 2014, pp. 505-516
• How experts can solve LPs online
  Anupam Gupta, Marco Molinaro
  Lecture Notes in Computer Science 8737, 2014, pp. 517-529
• Parameterized complexity of the k-arc Chinese Postman Problem
  Gregory Gutin, Mark Jones, Bin Sheng
  Lecture Notes in Computer Science 8737, 2014, pp. 530-541
• Approximating the maximum overlap of polygons under translation
  Sariel Har-Peled, Subhro Roy
  Lecture Notes in Computer Science 8737, 2014, pp. 542-553
• Ordering without forbidden patterns
  Pavol Hell, Bojan Mohar, Arash Rafiey
  Lecture Notes in Computer Science 8737, 2014, pp. 554-565
• Halving balls in deterministic linear time
  Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
  Lecture Notes in Computer Science 8737, 2014, pp. 566-578
• Turing kernelization for finding long paths and cycles in restricted graph classes
  Bart M.P. Jansen
  Lecture Notes in Computer Science 8737, 2014, pp. 579-591
• Optimal parallel quantum query algorithms
  Stacey Jeffery, Frederic Magniez, Ronald de Wolf
  Lecture Notes in Computer Science 8737, 2014, pp. 592-604
• Sublinear space algorithms for the longest common substring problem
  Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhj
  Lecture Notes in Computer Science 8737, 2014, pp. 605-617