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

• Minimizing maximum lateness on identical parallel batch processing machines
  Shuguang Li, Guojun Li, Shaoqiang Zhang
  Lecture Notes in Computer Science 3106, 2004, pp. 229-237
• Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain
  Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama
  Lecture Notes in Computer Science 3106, 2004, pp. 238-248
• Algorithms for point set matching with k-differences
  Tatsuya Akutsu
  Lecture Notes in Computer Science 3106, 2004, pp. 249-258
• Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon
  Hee-Kap Ahn, Peter Brass, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
  Lecture Notes in Computer Science 3106, 2004, pp. 259-267
• The Traveling Salesman Problem with few inner points
  Vladimir G. Deĭneko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
  Lecture Notes in Computer Science 3106, 2004, pp. 268-277
• A faster algorithm for the all-pairs shortest path problem and its application
  Tadao Takaoka
  Lecture Notes in Computer Science 3106, 2004, pp. 278-289
• Algorithms for the on-line quota Traveling Salesman Problem
  Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Paschos
  Lecture Notes in Computer Science 3106, 2004, pp. 290-299
• On the orthogonal drawing of outerplanar graphs
  Kumiko Nomura, Satoshi Tayu, Shuichi Ueno
  Lecture Notes in Computer Science 3106, 2004, pp. 300-308
• Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs
  Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
  Lecture Notes in Computer Science 3106, 2004, pp. 309-318
• New bounds on the number of edges in a k-map graph
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 3106, 2004, pp. 319-328
• Dynamic storage allocation and on-line colouring interval graphs
  N.S. Narayanaswamy
  Lecture Notes in Computer Science 3106, 2004, pp. 329-338
• New approximation algorithms for some dynamic storage allocation problems
  Shuai Cheng Li, Hon Wai Leong, Steven K. Quek
  Lecture Notes in Computer Science 3106, 2004, pp. 339-348
• k-center problems with minimum coverage
  Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
  Lecture Notes in Computer Science 3106, 2004, pp. 349-359
• On the extensions of Solovay-reducibility
  Xizhong Zheng, Robert Rettinger
  Lecture Notes in Computer Science 3106, 2004, pp. 360-369
• The complexity of counting solutions to systems of equations over finite semigroups
  Gustav Nordh, Peter Jonsson
  Lecture Notes in Computer Science 3106, 2004, pp. 370-379
• Computational complexity classification of partition under compaction and retraction
  Narayan Vikas
  Lecture Notes in Computer Science 3106, 2004, pp. 380-391
• One-to-many disjoint path covers in a graph with faulty elements
  Jung-Heum Park
  Lecture Notes in Computer Science 3106, 2004, pp. 392-401
• Fault-tolerant meshes with constant degree
  Toshinori Yamada
  Lecture Notes in Computer Science 3106, 2004, pp. 402-411
• Fault Hamiltonicity of meshes with two wraparound edges
  Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
  Lecture Notes in Computer Science 3106, 2004, pp. 412-421
• On the expected time for Herman's probabilistic self-stabilizing algorithm
  Toshio Nakata
  Lecture Notes in Computer Science 3106, 2004, pp. 422-431
• An efficient online algorithm for square detection
  Ho-Fung Leung, Zeshan Peng, Hing-Fung Ting
  Lecture Notes in Computer Science 3106, 2004, pp. 432-439
• An efficient local alignment algorithm for masked sequences
  Jin Wook Kim, Kunsoo Park
  Lecture Notes in Computer Science 3106, 2004, pp. 440-449
• Computing phylogenetic roots with bounded degrees and errors is hard
  Tatsuie Tsukiji, Zhi-Zhong Chen
  Lecture Notes in Computer Science 3106, 2004, pp. 450-461
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
  Jesper Jansson, Wing-Kin Sung
  Lecture Notes in Computer Science 3106, 2004, pp. 462-471