| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments
|
Liu, Pangfeng
|
|
2007
|
53 |
3 |
p. 425-453
|
artikel
|
| 2 |
Approximability of Minimum AND-Circuits
|
Arpe, Jan
|
|
2007
|
53 |
3 |
p. 337-357
|
artikel
|
| 3 |
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design
|
Chen, Xujin
|
|
2007
|
53 |
3 |
p. 263-297
|
artikel
|
| 4 |
Fast Algorithms for the Density Finding Problem
|
Lee, D. T.
|
|
2007
|
53 |
3 |
p. 298-313
|
artikel
|
| 5 |
Minimum Weakly Fundamental Cycle Bases Are Hard To Find
|
Rizzi, Romeo
|
|
2007
|
53 |
3 |
p. 402-424
|
artikel
|
| 6 |
Nondeterministic Graph Searching: From Pathwidth to Treewidth
|
Fomin, Fedor V.
|
|
2007
|
53 |
3 |
p. 358-373
|
artikel
|
| 7 |
Real Two Dimensional Scaled Matching
|
Amir, Amihood
|
|
2007
|
53 |
3 |
p. 314-336
|
artikel
|
| 8 |
Sorting Networks of Logarithmic Depth, Further Simplified
|
Seiferas, Joel
|
|
2007
|
53 |
3 |
p. 374-384
|
artikel
|
| 9 |
Variable Sized Online Interval Coloring with Bandwidth
|
Epstein, Leah
|
|
2007
|
53 |
3 |
p. 385-401
|
artikel
|
Tijdschrift beschrijving