| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
|
Solis-Oba, Roberto
|
|
2015
|
77 |
2 |
p. 374-388
|
artikel
|
| 2 |
An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree
|
Wang, Hung-Lung
|
|
2015
|
77 |
2 |
p. 426-439
|
artikel
|
| 3 |
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
|
Aschner, Rom
|
|
2015
|
77 |
2 |
p. 349-373
|
artikel
|
| 4 |
Certifying 3-Edge-Connectivity
|
Mehlhorn, Kurt
|
|
2015
|
77 |
2 |
p. 309-335
|
artikel
|
| 5 |
Compressed Subsequence Matching and Packed Tree Coloring
|
Bille, Philip
|
|
2015
|
77 |
2 |
p. 336-348
|
artikel
|
| 6 |
Computing Approximate Nash Equilibria in Polymatrix Games
|
Deligkas, Argyrios
|
|
2015
|
77 |
2 |
p. 487-514
|
artikel
|
| 7 |
Improved Approximation Algorithms for Projection Games
|
Manurangsi, Pasin
|
|
2015
|
77 |
2 |
p. 555-594
|
artikel
|
| 8 |
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing
|
Lee, Troy
|
|
2015
|
77 |
2 |
p. 459-486
|
artikel
|
| 9 |
Improved Subquadratic 3SUM
|
Freund, Ari
|
|
2015
|
77 |
2 |
p. 440-458
|
artikel
|
| 10 |
Max-Throughput for (Conservative) k-of-n Testing
|
Hellerstein, Lisa
|
|
2015
|
77 |
2 |
p. 595-618
|
artikel
|
| 11 |
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
|
Anand, S.
|
|
2015
|
77 |
2 |
p. 515-536
|
artikel
|
| 12 |
Resilient Dynamic Programming
|
Caminiti, Saverio
|
|
2015
|
77 |
2 |
p. 389-425
|
artikel
|
| 13 |
Tight Bounds for Active Self-Assembly Using an Insertion Primitive
|
Hescott, Benjamin
|
|
2015
|
77 |
2 |
p. 537-554
|
artikel
|
Tijdschrift beschrijving