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 [1]	Hilfe

Suche: Series=LNCS AND Volume=2223

• 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
• Recognition and orientation algorithms for P_4-comparability graphs
  Stavros D. Nikolopoulos, Leonidas Palios
  Lecture Notes in Computer Science 2223, 2001, pp. 320-331
• 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
• A fast algorithm for enumerating bipartite perfect matchings
  Takeaki Uno
  Lecture Notes in Computer Science 2223, 2001, pp. 367-379
• 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
• Complexity of comparing hidden Markov models
  Rune B. Lyngs, Christian N.S. Pedersen
  Lecture Notes in Computer Science 2223, 2001, pp. 416-428
• DNA self-assembly for constructing 3D boxes
  Ming-Yang Kao, Vijay Ramachandran
  Lecture Notes in Computer Science 2223, 2001, pp. 429-440
• 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
• Optimization algorithms for sweeping a polygonal region with mobile guards
  Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa
  Lecture Notes in Computer Science 2223, 2001, pp. 480-492
• Approximation of a geometric set covering problem
  Sofia Kovaleva, Frits C.R. Spieksma
  Lecture Notes in Computer Science 2223, 2001, pp. 493-501
• Shortest path algorithms: Engineering aspects
  Andrew V. Goldberg
  Lecture Notes in Computer Science 2223, 2001, pp. 502-513
• Efficient algorithms for weighted colorings of series-parallel graphs
  Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 2223, 2001, pp. 514-524
• Go with the winners algorithms for cliques in random graphs
  Marcus Peinado
  Lecture Notes in Computer Science 2223, 2001, pp. 525-536
• 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
• The complexity of some basic problems for dynamic process graphs
  Andreas Jakoby, Maciej Liśkiewicz
  Lecture Notes in Computer Science 2223, 2001, pp. 562-574
• Delay optimizations in quorum consensus
  Xuemin Lin
  Lecture Notes in Computer Science 2223, 2001, pp. 575-586
• Randomized shared queues applied to distributed optimization algorithms
  Hyunyoung Lee, Jenifer L. Welch
  Lecture Notes in Computer Science 2223, 2001, pp. 587-598
• Multiprocess time queue
  Andrej Brodnik, Johan Karlsson
  Lecture Notes in Computer Science 2223, 2001, pp. 599-609