no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Approximation Algorithms for Connected Graph Factors of Minimum Weight
|
Cornelissen, Kamiel |
|
2016 |
62 |
2 |
p. 441-464 |
article |
2 |
Constant-Time Local Computation Algorithms
|
Mansour, Yishay |
|
2017 |
62 |
2 |
p. 249-267 |
article |
3 |
Efficient Vertex-Label Distance Oracles for Planar Graphs
|
Mozes, Shay |
|
2017 |
62 |
2 |
p. 419-440 |
article |
4 |
Geometric Hitting Set for Segments of Few Orientations
|
Fekete, Sándor P. |
|
2017 |
62 |
2 |
p. 268-303 |
article |
5 |
Maximum ATSP with Weights Zero and One via Half-Edges
|
Paluch, Katarzyna |
|
2017 |
62 |
2 |
p. 319-336 |
article |
6 |
On the Smoothness of Paging Algorithms
|
Reineke, Jan |
|
2017 |
62 |
2 |
p. 366-418 |
article |
7 |
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability
|
Ebrahimi, Roozbeh |
|
2016 |
62 |
2 |
p. 304-318 |
article |
8 |
Shortest Augmenting Paths for Online Matchings on Trees
|
Bosek, Bartłomiej |
|
2018 |
62 |
2 |
p. 337-348 |
article |
9 |
Tight Bounds for Double Coverage Against Weak Adversaries
|
Bansal, Nikhil |
|
2016 |
62 |
2 |
p. 349-365 |
article |
10 |
WAOA 2015 Special Issue on TOCS
|
Sanità, Laura |
|
2018 |
62 |
2 |
p. 247-248 |
article |