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

• Chain reconfiguration - The ins and outs, ups and downs of moving polygons and polygonal linkages
  Sue Whitesides
  Lecture Notes in Computer Science 2223, 2001, pp. 1-13
• Application of M-convex submodular flow problem to mathematical economics
  Kazuo Murota, Akihisa Tamura
  Lecture Notes in Computer Science 2223, 2001, pp. 14-25
• A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling
  Xiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu
  Lecture Notes in Computer Science 2223, 2001, pp. 26-35
• A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times
  Yoshiyuki Karuno, Hiroshi Nagamochi
  Lecture Notes in Computer Science 2223, 2001, pp. 36-47
• Semi-normal schedulings: Improvement on Goeman's algorithm
  Jianer Chen, Jingui Huang
  Lecture Notes in Computer Science 2223, 2001, pp. 48-60
• Balanced scheduling toward loss-free packet queuing and delay fairness
  Hisashi Koga
  Lecture Notes in Computer Science 2223, 2001, pp. 61-73
• Broadcasting with universal lists revisited: Using competitive analysis
  Jae-Hoon Kim, Kyung-Yong Chwa
  Lecture Notes in Computer Science 2223, 2001, pp. 74-85
• On adaptive fault diagnosis for multiprocessor systems
  Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
  Lecture Notes in Computer Science 2223, 2001, pp. 86-98
• On-line multicasting in all-optical networks
  Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
  Lecture Notes in Computer Science 2223, 2001, pp. 99-106
• Enumerating floorplans with n rooms
  Shin-ichi Nakano
  Lecture Notes in Computer Science 2223, 2001, pp. 107-115
• On min-max cycle bases
  Giulia Galbiati
  Lecture Notes in Computer Science 2223, 2001, pp. 116-123
• On the minimum local-vertex-connectivity augmentation in graphs
  Hiroshi Nagamochi, Toshimasa Ishii
  Lecture Notes in Computer Science 2223, 2001, pp. 124-135
• Counting graph isomorphisms among chordal graphs with restricted clique number
  Takayuki Nagoya
  Lecture Notes in Computer Science 2223, 2001, pp. 136-147
• Quantum algorithms for intersection and proximity problems
  Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama
  Lecture Notes in Computer Science 2223, 2001, pp. 148-159
• BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces
  Zheng Sun, John Reif
  Lecture Notes in Computer Science 2223, 2001, pp. 160-171
• Approximation of minimum triangulation for polyhedron with bounded degrees
  Francis Y.L. Chin, Stanley P.Y. Fung
  Lecture Notes in Computer Science 2223, 2001, pp. 172-184
• Tree-approximations for the weighted cost-distance problem
  Christian Schindelhauer, Birgitta Weber
  Lecture Notes in Computer Science 2223, 2001, pp. 185-195
• Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups
  Takaaki Mizuki, Takao Nishizeki
  Lecture Notes in Computer Science 2223, 2001, pp. 196-207
• Generic algorithms and key agreement protocols based on group actions
  Akihiro Yamamura, Kaoru Kurosawa
  Lecture Notes in Computer Science 2223, 2001, pp. 208-218
• Baire category and nowhere differentiability for feasible real function
  Josef M. Breutzmann, David W. Juedes, Jack H. Lutz
  Lecture Notes in Computer Science 2223, 2001, pp. 219-230
• Translation among CNF's, characteristic models and ordered binary decision diagrams
  Takashi Horiyama, Toshihide Ibaraki
  Lecture Notes in Computer Science 2223, 2001, pp. 231-243
• On removing the pushdown stack in reachability constructions
  Oscar H. Ibarra, Zhe Dang
  Lecture Notes in Computer Science 2223, 2001, pp. 244-256
• A new recognition algorithm for extended regular expressions
  Hiroaki Yamamoto
  Lecture Notes in Computer Science 2223, 2001, pp. 257-267
• Polynomial-time algorithms for the equivalence for one-way quantum finite automata
  Takeshi Koshiba
  Lecture Notes in Computer Science 2223, 2001, pp. 268-278
• An index for the data size to extract decomposable structures in LAD
  Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
  Lecture Notes in Computer Science 2223, 2001, pp. 279-290