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 [1]	Hilfe

Suche: Series=LNCS AND Volume=7501

• A model for minimizing active processor time
  Jessica Chang, Harold N. Gabow, Samir Khuller
  Lecture Notes in Computer Science 7501, 2012, pp. 289-300
• Polynomial-time algorithms for energy games with special weight structures
  Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
  Lecture Notes in Computer Science 7501, 2012, pp. 301-312
• Data structures on event graphs
  Bernard Chazelle, Wolfgang Mulzer
  Lecture Notes in Computer Science 7501, 2012, pp. 313-324
• Improved distance oracles and spanners for vertex-labeled graphs
  Shiri Chechik
  Lecture Notes in Computer Science 7501, 2012, pp. 325-336
• The quantum query complexity of read-many formulas
  Andrew M. Childs, Shelby Kimmel, Robin Kothari
  Lecture Notes in Computer Science 7501, 2012, pp. 337-348
• A path-decomposition theorem with applications to pricing and covering on trees
  Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski
  Lecture Notes in Computer Science 7501, 2012, pp. 349-360
• Steiner forest orientation problems
  Marek Cygan, Guy Kortsarz, Zeev Nutov
  Lecture Notes in Computer Science 7501, 2012, pp. 361-372
• A dual-fitting \frac{3}{2}-approximation algorithm for some minimum-cost graph problems
  James M. Davis, David P. Williamson
  Lecture Notes in Computer Science 7501, 2012, pp. 373-382
• Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
  Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
  Lecture Notes in Computer Science 7501, 2012, pp. 383-394
• Finding social optima in congestion games with positive externalities
  Bart de Keijzer, Guido Schäfer
  Lecture Notes in Computer Science 7501, 2012, pp. 395-406
• Better bounds for graph bisection
  Daniel Delling, Renato F. Werneck
  Lecture Notes in Computer Science 7501, 2012, pp. 407-418
• On the complexity of metric dimension
  Josep Díaz, Olli Pottonen, Maria Serna, Erik Jan van Leeuwen
  Lecture Notes in Computer Science 7501, 2012, pp. 419-430
• Embedding paths into trees: VM placement to minimize congestion
  Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde
  Lecture Notes in Computer Science 7501, 2012, pp. 431-442
• Faster geometric algorithms via dynamic determinant computation
  Vissarion Fisikopoulos, Luis Peñaranda
  Lecture Notes in Computer Science 7501, 2012, pp. 443-454
• Lines through segments in 3D space
  Efi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin
  Lecture Notes in Computer Science 7501, 2012, pp. 455-466
• A polynomial kernel for proper interval vertex deletion
  Fedor V. Fomin, Saket Saurabh, Yngve Villanger
  Lecture Notes in Computer Science 7501, 2012, pp. 467-478
• Knowledge, level of symmetry, and time of leader election
  Emanuele G. Fusco, Andrzej Pelc
  Lecture Notes in Computer Science 7501, 2012, pp. 479-490
• An experimental study of dynamic dominators
  Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura Federico Santaroni
  Lecture Notes in Computer Science 7501, 2012, pp. 491-502
• Optimizing over the growing spectrahedron
  Joachim Giesen, Martin Jaggi, Sören Laue
  Lecture Notes in Computer Science 7501, 2012, pp. 503-514
• Induced disjoint paths in claw-free graphs
  Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
  Lecture Notes in Computer Science 7501, 2012, pp. 515-526
• On min-power Steiner tree
  Fabrizio Grandoni
  Lecture Notes in Computer Science 7501, 2012, pp. 527-538
• Maximum multicommodity flows over time without intermediate storage
  Martin Groß, Martin Skutella
  Lecture Notes in Computer Science 7501, 2012, pp. 539-550
• Approximating earliest arrival flows in arbitrary networks
  Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
  Lecture Notes in Computer Science 7501, 2012, pp. 551-562
• Resource buying games
  Tobias Harks, Britta Peis
  Lecture Notes in Computer Science 7501, 2012, pp. 563-574
• Succinct data structures for path queries
  Meng He, J. Ian Munro, Gelin Zhou
  Lecture Notes in Computer Science 7501, 2012, pp. 575-586