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

• Peg-solitaire, string rewriting systems and finite automata
  B. Ravikumar
  Lecture Notes in Computer Science 1350, 1997, pp. 233-242
• On the size of probabilistic formulae
  Hartmut Klauck
  Lecture Notes in Computer Science 1350, 1997, pp. 243-252
• Homophonic coding with logarithmic memory size
  Boris Ryabko, Andrey Fionov
  Lecture Notes in Computer Science 1350, 1997, pp. 253-262
• Complexity and modeling aspects of mesh refinement into quadrilaterals
  Rolf H. Möhring, Matthias Müller-Hannemann
  Lecture Notes in Computer Science 1350, 1997, pp. 263-272
• Topology oriented vs. exact arithmetic - Experience in implementing the three-dimensional convex Hull algorithm
  Tsuyoshi Minakawa, Kokichi Sugihara
  Lecture Notes in Computer Science 1350, 1997, pp. 273-282
• The complexity of learning branches and strategies from queries
  Matthias Ott, Frank Stephan
  Lecture Notes in Computer Science 1350, 1997, pp. 283-292
• Singularities make spatial join scheduling hard
  Gabriele Neyer, Peter Widmeyer
  Lecture Notes in Computer Science 1350, 1997, pp. 293-302
• A faster one-dimensional topological compaction algorithm
  Hsiao-Feng Chen, D.T. Lee
  Lecture Notes in Computer Science 1350, 1997, pp. 303-313
• Algorithms for finding optimal disjoint paths around a rectangle
  Wun-Tat Chan, Francis Y.L. Chin
  Lecture Notes in Computer Science 1350, 1997, pp. 314-323
• An algorithm for finding a region with the minimum total L_1 from prescribed terminals
  Yoshiyuki Kusakari, Takao Nishizeki
  Lecture Notes in Computer Science 1350, 1997, pp. 324-333
• On defect sets in bipartite graphs
  P.E. Haxell, M. Loebl
  Lecture Notes in Computer Science 1350, 1997, pp. 334-343
• Dynamic programming on distance-hereditary graphs
  Maw-Shang Chang, Sun-yuan Hsieh, Gen-Huey Chen
  Lecture Notes in Computer Science 1350, 1997, pp. 344-353
• On the equivalence in complexity among basic problems on bipartite and parity graphs
  Serafino Cicerone, Gabriele di Stefano
  Lecture Notes in Computer Science 1350, 1997, pp. 354-363
• All-cavity maximum matchings
  Ming-Yang Kao, Tak Wah Lam, Wing Kin Sung, Hing Fung Ting
  Lecture Notes in Computer Science 1350, 1997, pp. 364-373
• Fast algorithms for computing \beta-skeletons and their relatives
  S.V. Rao, Asish Mukhopadhyay
  Lecture Notes in Computer Science 1350, 1997, pp. 374-383
• A branch-and-cut approach for minimum weight triangulation
  Yoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima
  Lecture Notes in Computer Science 1350, 1997, pp. 384-393
• An efficient approximation scheme for the subset-sum problem
  Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
  Lecture Notes in Computer Science 1350, 1997, pp. 394-403
• Competitive call control in mobile networks
  Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis
  Lecture Notes in Computer Science 1350, 1997, pp. 404-413
• Generalized swap-with parent schemes for self-organizing sequential linear lists
  John Oommen, Juan Dong
  Lecture Notes in Computer Science 1350, 1997, pp. 414-423