no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
|
Dobrev, Stefan |
|
2014 |
56 |
1 |
p. 197-219 |
article |
2 |
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption
|
Ebenlendr, Tomáš |
|
2013 |
56 |
1 |
p. 73-81 |
article |
3 |
Approximating Spanning Trees with Few Branches
|
Chimani, Markus |
|
2014 |
56 |
1 |
p. 181-196 |
article |
4 |
Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat
|
Shmoys, David B. |
|
2014 |
56 |
1 |
p. 96-134 |
article |
5 |
Improved Lower Bound for Online Strip Packing
|
Harren, Rolf |
|
2013 |
56 |
1 |
p. 41-72 |
article |
6 |
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
|
Zhu, Jianqiao |
|
2013 |
56 |
1 |
p. 82-95 |
article |
7 |
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
|
Brodal, Gerth Stølting |
|
2012 |
56 |
1 |
p. 22-40 |
article |
8 |
Online Results for Black and White Bin Packing
|
Balogh, János |
|
2014 |
56 |
1 |
p. 137-155 |
article |
9 |
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods
|
Dorrigiv, Reza |
|
2014 |
56 |
1 |
p. 220-250 |
article |
10 |
On Online Algorithms with Advice for the k-Server Problem
|
Renault, Marc P. |
|
2012 |
56 |
1 |
p. 3-21 |
article |
11 |
Probabilistic k-Median Clustering in Data Streams
|
Lammersen, Christiane |
|
2014 |
56 |
1 |
p. 251-290 |
article |
12 |
Some Anomalies of Farsighted Strategic Behavior
|
Bilò, Vittorio |
|
2013 |
56 |
1 |
p. 156-180 |
article |
13 |
Special Issue on Approximation and Online Algorithms
|
Solis-Oba, Roberto |
|
2014 |
56 |
1 |
p. 1-2 |
article |
14 |
Special Issue on Approximation and Online Algorithms
|
Erlebach, Thomas |
|
2014 |
56 |
1 |
p. 135-136 |
article |