| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms
|
Koutsoupias, Elias
|
|
2012
|
66 |
1 |
p. 211-223
|
artikel
|
| 2 |
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
|
Baswana, Surender
|
|
2012
|
66 |
1 |
p. 18-50
|
artikel
|
| 3 |
Donation Center Location Problem
|
Huang, Chien-Chung
|
|
2012
|
66 |
1 |
p. 187-210
|
artikel
|
| 4 |
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
|
Cicerone, Serafino
|
|
2012
|
66 |
1 |
p. 51-86
|
artikel
|
| 5 |
Fast Maximal Cliques Enumeration in Sparse Graphs
|
Chang, Lijun
|
|
2012
|
66 |
1 |
p. 173-186
|
artikel
|
| 6 |
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
|
Koufogiannakis, Christos
|
|
2012
|
66 |
1 |
p. 113-152
|
artikel
|
| 7 |
Isotonic Regression via Partitioning
|
Stout, Quentin F.
|
|
2012
|
66 |
1 |
p. 93-112
|
artikel
|
| 8 |
Maximum Matching in Regular and Almost Regular Graphs
|
Yuster, Raphael
|
|
2012
|
66 |
1 |
p. 87-92
|
artikel
|
| 9 |
Negative Interactions in Irreversible Self-assembly
|
Doty, David
|
|
2012
|
66 |
1 |
p. 153-172
|
artikel
|
| 10 |
Tile Complexity of Approximate Squares
|
Chandran, Harish
|
|
2012
|
66 |
1 |
p. 1-17
|
artikel
|
Tijdschrift beschrijving