| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
|
Basu Roy, Senjuti
|
|
2012
|
13 |
C |
p. 86-97
12 p.
|
article
|
| 2 |
An algorithm for finding input–output constrained convex sets in an acyclic digraph
|
Gutin, G.
|
|
2012
|
13 |
C |
p. 47-58
12 p.
|
article
|
| 3 |
Approximating vertex cover in dense hypergraphs
|
Cardinal, Jean
|
|
2012
|
13 |
C |
p. 67-77
11 p.
|
article
|
| 4 |
Editorial
|
Ciaccia, Paolo
|
|
2012
|
13 |
C |
p. 1-
1 p.
|
article
|
| 5 |
Editorial Board
|
|
|
2012
|
13 |
C |
p. iii-iv
nvt p.
|
article
|
| 6 |
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects
|
Iwama, Kazuo
|
|
2012
|
13 |
C |
p. 59-66
8 p.
|
article
|
| 7 |
Indexability, concentration, and VC theory
|
Pestov, Vladimir
|
|
2012
|
13 |
C |
p. 2-18
17 p.
|
article
|
| 8 |
Largest inscribed rectangles in convex polygons
|
Knauer, Christian
|
|
2012
|
13 |
C |
p. 78-85
8 p.
|
article
|
| 9 |
Non-metric similarity search of tandem mass spectra including posttranslational modifications
|
Novák, Jiří
|
|
2012
|
13 |
C |
p. 19-31
13 p.
|
article
|
| 10 |
Pivot selection: Dimension reduction for distance-based indexing
|
Mao, Rui
|
|
2012
|
13 |
C |
p. 32-46
15 p.
|
article
|
Journal description