|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
7 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Advice Complexity of Priority Algorithms |
Borodin, Allan |
|
64 | 4 |
p. 593-625 |
article |
|
| 2 | An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals |
Chang, Minjun |
|
64 | 4 |
p. 645-661 |
article |
|
| 3 | Approximating Node-Weighted k-MST on Planar Graphs |
Byrka, Jarosław |
|
64 | 4 |
p. 626-644 |
article |
|
| 4 | Correction to: Special Issue on Approximation and Online Algorithms |
Epstein, Leah |
|
64 | 4 |
p. 571 |
article |
|
| 5 | Deterministic Min-Cost Matching with Delays |
Azar, Yossi |
|
64 | 4 |
p. 572-592 |
article |
|
| 6 | Longest Increasing Subsequence under Persistent Comparison Errors |
Geissmann, Barbara |
|
64 | 4 |
p. 662-680 |
article |
|
| 7 | Special Issue on Approximation and Online Algorithms |
Epstein, Leah |
|
64 | 4 |
p. 569-570 |
article |
7 results found