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 YEAR=2014

• 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
• Planar matchings for weighted straight skeletons
  Therese Biedl, Stefan Huber, Peter Palfrader
  Lecture Notes in Computer Science 8889, 2014, pp. 117-127
• 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
• 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
• 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
• 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
• An FPTAS for the volume computationof 0-1 knapsack polytopes based on approximate convolution integral
  Ei Ando, Shuji Kijima
  Lecture Notes in Computer Science 8889, 2014, pp. 376-386
• Polynomial-time algorithm for sliding tokens on trees
  Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
  Lecture Notes in Computer Science 8889, 2014, pp. 389-400
• Faster existential FO model checking on posets
  Jakub Gajarský, Petr Hlinȇný, Jan Obdrz̑álek, Sebastian Ordyniak
  Lecture Notes in Computer Science 8889, 2014, pp. 441-451
• Approximation algorithms inspired by kernelization methods
  Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
  Lecture Notes in Computer Science 8889, 2014, pp. 479-490
• Tradeoff between label space and auxiliary space for representation of equivalence classes
  Hicham El-Zein, J. Ian Munro, Venkatesh Raman
  Lecture Notes in Computer Science 8889, 2014, pp. 543-552
• Depth-first search using O(n) bits
  Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
  Lecture Notes in Computer Science 8889, 2014, pp. 553-564
• Linear-time algorithms for proportional apportionment
  Zhanpeng Cheng, David Eppstein
  Lecture Notes in Computer Science 8889, 2014, pp. 581-592
• Planar embeddings with small and uniform faces
  Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
  Lecture Notes in Computer Science 8889, 2014, pp. 633-645
• Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties
  Nevzat Onur Domaniç, C. Gregory Plaxton
  Lecture Notes in Computer Science 8889, 2014, pp. 646-657