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 [2]	Hilfe

Suche: Series=LNCS AND Volume=5369

• Constant-working-space algorithms: How fast can we solve problems without using any extra array?
  Tetsuo Asano
  Lecture Notes in Computer Science 5369, 2008, pp. 1-1
• Some constrained notions of planarity
  Peter Eades
  Lecture Notes in Computer Science 5369, 2008, pp. 2-2
• Reachability problems on directed graphs
  Robert E. Tarjan
  Lecture Notes in Computer Science 5369, 2008, pp. 3-3
• Greedy construction of 2-approximation minimum Manhattan network
  Zeyu Guo, He Sun, Hong Zhu
  Lecture Notes in Computer Science 5369, 2008, pp. 4-15
• The complexity of minimum convex coloring
  Frank Kammer, Torsten Tholey
  Lecture Notes in Computer Science 5369, 2008, pp. 16-27
• On the complexity of reconfiguration problems
  Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
  Lecture Notes in Computer Science 5369, 2008, pp. 28-39
• Multiobjective disk cover admits a PTAS
  Christian Glaßer, Christian Reitwießner, Heinz Schmitz
  Lecture Notes in Computer Science 5369, 2008, pp. 40-51
• Data stream algorithms via expander graphs
  Sumit Ganguly
  Lecture Notes in Computer Science 5369, 2008, pp. 52-63
• Improving the competitive ratio of the online OVSF code assignment problem
  Shuichi Miyazaki, Kazuya Okamoto
  Lecture Notes in Computer Science 5369, 2008, pp. 64-76
• Optimal key tree structure for deleting two or more leaves
  Weiwei Wu, Minming Li, Enhong Chen
  Lecture Notes in Computer Science 5369, 2008, pp. 77-88
• Comparing first-fit and next-fit for online edge coloring
  Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
  Lecture Notes in Computer Science 5369, 2008, pp. 89-99
• Selecting sums in arrays
  Gerth Stlting Brodal, Allan Jrgensen
  Lecture Notes in Computer Science 5369, 2008, pp. 100-111
• Succinct and I/O efficient data structures for traversal in trees
  Craig Dillabaugh, Meng He, Anil Maheshwari
  Lecture Notes in Computer Science 5369, 2008, pp. 112-123
• Space-time tradeoffs for longest-common-prefix array computation
  Simon J. Puglisi, Andrew Turpin
  Lecture Notes in Computer Science 5369, 2008, pp. 124-135
• Power domination in O^*(1.7548^n) using reference search trees
  Daniel Raible, Henning Fernau
  Lecture Notes in Computer Science 5369, 2008, pp. 136-147
• The isolation game: A game of distances
  Yingchao Zhao, Wei Chen, Shang-Hua Teng
  Lecture Notes in Computer Science 5369, 2008, pp. 148-158
• On a non-cooperative model for wavelength assignment in multifiber optical networks
  Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
  Lecture Notes in Computer Science 5369, 2008, pp. 159-170
• The complexity of rationalizing matchings
  Shankar Kalyanaraman, Christopher Umans
  Lecture Notes in Computer Science 5369, 2008, pp. 171-182
• A game theoretic approach for efficient graph coloring
  Panagiota N. Panagopoulou, Paul G. Spirakis
  Lecture Notes in Computer Science 5369, 2008, pp. 183-195
• Partitioning a weighted tree to subtrees of almost uniform size
  Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 5369, 2008, pp. 196-207
• An improved divide-and-conquer algorithm for finding all minimum k-way cuts
  Mingyu Xiao
  Lecture Notes in Computer Science 5369, 2008, pp. 208-219
• On the algorithmic effectiveness of digraph decompositions and complexity measures
  Michael Lampis, Georgia Kaouri, Valia Mitsou
  Lecture Notes in Computer Science 5369, 2008, pp. 220-231
• An efficient scaling algorithm for the minimum weight bibranching problem
  Maxim A. Babenko
  Lecture Notes in Computer Science 5369, 2008, pp. 232-245
• The balanced edge cover problem
  Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
  Lecture Notes in Computer Science 5369, 2008, pp. 246-257
• Firefighting on trees: (1 - 1/ e)-approximation, fixed parameter tractability and a subexponential algorithm
  Leizhen Cai, Elad Verbin, Lin Yang
  Lecture Notes in Computer Science 5369, 2008, pp. 258-269