default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 13
Volume 13, May 2012
- Paolo Ciaccia
, Marco Patella:
Editorial. 1 - Vladimir Pestov:
Indexability, concentration, and VC theory. 2-18 - Jirí 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 Z. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-31 22:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
