Volume 13, May 2012

• 
  Paolo Ciaccia, Marco Patella: Editorial. 1
• 
  Vladimir Pestov: Indexability, concentration, and VC theory. 2-18
• 
  Jiri Novák, Tomás Skopal, David Hoksza, Jakub Lokoc: Non-metric similarity search of tandem mass spectra including posttranslational modifications. 19-31
• 
  Rui Mao, Willard L. Miranker, Daniel P. Miranker: Pivot selection: Dimension reduction for distance-based indexing. 32-46

• 
  Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo: An algorithm for finding input-output constrained convex sets in an acyclic digraph. 47-58
• 
  Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Improved approximation bounds for the Student-Project Allocation problem with preferences over projects. 59-66
• 
  Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann: Approximating vertex cover in dense hypergraphs. 67-77
• 
  Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary: Largest inscribed rectangles in convex polygons. 78-85
• 
  Senjuti Basu Roy, Gautam Das, Sajal K. Das: Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field. 86-97

last updated on Wed May 22 05:53:41 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page