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

• Solving NP-hard combinatorial problems in the practical sense
  Toshihide Ibaraki
  Lecture Notes in Computer Science 1350, 1997, pp. 1-1
• Airline crew-scheduling problem with many irregular flights
  Akira Tajima, Shinji Misono
  Lecture Notes in Computer Science 1350, 1997, pp. 2-11
• Practical approach to a facility location problem for large-scale logistics
  Kazuyoshi Hidaka, Hiroyuki Okano
  Lecture Notes in Computer Science 1350, 1997, pp. 12-21
• Hard instance generation for SAT
  Satoshi Horie, Osamu Watanabe
  Lecture Notes in Computer Science 1350, 1997, pp. 22-31
• Playing Tetris on meshes and multi-dimensional Shearsort
  Mirosƚaw Kutyƚowski, Rolf Wanka
  Lecture Notes in Computer Science 1350, 1997, pp. 32-41
• Formulation of the addition-shift-sequence problem and its complexity
  Akihiro Matsuura, Akira Nagoya
  Lecture Notes in Computer Science 1350, 1997, pp. 42-51
• Weighted and unweighted selection algorithms for k sorted sequences
  Tatsuya Hayashi, Koji Nakano, Stephan Olariu
  Lecture Notes in Computer Science 1350, 1997, pp. 52-61
• An adaptive distributed fault-tolerant routing algorithm for the star graph
  Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda
  Lecture Notes in Computer Science 1350, 1997, pp. 62-71
• Multi-color routing in the undirected hypercube
  Qian-Ping Gu, Hisao Tamaki
  Lecture Notes in Computer Science 1350, 1997, pp. 72-81
• Competitive source routing on tori and meshes
  Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
  Lecture Notes in Computer Science 1350, 1997, pp. 82-91
• Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs
  Takeaki Uno
  Lecture Notes in Computer Science 1350, 1997, pp. 92-101
• Augmenting edge and vertex connectivities simultaneously
  Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 1350, 1997, pp. 102-111
• Two-face Horn extensions
  Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
  Lecture Notes in Computer Science 1350, 1997, pp. 112-121
• Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae
  Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
  Lecture Notes in Computer Science 1350, 1997, pp. 122-131
• Algorithmic analysis of multithreaded algorithms
  Charles E. Leiserson
  Lecture Notes in Computer Science 1350, 1997, pp. 132-132
• A characterization of planar graphs by pseudo-line arrangements
  Hisao Tamaki, Takeshi Tokuyama
  Lecture Notes in Computer Science 1350, 1997, pp. 133-142
• Optimal fault-tolerant broadcasting in trees
  Petrişor Panaite, Andrzej Pelc
  Lecture Notes in Computer Science 1350, 1997, pp. 143-152
• A theoretical framework of hybrid approaches to MAX SAT
  Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
  Lecture Notes in Computer Science 1350, 1997, pp. 153-162
• Exponential lower bounds on the size of OBDDs representing integer division
  Takashi Horiyama, Shuzo Yajima
  Lecture Notes in Computer Science 1350, 1997, pp. 163-172
• On-line versus off-line in money-making strategies with BROKERAGE
  Eisuke Dannoura, Kouichi Sakurai
  Lecture Notes in Computer Science 1350, 1997, pp. 173-182
• Decision-making by hierarchies of discordant agents
  Xiaotie Deng, Christos Papadimitriou
  Lecture Notes in Computer Science 1350, 1997, pp. 183-192
• A new efficient off-line anonymous cash scheme
  Khanh Quoc Nguyen, Vijay Varadharajan, YiMu
  Lecture Notes in Computer Science 1350, 1997, pp. 193-201
• Approximating unweighted connectivity problems in parallel
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 1350, 1997, pp. 202-211
• A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
  Chung Keung Poon, Vijaya Ramachandran
  Lecture Notes in Computer Science 1350, 1997, pp. 212-222
• Efficient parallel algorithms for planar st-graphs
  Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu
  Lecture Notes in Computer Science 1350, 1997, pp. 223-232