|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Editorial Board |
2006 |
72 | 5 |
p. CO2- 1 p. |
article |
||
| 2 | Extractors from Reed–Muller codes |
Ta-Shma, Amnon |
2006 |
72 | 5 |
p. 786-812 27 p. |
article |
|
| 3 | Fully dynamic all pairs shortest paths with real edge weights |
Demetrescu, Camil |
2006 |
72 | 5 |
p. 813-837 25 p. |
article |
|
| 4 | Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems |
Fleischer, Lisa |
2006 |
72 | 5 |
p. 838-867 30 p. |
article |
|
| 5 | [No title] |
Charikar, Moses |
2006 |
72 | 5 |
p. 785- 1 p. |
article |
|
| 6 | On the severity of Braess's Paradox: Designing networks for selfish users is hard |
Roughgarden, Tim |
2006 |
72 | 5 |
p. 922-953 32 p. |
article |
|
| 7 | Papers to appear in forthcoming issues |
2006 |
72 | 5 |
p. 954- 1 p. |
article |
||
| 8 | Planar graphs, negative weight edges, shortest paths, and near linear time |
Fakcharoenphol, Jittat |
2006 |
72 | 5 |
p. 868-889 22 p. |
article |
|
| 9 | Ramsey-type theorems for metric spaces with applications to online problems |
Bartal, Yair |
2006 |
72 | 5 |
p. 890-921 32 p. |
article |
9 results found