Volume 9, Number 1, March 2011

• 
  Gregory Kucherov, Esko Ukkonen: Editorial. 1
• 
  Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA structure alignment for crossing input structures. 2-11
• 
  Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA folding: Time and space efficient algorithms. 12-31
• 
  Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf: Finding all sorting tandem duplication random loss operations. 32-48
• 
  Philip Bille: Fast searching in packed strings. 49-56
• 
  Jérémie Bourdon, Irena Rusu: Statistical properties of factor oracles. 57-66
• 
  Raphaël Clifford, Benjamin Sach: Pattern matching in pseudo real-time. 67-81
• 
  Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Complexity issues in vertex-colored graph pattern matching. 82-99
• 
  Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo: Position heaps: A simple and dynamic text indexing data structure. 100-121
• 
  Christian Hundt, Maciej Liskiewicz: New complexity bounds for image matching under rotation and scaling. 122-136
• 
  Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. 137-151

Volume 9, Number 2, June 2011

• 
  Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen: Missing pattern discovery. 153-165
• 
  Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon: Computational determination of (3, 11) and (4, 7) cages. 166-169
• 
  Johnny David, Zeev Nutov: Approximating survivable networks with β-metric costs. 170-175
• 
  Travis Gagie, Yakov Nekrich: Tight bounds for online stable sorting. 176-181
• 
  Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy: On the number of shortest descending paths on the surface of a convex terrain. 182-189
• 
  Ilya Safro, Boris Temkin: Multiscale approach for the network compression-friendly ordering. 190-202
• 
  Stephan Dominique Andres, Winfried Hochstättler: Some heuristics for the binary paint shop problem and their expected number of colour changes. 203-211

Volume 9, Number 3, September 2011

• 
  Tiziana Calamoneri, Josep Díaz: Editorial. 213
• 
  Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. 214-230
• 
  Leizhen Cai, Boting Yang: Parameterized complexity of even/odd subgraph problems. 231-240
• 
  Panagiotis Cheilaris, Géza Tóth: Graph unique-maximum and conflict-free colorings. 241-251
• 
  Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff: An exact algorithm for connected red-blue dominating set. 252-262
• 
  Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar: On strategy improvement algorithms for simple stochastic games. 263-278
• 
  Gianni Franceschini, Torben Hagerup: Finding the maximum suffix with fewer comparisons. 279-286

• 
  Prosenjit Bose, Paz Carmi, Mathieu Couture: Spanners of additively weighted point sets. 287-298
• 
  Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. 299-306
• 
  Pedro Reviriego, Lars Holst, Juan Antonio Maestro: On the expected longest length probe sequence for hashing with separate chaining. 307-312

Volume 9, Number 4, December 2011

• 
  Moshe Lewenstein, Gabriel Valiente: CPM 2006. 313

• 
  Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel: Faster algorithms for computing longest common increasing subsequences. 314-325
• 
  Carl Kingsford, Elena Zaslavsky, Mona Singh: A cost-aggregating integer linear program for motif finding. 326-334
• 
  Patricia A. Evans: Finding common RNA pseudoknot structures in polynomial time. 335-343
• 
  Michal Ozery-Flato, Ron Shamir: An O(n^3/2sqrt(log(n))) algorithm for sorting by reciprocal translocations. 344-357
• 
  Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong: A linear size index for approximate pattern matching. 358-364
• 
  Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen: Approximation of RNA multiple structural alignment. 365-376

last updated on Thu May 23 04:26:10 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page