|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An FPTAS for the parametric knapsack problem |
Holzhauser, Michael |
2017 |
126 | C |
p. 43-47 5 p. |
article |
|
| 2 | An incremental linear-time learning algorithm for the Optimum-Path Forest classifier |
Ponti, Moacir |
2017 |
126 | C |
p. 1-6 6 p. |
article |
|
| 3 | Editorial Board |
2017 |
126 | C |
p. IFC- 1 p. |
article |
||
| 4 | Issuer-free oblivious transfer with access control revisited |
Rial, Alfredo |
2017 |
126 | C |
p. 7-11 5 p. |
article |
|
| 5 | NP-hardness and inapproximability of sparse PCA |
Magdon-Ismail, Malik |
2017 |
126 | C |
p. 35-38 4 p. |
article |
|
| 6 | On the complexity and approximability of budget-constrained minimum cost flows |
Holzhauser, Michael |
2017 |
126 | C |
p. 24-29 6 p. |
article |
|
| 7 | Randomly coloring simple hypergraphs with fewer colors |
Frieze, Alan |
2017 |
126 | C |
p. 39-42 4 p. |
article |
|
| 8 | Small polyomino packing |
Brand, Michael |
2017 |
126 | C |
p. 30-34 5 p. |
article |
|
| 9 | The game total domination problem is log-complete in PSPACE |
Brešar, Boštjan |
2017 |
126 | C |
p. 12-17 6 p. |
article |
|
| 10 | Variants of k-regular nearest neighbor graph and their construction |
Broelemann, Klaus |
2017 |
126 | C |
p. 18-23 6 p. |
article |
10 results found