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

• Constructing compressed suffix arrays with large alphabets
  Wing-Kai Hon, Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung
  Lecture Notes in Computer Science 2906, 2003, pp. 240-249
• On the geometric dilation of finite point sets
  Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
  Lecture Notes in Computer Science 2906, 2003, pp. 250-259
• On computing all immobilizing grasps of a simple polygon with few contacts
  Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
  Lecture Notes in Computer Science 2906, 2003, pp. 260-269
• Optimal point set projections onto regular grids
  José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, J. Antoni Sellarès
  Lecture Notes in Computer Science 2906, 2003, pp. 270-279
• An approximation algorithm for dissecting a rectangle into rectangles with specified areas
  Hiroshi Nagamochi, Yuusuke Abe
  Lecture Notes in Computer Science 2906, 2003, pp. 280-289
• A faster algorithm for two-variable integer programming
  Friedrich Eisenbrand, Sören Laue
  Lecture Notes in Computer Science 2906, 2003, pp. 290-299
• Efficient algorithms for generation of combinatorial covering suites
  Adrian Dumitrescu
  Lecture Notes in Computer Science 2906, 2003, pp. 300-308
• A better approximation for the two-machine flowshop scheduling problem with time lags
  Yoshiyuki Karuno, Hiroshi Nagamochi
  Lecture Notes in Computer Science 2906, 2003, pp. 309-318
• On minimizing average weighted completion time: A PTAS for the job shop problem with release dates
  Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
  Lecture Notes in Computer Science 2906, 2003, pp. 319-328
• Online scheduling of parallel jobs with dependencies on 2-dimensional meshes
  Deshi Ye, Guochuan Zhang
  Lecture Notes in Computer Science 2906, 2003, pp. 329-338
• Efficient algorithms for descendent subtrees comparison of phylogenetic trees with applications to co-evolutionary classifications in bacterial genome
  Yaw-Ling Lin, Tsan-Sheng Hsu
  Lecture Notes in Computer Science 2906, 2003, pp. 339-351
• Settling the intractability of multiple alignment
  Isaac Elias
  Lecture Notes in Computer Science 2906, 2003, pp. 352-363
• Efficient algorithms for optimizing whole genome alignment with noise
  T.W. Lam, N. Lu, H.F. Ting, Prudence W.H. Wong, S.M. Yiu
  Lecture Notes in Computer Science 2906, 2003, pp. 364-374
• Segmenting doughnut-shaped objects in medical images
  Xiaodong Wu
  Lecture Notes in Computer Science 2906, 2003, pp. 375-384
• On the locality properties of space-filling curves
  H.K. Dai, H.C. Su
  Lecture Notes in Computer Science 2906, 2003, pp. 385-394
• Geometric restrictions on producible polygonal protein chains
  Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
  Lecture Notes in Computer Science 2906, 2003, pp. 395-404
• Symmetric layout of disconnected graphs
  Seok-Hee Hong, Peter Eades
  Lecture Notes in Computer Science 2906, 2003, pp. 405-414
• Approximation hardness of minimum edge dominating set and minimum maximal matching
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 2906, 2003, pp. 415-424
• Enumerating global roundings of an outerplanar graph
  Nadia Takki-Chebihi, Takeshi Tokuyama
  Lecture Notes in Computer Science 2906, 2003, pp. 425-433
• Augmenting forests to meet odd diameter requirements
  Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
  Lecture Notes in Computer Science 2906, 2003, pp. 434-443
• On the existence and determination of satisfactory partitions in a graph
  Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
  Lecture Notes in Computer Science 2906, 2003, pp. 444-453
• A turn function scheme realized in the asynchronous single-writer/multi-reader shared memory model
  Tom Altman, Yoshihide Igarashi, Michiko Omori
  Lecture Notes in Computer Science 2906, 2003, pp. 454-463
• An optimal parallel algorithm for c-vertex-ranking of trees
  Md. Abul Kashem, M. Ziaur Rahman
  Lecture Notes in Computer Science 2906, 2003, pp. 464-473
• The student-project allocation problem
  David J. Abraham, Robert W. Irving, David F. Manlove
  Lecture Notes in Computer Science 2906, 2003, pp. 474-484
• Algorithms for enumerating circuits in matroids
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
  Lecture Notes in Computer Science 2906, 2003, pp. 485-494