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: Booktitle=Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC'2009 (Honolulu, Hawaii, USA, December 16-18, 2009)

• Bubblesort and juggling sequences
  Ronald L. Graham
  Lecture Notes in Computer Science 5878, 2009, pp. 1-1
• A proof of the molecular conjecture
  Naoki Katoh
  Lecture Notes in Computer Science 5878, 2009, pp. 2-3
• Exact algorithms for dominating clique problems
  N. Bourgeois, F. Della Croce, B. Escoffier, V.Th. Paschos
  Lecture Notes in Computer Science 5878, 2009, pp. 4-13
• Enumerating stereoisomers of tree structured molecules using dynamic programming
  Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu
  Lecture Notes in Computer Science 5878, 2009, pp. 14-23
• Exact algorithms for the bottleneck Steiner tree problem
  Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 5878, 2009, pp. 24-33
• Exact algorithms for set multicover and multiset multicover problems
  Qiang-Sheng Hua, Dongxiao Yu, Francis C.M. Lau, Yuexuan Wang
  Lecture Notes in Computer Science 5878, 2009, pp. 34-44
• Practical discrete unit disk cover using an exact line-separable algorithm
  Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger
  Lecture Notes in Computer Science 5878, 2009, pp. 45-54
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
  Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
  Lecture Notes in Computer Science 5878, 2009, pp. 55-64
• On protein structure alignment under distance constraint
  Shuai Cheng Li, Yen Kaow Ng
  Lecture Notes in Computer Science 5878, 2009, pp. 65-76
• A structural lemma in 2-dimensional packing, and its implications on approximability
  Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
  Lecture Notes in Computer Science 5878, 2009, pp. 77-86
• Max-coloring paths: Tight bounds and extensions
  Telikepalli Kavitha, Julián Mestre
  Lecture Notes in Computer Science 5878, 2009, pp. 87-96
• Fréchet distance problems in weighted regions
  Yam Ki Cheung, Ovidiu Daescu
  Lecture Notes in Computer Science 5878, 2009, pp. 97-111
• The complexity of solving stochastic games on graphs
  Daniel Andersson, Peter Bro Miltersen
  Lecture Notes in Computer Science 5878, 2009, pp. 112-121
• Computational complexity of cast puzzles
  Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
  Lecture Notes in Computer Science 5878, 2009, pp. 122-131
• New bounds on the average distance from the Fermat-Weber center of a planar convex body
  Adrian Dumitrescu, Csaba D. Tóth
  Lecture Notes in Computer Science 5878, 2009, pp. 132-141
• Reconstructing numbers from pairwise function values
  Shiteng Chen, Zhiyi Huang, Sampath Kannan
  Lecture Notes in Computer Science 5878, 2009, pp. 142-152
• Hilbert's thirteenth problem and circuit complexity
  Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen
  Lecture Notes in Computer Science 5878, 2009, pp. 153-162
• Interval stabbing problems in small integer ranges
  Jens M. Schmidt
  Lecture Notes in Computer Science 5878, 2009, pp. 163-172
• Online sorted range reporting
  Gerth Stlting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
  Lecture Notes in Computer Science 5878, 2009, pp. 173-182
• Data structures for approximate orthogonal range counting
  Yakov Nekrich
  Lecture Notes in Computer Science 5878, 2009, pp. 183-192
• Dynamic 3-sided planar range queries with expected doubly logarithmic time
  Gerth Stlting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
  Lecture Notes in Computer Science 5878, 2009, pp. 193-202
• Untangled monotonic chains and adaptive range search
  Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
  Lecture Notes in Computer Science 5878, 2009, pp. 203-212
• Geodesic spanners on polyhedral surfaces
  Sanjiv Kapoor, Xiang-Yang Li
  Lecture Notes in Computer Science 5878, 2009, pp. 213-223
• Approximating points by a piecewise linear function: I
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 5878, 2009, pp. 224-233
• Approximating points by a piecewise linear function: II. Dealing with outliers
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 5878, 2009, pp. 234-243