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

• Line-constrained k-median, k-means, and k-center problems in the plane
  Haitao Wang, Jingru Zhang
  Lecture Notes in Computer Science 8889, 2014, pp. 3-14
• Reconstructing point set order types from radial orderings
  Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
  Lecture Notes in Computer Science 8889, 2014, pp. 15-26
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
  Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
  Lecture Notes in Computer Science 8889, 2014, pp. 27-37
• Average-case complexity of the min-sum matrix product problem
  Ken Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan
  Lecture Notes in Computer Science 8889, 2014, pp. 41-52
• Efficiently correcting matrix products
  Leszek Ga̧sieniec, Christos Levcopoulos, Andrzej Lingas
  Lecture Notes in Computer Science 8889, 2014, pp. 53-64
• 3D rectangulations and geometric matrix multiplication
  Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
  Lecture Notes in Computer Science 8889, 2014, pp. 65-78
• Enumeration of maximum common subtree isomorphisms with polynomial-delay
  Andre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel
  Lecture Notes in Computer Science 8889, 2014, pp. 81-93
• Efficient enumeration of induced subtrees in a k-degenerate graph
  Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
  Lecture Notes in Computer Science 8889, 2014, pp. 94-102
• An efficient method for indexing all topological orders of a directed graph
  Yuma Inoue, Shin-ichi Minato
  Lecture Notes in Computer Science 8889, 2014, pp. 103-114
• Planar matchings for weighted straight skeletons
  Therese Biedl, Stefan Huber, Peter Palfrader
  Lecture Notes in Computer Science 8889, 2014, pp. 117-127
• Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
  Meng He, Ganggui Tang, Norbert Zeh
  Lecture Notes in Computer Science 8889, 2014, pp. 128-140
• Dynamic and multi-functional labeling schemes
  Sren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
  Lecture Notes in Computer Science 8889, 2014, pp. 141-153
• Hashing and indexing: Succinct datastructures and smoothed analysis
  Alberto Policriti, Nicola Prezza
  Lecture Notes in Computer Science 8889, 2014, pp. 157-168
• Top-k term-proximity in succinct space
  J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan
  Lecture Notes in Computer Science 8889, 2014, pp. 169-180
• The power and limitations of static binary search trees with lazy finger
  Presenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
  Lecture Notes in Computer Science 8889, 2014, pp. 181-192
• Minimum-cost b-edge dominating sets on trees
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
  Lecture Notes in Computer Science 8889, 2014, pp. 195-207
• Fixed-parameter tractability of token jumping on planar graphs
  Takehiro Ito, Marcin Kamiński, Hirotaka Ono
  Lecture Notes in Computer Science 8889, 2014, pp. 208-219
• Covering problems for partial words and for indeterminate strings
  Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
  Lecture Notes in Computer Science 8889, 2014, pp. 220-232
• Dynamic interval scheduling for multiple machines
  Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu
  Lecture Notes in Computer Science 8889, 2014, pp. 235-246
• Throughput maximization in multiprocessor speed-scaling
  Eric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang
  Lecture Notes in Computer Science 8889, 2014, pp. 247-258
• Speed-scaling with no preemptions
  Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
  Lecture Notes in Computer Science 8889, 2014, pp. 259-269
• A short implicant of a CNF formula with many satisfying assignments
  Daniel M. Kane, Osamu Watanabe
  Lecture Notes in Computer Science 8889, 2014, pp. 273-284
• On the computational complexity of vertex integrity and component order connectivity
  Pål Grnås Drange, Markus Sortland Dregi, Pim van 't Hof
  Lecture Notes in Computer Science 8889, 2014, pp. 285-297
• Co-clustering under the maximum norm
  Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
  Lecture Notes in Computer Science 8889, 2014, pp. 298-309
• The price of order
  Prosenjit Bose, Pat Morin, André van Renssen
  Lecture Notes in Computer Science 8889, 2014, pp. 313-325