| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph
|
Kolmogorov, Vladimir
|
|
2008
|
56 |
4 |
p. 394-412
|
artikel
|
| 2 |
An Algorithm for Minimum Cost Arc-Connectivity Orientations
|
Iwata, Satoru
|
|
2008
|
56 |
4 |
p. 437-447
|
artikel
|
| 3 |
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
|
Segev, Danny
|
|
2008
|
56 |
4 |
p. 529-549
|
artikel
|
| 4 |
Approximation Algorithms for Treewidth
|
Amir, Eyal
|
|
2008
|
56 |
4 |
p. 448-479
|
artikel
|
| 5 |
A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems
|
Fernández, Antonio
|
|
2008
|
56 |
4 |
p. 550-576
|
artikel
|
| 6 |
Bin Packing with Rejection Revisited
|
Epstein, Leah
|
|
2008
|
56 |
4 |
p. 505-528
|
artikel
|
| 7 |
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly
|
Sahu, Sudheer
|
|
2008
|
56 |
4 |
p. 480-504
|
artikel
|
| 8 |
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
|
Ishii, Toshimasa
|
|
2008
|
56 |
4 |
p. 413-436
|
artikel
|
| 9 |
On Independent Vertex Sets in Subclasses of Apple-Free Graphs
|
Brandstädt, Andreas
|
|
2008
|
56 |
4 |
p. 383-393
|
artikel
|
| 10 |
Random Matrices and Codes for the Erasure Channel
|
Studholme, Chris
|
|
2008
|
56 |
4 |
p. 605-620
|
artikel
|
| 11 |
ℓ22 Spreading Metrics for Vertex Ordering Problems
|
Charikar, Moses
|
|
2008
|
56 |
4 |
p. 577-604
|
artikel
|
Tijdschrift beschrijving