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

• D^{2}-tree: A new overlay with deterministic bounds
  Gerth Stlting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos Zaroliagis
  Lecture Notes in Computer Science 6507, 2010, pp. 1-12
• Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
  Chih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo
  Lecture Notes in Computer Science 6507, 2010, pp. 13-24
• Dynamic range reporting in external memory
  Yakov Nekrich
  Lecture Notes in Computer Science 6507, 2010, pp. 25-36
• A cache-oblivious implicit dictionary with the working set property
  Gerth Stlting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
  Lecture Notes in Computer Science 6507, 2010, pp. 37-48
• The (p, q)-total labeling problem for trees
  Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  Lecture Notes in Computer Science 6507, 2010, pp. 49-60
• Drawing a tree as a minimum spanning tree approximation
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
  Lecture Notes in Computer Science 6507, 2010, pp. 61-72
• k-cyclic orientations of graphs
  Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki
  Lecture Notes in Computer Science 6507, 2010, pp. 73-84
• Improved bounds on the planar branchwidth with respect to the largest grid minor size
  Qian-Ping Gu, Hisao Tamaki
  Lecture Notes in Computer Science 6507, 2010, pp. 85-96
• Maximum overlap of convex polytopes under translation
  Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
  Lecture Notes in Computer Science 6507, 2010, pp. 97-108
• Approximate shortest homotopic paths in weighted regions
  Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang
  Lecture Notes in Computer Science 6507, 2010, pp. 109-120
• Spanning ratio and maximum detour of rectilinear paths in the L_{1} plane
  Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, Sheung-Hung Poon
  Lecture Notes in Computer Science 6507, 2010, pp. 121-131
• Approximation and hardness results for the maximum edge q-coloring problem
  Anna Adamaszek, Alexandru Popa
  Lecture Notes in Computer Science 6507, 2010, pp. 132-143
• 3-colouring AT-free graphs in polynomial time
  Juraj Stacho
  Lecture Notes in Computer Science 6507, 2010, pp. 144-155
• On coloring graphs without induced forests
  Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
  Lecture Notes in Computer Science 6507, 2010, pp. 156-167
• On the approximability of the Maximum Interval Constrained Coloring problem
  Stefan Canzar, Khaled Elbassioni, Amr Elmasry, Rajiv Raman
  Lecture Notes in Computer Science 6507, 2010, pp. 168-179
• Approximability of constrained LCS
  Minghui Jiang
  Lecture Notes in Computer Science 6507, 2010, pp. 180-191
• Approximation algorithms for the multi-vehicle scheduling problem
  Binay Bhattacharya, Yuzhuang Hu
  Lecture Notes in Computer Science 6507, 2010, pp. 192-205
• On greedy algorithms for decision trees
  Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber, Marco Molinaro
  Lecture Notes in Computer Science 6507, 2010, pp. 206-217
• Single and multiple device DSA problem, complexities and online algorithms
  Weiwei Wu, Wanyong Tian, Minming Li, Chun Jason Xue, Enhong Chen
  Lecture Notes in Computer Science 6507, 2010, pp. 218-229
• The onion diagram: A Voronoi-like tessellation of a planar line space and its applications
  Sang Won Bae, Chan-Su Shin
  Lecture Notes in Computer Science 6507, 2010, pp. 230-241
• Improved online algorithms for 1-space bounded 2-dimensional bin packing
  Yong Zhang, Jingchi Chen, Francis Y.L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin
  Lecture Notes in Computer Science 6507, 2010, pp. 242-253
• On the continuous CNN problem
  John Augustine, Nick Gravin
  Lecture Notes in Computer Science 6507, 2010, pp. 254-265
• Policies for periodic packet routing
  Britta Peis, Sebastian Stiller, Andreas Wiese
  Lecture Notes in Computer Science 6507, 2010, pp. 266-278
• Increasing speed scheduling and flow scheduling
  Sebastian Stiller, Andreas Wiese
  Lecture Notes in Computer Science 6507, 2010, pp. 279-290
• A tighter analysis of work stealing
  Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, Jean-Louis Roch, Julien Bernard
  Lecture Notes in Computer Science 6507, 2010, pp. 291-302