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

• Bidding on configurations in Internet ad auctions
  S. Muthukrishnan
  Lecture Notes in Computer Science 5609, 2009, pp. 1-6
• An attacker-defender game for honeynets
  Jin-Yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford
  Lecture Notes in Computer Science 5609, 2009, pp. 7-16
• On the performances of Nash equilibria in isolation games
  Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
  Lecture Notes in Computer Science 5609, 2009, pp. 17-26
• Limits to list decoding random codes
  Atri Rudra
  Lecture Notes in Computer Science 5609, 2009, pp. 27-36
• Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
  Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
  Lecture Notes in Computer Science 5609, 2009, pp. 37-46
• A (4n-4)-bit representation of a rectangular drawing or floorplan
  Toshihiko Takahashi, Ryo Fujimaki, Youhei Inoue
  Lecture Notes in Computer Science 5609, 2009, pp. 47-55
• Relationship between approximability and request structures in the minimum certificate dispersal problem
  Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
  Lecture Notes in Computer Science 5609, 2009, pp. 56-65
• Coordinate assignment for cyclic level graphs
  Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Raymund Fülöp
  Lecture Notes in Computer Science 5609, 2009, pp. 66-75
• Crossing-optimal acyclic HP-completion for outerplanar st-digraphs
  Tamara Mchedlidze, Antonios Symvonis
  Lecture Notes in Computer Science 5609, 2009, pp. 76-85
• Edge-intersection graphs of k-bend paths in grids
  Therese Biedl, Michal Stern
  Lecture Notes in Computer Science 5609, 2009, pp. 86-95
• Efficient data structures for the orthogonal range successor problem
  Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang
  Lecture Notes in Computer Science 5609, 2009, pp. 96-105
• Reconstruction of interval graphs
  Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
  Lecture Notes in Computer Science 5609, 2009, pp. 106-115
• A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
  Akiyoshi Shioura, Mutsunori Yagiura
  Lecture Notes in Computer Science 5609, 2009, pp. 116-126
• Minimal assumptions and round complexity for concurrent zero-knowledge in the bare public-key model
  Giovanni Di Crescenzo
  Lecture Notes in Computer Science 5609, 2009, pp. 127-137
• Efficient non-interactive range proof
  Tsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang
  Lecture Notes in Computer Science 5609, 2009, pp. 138-147
• Approximation algorithms for key management in secure multicast
  Agnes Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu
  Lecture Notes in Computer Science 5609, 2009, pp. 148-157
• On smoothed analysis of quicksort and Hoare'sfind
  Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
  Lecture Notes in Computer Science 5609, 2009, pp. 158-167
• On an online traveling repairman problem with flowtimes: Worst-case and average-case analysis
  Axel Simroth, Alexander Souza
  Lecture Notes in Computer Science 5609, 2009, pp. 168-177
• Three new algorithms for regular language enumeration
  Margareta Ackerman, Erkki Mäkinen
  Lecture Notes in Computer Science 5609, 2009, pp. 178-191
• Convex partitions with 2-edge connected dual graphs
  Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
  Lecture Notes in Computer Science 5609, 2009, pp. 192-204
• The closest pair problem under the Hamming Metric
  Kerui Min, Ming-Yang Kao, Hong Zhu
  Lecture Notes in Computer Science 5609, 2009, pp. 205-214
• Space efficient multi-dimensional range reporting
  Marek Karpinski, Yakov Nekrich
  Lecture Notes in Computer Science 5609, 2009, pp. 215-224
• Approximation algorithms for a network design problem
  Binay Bhattacharya, Yuzhuang Hu, Qiaosheng Shi
  Lecture Notes in Computer Science 5609, 2009, pp. 225-237
• An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
  George Karakostas, Stavros G. Kolliopoulos, Jing Wang
  Lecture Notes in Computer Science 5609, 2009, pp. 238-248
• On the hardness and approximability of planar biconnectivity augmentation
  Carsten Gutwenger, Petra Mutzel, Bernd Zey
  Lecture Notes in Computer Science 5609, 2009, pp. 249-257