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

• Paper retraction: On the hardness of embeddings between two finite metrics
  Matthew Cary, Atri Rudra, Ashish Sabharwal
  Lecture Notes in Computer Science 4596, 2007, pp. 949-949
• Finding witnesses by peeling
  Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
  Lecture Notes in Computer Science 4580, 2007, pp. 28-39
• Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
  Philip Bille, Rolf Fagerberg, Inge Li Grtz
  Lecture Notes in Computer Science 4580, 2007, pp. 52-62
• Self-normalised distance with don't cares
  Peter Clifford, Raphaël Clifford
  Lecture Notes in Computer Science 4580, 2007, pp. 63-70
• A Lempel-Ziv text index on secondary storage
  Diego Arroyuelo, Gonzalo Navarro
  Lecture Notes in Computer Science 4580, 2007, pp. 83-94
• Non-breaking similarity of genomes with gene repetitions
  Zhixiang Chen, Bin Fu, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu
  Lecture Notes in Computer Science 4580, 2007, pp. 119-130
• A new and faster method of sorting by transpositions
  Maxime Benoît-Gagné, Sylvie Hamel
  Lecture Notes in Computer Science 4580, 2007, pp. 131-141
• Deterministic length reduction: Fast convolution in sparse data and applications
  Amihood Amir, Oren Kapah, Ely Porat
  Lecture Notes in Computer Science 4580, 2007, pp. 183-194
• Two-dimensional range minimum queries
  Amihood Amir, Johannes Fischer, Moshe Lewenstein
  Lecture Notes in Computer Science 4580, 2007, pp. 286-294
• Fast and practical algorithms for computing all the runs in a string
  Gang Chen, Simon J. Puglisi, W.F. Smyth
  Lecture Notes in Computer Science 4580, 2007, pp. 307-315
• Longest common separable pattern among permutations
  Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
  Lecture Notes in Computer Science 4580, 2007, pp. 316-327
• Petri nets, discrete physics, and distributed quantum computation
  Samson Abramsky
  Lecture Notes in Computer Science 4546, 2007, pp. 1-2
• Markov decision Petri net and Markov decision well-formed net formalisms
  M. Beccuti, G. Franceschinis, S. Haddad
  Lecture Notes in Computer Science 4546, 2007, pp. 43-62
• Comparison of the expressiveness of arc, place and transition Time Petri Nets
  M. Boyer, O.H. Roux
  Lecture Notes in Computer Science 4546, 2007, pp. 63-82
• Improving static variable orders via invariants
  Gianfranco Ciardo, Gerald Lüttgen, Andy Jinqing Yu
  Lecture Notes in Computer Science 4546, 2007, pp. 83-103
• Independence of net transformations and token firing in reconfigurable place/transition systems
  Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Ulrike Prange, Claudia Ermel
  Lecture Notes in Computer Science 4546, 2007, pp. 104-123
• Inequalities from two rows of a simplex tableau
  Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
  Lecture Notes in Computer Science 4513, 2007, pp. 1-15
• Cuts for conic mixed-integer programming
  Alper Atamtürk, Vishnu Narayanan
  Lecture Notes in Computer Science 4513, 2007, pp. 16-29
• Sequential-merge facets for two-dimensional group problems
  Santanu S. Dey, Jean-Philippe P. Richard
  Lecture Notes in Computer Science 4513, 2007, pp. 30-42
• The smoothed number of Pareto optimal solutions in bicriteria integer optimization
  Rene Beier, Heiko Röglin, Berthold Vöcking
  Lecture Notes in Computer Science 4513, 2007, pp. 53-67
• New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing
  Egon Balas, Pierre Bonami
  Lecture Notes in Computer Science 4513, 2007, pp. 89-103
• Distinct triangle areas in a planar point set
  Adrian Dumitrescu, Csaba D. Tóth
  Lecture Notes in Computer Science 4513, 2007, pp. 119-129
• Scheduling with precedence constraints of low fractional dimension
  Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
  Lecture Notes in Computer Science 4513, 2007, pp. 130-144
• On integer programming and the branch-width of the constraint matrix
  William H. Cunningham, Jim Geelen
  Lecture Notes in Computer Science 4513, 2007, pp. 158-166
• Maximizing a submodular set function subject to a matroid constraint
  Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
  Lecture Notes in Computer Science 4513, 2007, pp. 182-196