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 YEAR=2006

• On indecomposability preserving elimination sequences
  Chandan K. Dubey, Shashank K. Mehta
  Lecture Notes in Computer Science 4112, 2006, pp. 42-51
• The complexity of black-box ring problems
  V. Arvind, Bireswar Das, Partha Mukhopadhyay
  Lecture Notes in Computer Science 4112, 2006, pp. 126-135
• The matrix orthogonal decomposition problem in intensity-modulated radiation therapy
  Xin Dou, Xiaodong Wu, John E. Bayouth, John M. Buatti
  Lecture Notes in Computer Science 4112, 2006, pp. 156-165
• A polynomial-time approximation algorithm for a geometric dispersion problem
  Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff
  Lecture Notes in Computer Science 4112, 2006, pp. 166-175
• A PTAS for cutting out polygons with lines
  Sergey Bereg, Ovidiu Daescu, Minghui Jiang
  Lecture Notes in Computer Science 4112, 2006, pp. 176-185
• Restricted mesh simplification using edge contractions
  Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
  Lecture Notes in Computer Science 4112, 2006, pp. 196-204
• Enumerating non-crossing minimally rigid frameworks
  David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 4112, 2006, pp. 205-215
• Reconciling gene trees with apparent polytomies
  Wen-Chieh Chang, Oliver Eulenstein
  Lecture Notes in Computer Science 4112, 2006, pp. 235-244
• Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes
  Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu
  Lecture Notes in Computer Science 4112, 2006, pp. 245-254
• Computing maximum-scoring segments in almost linear time
  Fredrik Bengtsson, Jingsen Chen
  Lecture Notes in Computer Science 4112, 2006, pp. 255-264
• On dynamic bin packing: An improved lower bound and resource augmentation analysis
  Wun-Tat Chan, Prudence W.H. Wong, Fencol C.C. Yung
  Lecture Notes in Computer Science 4112, 2006, pp. 309-319
• A rigorous analysis for set-up time models - A metric perspective
  Eitan Bachmat, Tao Kai Lam, Avner Magen
  Lecture Notes in Computer Science 4112, 2006, pp. 387-397
• Geometric representation of graphs in low dimension
  L. Sunil Chandran, Naveen Sivadasan
  Lecture Notes in Computer Science 4112, 2006, pp. 398-407
• The on-line Heilbronn's triangle problem in d dimensions
  Gill Barequet, Alina Shaikhet
  Lecture Notes in Computer Science 4112, 2006, pp. 408-417
• Counting d-dimensional polycubes and nonrectangular planar polyominoes
  Gadi Aleksandrowicz, Gill Barequet
  Lecture Notes in Computer Science 4112, 2006, pp. 418-427
• Approximating min-max (regret) versions of some polynomial problems
  Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
  Lecture Notes in Computer Science 4112, 2006, pp. 428-438
• Bimodal crossing minimization
  Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
  Lecture Notes in Computer Science 4112, 2006, pp. 497-506
• Fixed linear crossing minimization by reduction to the maximum cut problem
  Christoph Buchheim, Lanbo Zheng
  Lecture Notes in Computer Science 4112, 2006, pp. 507-516
• On the effectiveness of the linear programming relaxation of the 0-1 multi-commodity minimum cost network flow problem
  Dae-Sik Choi, In-Chan Choi
  Lecture Notes in Computer Science 4112, 2006, pp. 517-526
• Computing pro-P Galois groups
  Nigel Boston, Harris Nover
  Lecture Notes in Computer Science 4076, 2006, pp. 1-10
• The elliptic curve database for conductors to 130000
  John Cremona
  Lecture Notes in Computer Science 4076, 2006, pp. 11-29
• An algorithm for computing p-class groups of Abelian number fields
  Miho Aoki, Takashi Fukuda
  Lecture Notes in Computer Science 4076, 2006, pp. 56-71
• Computation of locally free class groups
  Werner Bley, Robert Boltje
  Lecture Notes in Computer Science 4076, 2006, pp. 72-86
• On the density of sums of three cubes
  Jean-Marc Deshouillers, François Hennecart, Bernard Landreau
  Lecture Notes in Computer Science 4076, 2006, pp. 141-155
• Practical lattice basis sampling reduction
  Johannes Buchmann, Christoph Ludwig
  Lecture Notes in Computer Science 4076, 2006, pp. 222-237