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

• On the invariants of the quotients of the Jacobian of a curve of genus 2
  P. Gaudry, É. Schost
  Lecture Notes in Computer Science 2227, 2001, pp. 373-386
• 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
• Semi-normal schedulings: Improvement on Goeman's algorithm
  Jianer Chen, Jingui Huang
  Lecture Notes in Computer Science 2223, 2001, pp. 48-60
• On min-max cycle bases
  Giulia Galbiati
  Lecture Notes in Computer Science 2223, 2001, pp. 116-123
• 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
• 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
• Parameterized complexity: The main ideas and some research frontiers
  Michael R. Fellows
  Lecture Notes in Computer Science 2223, 2001, pp. 291-307
• Tight bounds on maximal and maximum matchings
  Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
  Lecture Notes in Computer Science 2223, 2001, pp. 308-319
• Efficient algorithms for k-terminal cuts on planar graphs
  Danny Z. Chen, Xiadong Wu
  Lecture Notes in Computer Science 2223, 2001, pp. 332-344
• Polynomial time algorithms for edge-connectivity augmentation of Hamiltonian paths
  Anna Galluccio, Guido Proietti
  Lecture Notes in Computer Science 2223, 2001, pp. 345-354
• Algorithms for pattern involvement in permutations
  Michael H. Albert, Robert E.L. Aldred, Mike D. Atkinson, Derek A. Holton
  Lecture Notes in Computer Science 2223, 2001, pp. 355-366
• On-line scheduling a batch processing system to minimize total weighted job completion time
  Bo Chen, Xiaotie Deng, Wenan Zang
  Lecture Notes in Computer Science 2223, 2001, pp. 380-389
• On the complexity of train assignment problems
  Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
  Lecture Notes in Computer Science 2223, 2001, pp. 390-402
• A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model
  James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
  Lecture Notes in Computer Science 2223, 2001, pp. 403-415
• Topological peeling and implementation
  Danny Z. Chen, Shuang Luan, Jinhui Xu
  Lecture Notes in Computer Science 2223, 2001, pp. 454-466
• Image segmentation with monotonicity and smoothness constraints
  Danny Z. Chen, Jie Wang, Xiaodong Wu
  Lecture Notes in Computer Science 2223, 2001, pp. 467-479
• Complexity of partial covers of graphs
  Jiȓí Fiala, Jan Kratochvíl
  Lecture Notes in Computer Science 2223, 2001, pp. 537-549
• On game-theoretic models of networks
  Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
  Lecture Notes in Computer Science 2223, 2001, pp. 550-561
• Multiprocess time queue
  Andrej Brodnik, Johan Karlsson
  Lecture Notes in Computer Science 2223, 2001, pp. 599-609
• Small convex quadrangulations of point sets
  David Bremner, Ferran Hurtado
  Lecture Notes in Computer Science 2223, 2001, pp. 623-635
• How to color a checkerboard with a given distribution - Matrix rounding achieving low 2\times 2-discrepancy
  Tetsuo Asano, Takeshi Tokuyama
  Lecture Notes in Computer Science 2223, 2001, pp. 636-648
• Labeling subway lines
  Mari Ángeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff
  Lecture Notes in Computer Science 2223, 2001, pp. 649-659
• A modified greedy algorithm for the set cover problem with weights 1 and 2
  Toshihiro Fujito, Tsuyoshi Okumura
  Lecture Notes in Computer Science 2223, 2001, pp. 670-681
• On-line algorithms for cardinality constrained bin packing problems
  Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
  Lecture Notes in Computer Science 2223, 2001, pp. 695-706
• Computing the quartet distance between evolutionary trees in time \O(n \log^2 n)
  Gerth Stlting Brodal, Rolf Fagerberg, Christian N.S. Pedersen
  Lecture Notes in Computer Science 2223, 2001, pp. 731-742