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

• Simple real-time constant-space string matching
  Dany Breslauer, Roberto Grossi, Filippo Mignosi
  Lecture Notes in Computer Science 6661, 2011, pp. 173-183
• Space lower bounds for online pattern matching
  Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
  Lecture Notes in Computer Science 6661, 2011, pp. 184-196
• Lightweight BWT construction for very large string collections
  Markus J. Bauer, Anthony J. Cox, Giovanna Rosone
  Lecture Notes in Computer Science 6661, 2011, pp. 219-231
• On the weak prefix-search problem
  Paolo Ferragina
  Lecture Notes in Computer Science 6661, 2011, pp. 261-272
• LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
  Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
  Lecture Notes in Computer Science 6661, 2011, pp. 285-298
• Substring range reporting
  Philip Bille, Inge Li Grtz
  Lecture Notes in Computer Science 6661, 2011, pp. 299-308
• Tractability and approximability of maximal strip recovery
  Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
  Lecture Notes in Computer Science 6661, 2011, pp. 336-349
• Efficient seeds computation revisited
  Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Waleń
  Lecture Notes in Computer Science 6661, 2011, pp. 350-363
• Efficient matching of biological sequences allowing for non-overlapping inversions
  Domenico Cantone, Salvatore Cristofaro, Simone Faro
  Lecture Notes in Computer Science 6661, 2011, pp. 364-375
• Finding approximate and constrained motifs in graphs
  Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
  Lecture Notes in Computer Science 6661, 2011, pp. 388-401
• Approximation algorithms for orienting mixed graphs
  Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
  Lecture Notes in Computer Science 6661, 2011, pp. 416-428
• Polynomial-time approximation algorithms for weighted LCS problem
  Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
  Lecture Notes in Computer Science 6661, 2011, pp. 455-466
• Restricted common superstring and restricted common supersequence
  Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
  Lecture Notes in Computer Science 6661, 2011, pp. 467-478
• An excluded minor characterization of Seymour graphs
  Alexander Ageev, Yohann Benchetrit, András Sebŏ, Zoltán Szigeti
  Lecture Notes in Computer Science 6655, 2011, pp. 1-13
• Complexity analyses of Bienstock-Zuckerberg and Lasserre relaxations on the matching and stable set polytopes
  Yu Hin Au, Levent Tunçel
  Lecture Notes in Computer Science 6655, 2011, pp. 14-26
• A probabilistic analysis of the strength of the split and triangle closures
  Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
  Lecture Notes in Computer Science 6655, 2011, pp. 27-38
• Partial convexification of general MIPs by Dantzig-Wolfe reformulation
  Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi
  Lecture Notes in Computer Science 6655, 2011, pp. 39-51
• Lift-and-project cuts for mixed integer convex programs
  Pierre Bonami
  Lecture Notes in Computer Science 6655, 2011, pp. 52-64
• TSP on cubic and subcubic graphs
  Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
  Lecture Notes in Computer Science 6655, 2011, pp. 65-77
• Approximability of capacitated network design
  Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
  Lecture Notes in Computer Science 6655, 2011, pp. 78-91
• Facility location with client latencies: Linear programming based techniques for minimum latency problems
  Deeparnab Chakrabarty, Chaitanya Swamy
  Lecture Notes in Computer Science 6655, 2011, pp. 92-103
• An exact rational mixed-integer programming solver
  William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
  Lecture Notes in Computer Science 6655, 2011, pp. 104-116
• Valid inequalities for the pooling problem with binary variables
  Claudia D'Ambrosio, Jeff Linderoth, James Luedtke
  Lecture Notes in Computer Science 6655, 2011, pp. 117-129
• On the Chvátal-Gomory closure of a compact convex set
  Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
  Lecture Notes in Computer Science 6655, 2011, pp. 130-142
• Design and verify: A new scheme for generating cutting-planes
  Santanu S. Dey, Sebastian Pokutta
  Lecture Notes in Computer Science 6655, 2011, pp. 143-155