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

• Linear and sublinear time algorithms for basis of Abelian groups
  Li Chen, Bin Fu
  Lecture Notes in Computer Science 5878, 2009, pp. 493-502
• Good programming in transactional memory - Game theory meets multicore architecture
  Raphael Eidenbenz, Roger Wattenhofer
  Lecture Notes in Computer Science 5878, 2009, pp. 503-513
• Induced packing of odd cycles in a planar graph
  Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 5878, 2009, pp. 514-523
• On the infinitesimal rigidity of bar-and-slider frameworks
  Naoki Katoh, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 5878, 2009, pp. 524-533
• Exploration of periodically varying graphs
  Paola Flocchini, Bernard Mans, Nicola Santoro
  Lecture Notes in Computer Science 5878, 2009, pp. 534-543
• Parameterized complexity of arc-weighted directed Steiner problems
  Jiong Guo, Rolf Niedermeier, Ondȓej Suchý
  Lecture Notes in Computer Science 5878, 2009, pp. 544-553
• Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries
  Yoshitaka Nakao, Hiroshi Nagamochi
  Lecture Notes in Computer Science 5878, 2009, pp. 554-563
• Minimum cycle bases of weighted outerplanar graphs
  Tsung-Hao Liu, Hsueh-I. Lu
  Lecture Notes in Computer Science 5878, 2009, pp. 564-572
• Bandwidth on AT-free graphs
  Petr Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
  Lecture Notes in Computer Science 5878, 2009, pp. 573-582
• Editing graphs into disjoint unions of dense clusters
  Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
  Lecture Notes in Computer Science 5878, 2009, pp. 583-593
• A certifying algorithm for 3-colorability of P_5-free graphs
  Daniel Bruce, Chính T. Hoàng, Joe Sawada
  Lecture Notes in Computer Science 5878, 2009, pp. 594-604
• Parameterizing cut sets in a graph by the number of their components
  Takehiro Ito, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 5878, 2009, pp. 605-615
• Inapproximability of maximal strip recovery
  Minghui Jiang
  Lecture Notes in Computer Science 5878, 2009, pp. 616-625
• The complexity of perfect matching problems on dense hypergraphs
  Marek Karpiński, Andrzej Ruciński, Edyta Szymańska
  Lecture Notes in Computer Science 5878, 2009, pp. 626-636
• On lower bounds for constant width arithmetic circuits
  V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
  Lecture Notes in Computer Science 5878, 2009, pp. 637-646
• Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria
  Xi Chen, Shang-Hua Teng
  Lecture Notes in Computer Science 5878, 2009, pp. 647-656
• The identity correspondence problem and its applications
  Paul C. Bell, Igor Potapov
  Lecture Notes in Computer Science 5878, 2009, pp. 657-667
• Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
  Andrzej Czygrinow, Michaƚ Hańćkowiak, Edyta Szymańska
  Lecture Notes in Computer Science 5878, 2009, pp. 668-678
• An improved approximation algorithm for the traveling tournament problem
  Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui
  Lecture Notes in Computer Science 5878, 2009, pp. 679-688
• The fault-tolerant facility allocation problem
  Shihong Xu, Hong Shen
  Lecture Notes in Computer Science 5878, 2009, pp. 689-698
• Tighter approximation bounds for minimum CDS in wireless ad hoc networks
  Minming Li, Peng-Jun Wan, Frances Yao
  Lecture Notes in Computer Science 5878, 2009, pp. 699-709
• Maximal strip recovery problem with gaps: Hardness and approximation algorithms
  Laurent Bulteau, Guillaume Fertin, Irena Rusu
  Lecture Notes in Computer Science 5878, 2009, pp. 710-719
• The directed Hausdorff distance between imprecise point sets
  Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle
  Lecture Notes in Computer Science 5878, 2009, pp. 720-729
• Computing multidimensional persistence
  Gunnar Carlsson, Gurjeet Singh, Afra Zomorodian
  Lecture Notes in Computer Science 5878, 2009, pp. 730-739
• Locating an obnoxious line among planar objects
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 5878, 2009, pp. 740-749