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

• Optimal randomized algorithm for the density selection problem
  Tien-Ching Lin, D.T. Lee
  Lecture Notes in Computer Science 5878, 2009, pp. 1004-1013
• New results on simple stochastic games
  Decheng Dai, Rong Ge
  Lecture Notes in Computer Science 5878, 2009, pp. 1014-1023
• Worst-case and smoothed analysis of k-means clustering with Bregman divergences
  Bodo Manthey, Heiko Röglin
  Lecture Notes in Computer Science 5878, 2009, pp. 1024-1033
• Succinct index for dynamic dictionary matching
  Wing-Kai Hon, Tak-Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 5878, 2009, pp. 1034-1043
• Range non-overlapping indexing
  Hagai Cohen, Ely Porat
  Lecture Notes in Computer Science 5878, 2009, pp. 1044-1053
• Querying two boundary points for shortest paths in a polygonal domain
  Sang Won Bae, Yoshio Okamoto
  Lecture Notes in Computer Science 5878, 2009, pp. 1054-1063
• Pattern matching for 321-avoiding permutations
  Sylvain Guillemot, Stéphane Vialette
  Lecture Notes in Computer Science 5878, 2009, pp. 1064-1073
• Folding a better checkerboard
  Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang
  Lecture Notes in Computer Science 5878, 2009, pp. 1074-1083
• Finding all approximate gapped palindromes
  Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao
  Lecture Notes in Computer Science 5878, 2009, pp. 1084-1093
• General pseudo-random generators from weaker models of computation
  George Karakostas
  Lecture Notes in Computer Science 5878, 2009, pp. 1094-1103
• Random generation and enumeration of bipartite permutation graphs
  Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
  Lecture Notes in Computer Science 5878, 2009, pp. 1104-1113
• A combinatorial algorithm for Horn programs
  R. Chandrasekaran, K. Subramani
  Lecture Notes in Computer Science 5878, 2009, pp. 1114-1123
• Online Maximum Directed Cut
  Amotz Bar-Noy, Michael Lampis
  Lecture Notes in Computer Science 5878, 2009, pp. 1124-1133
• Maintaining nets and net trees under incremental motion
  Minkyoung Cho, David M. Mount, Eunhui Park
  Lecture Notes in Computer Science 5878, 2009, pp. 1134-1143
• Distributed scheduling of parallel hybrid computations
  Shivali Agarwal, Ankur Narang, Rudrapatna K. Shyamasundar
  Lecture Notes in Computer Science 5878, 2009, pp. 1144-1154
• I/O-efficient contour tree simplification
  Lars Arge, Morten Revsbæk
  Lecture Notes in Computer Science 5878, 2009, pp. 1155-1165
• Algorithms for computing the maximum weight region decomposable into elementary shapes
  Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama
  Lecture Notes in Computer Science 5878, 2009, pp. 1166-1174
• I/O and space-efficient path traversal in planar graphs
  Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
  Lecture Notes in Computer Science 5878, 2009, pp. 1175-1184
• Improved algorithms for finding consistent superstrings based on a new graph model
  Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim
  Lecture Notes in Computer Science 5878, 2009, pp. 1185-1194
• Two-vertex connectivity augmentations for graphs with a partition constraint
  Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu
  Lecture Notes in Computer Science 5878, 2009, pp. 1195-1204
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets
  Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
  Lecture Notes in Computer Science 5878, 2009, pp. 1205-1214
• On partitioning a graph into two connected subgraphs
  Daniël Paulusma, Johan M.M. van Rooij
  Lecture Notes in Computer Science 5878, 2009, pp. 1215-1224