nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems
|
Broersma, |
|
Inc. |
32 |
4 |
p. 594-610 |
artikel |
2 |
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems
|
Broersma, |
|
2001 |
32 |
4 |
p. 594-610 |
artikel |
3 |
Algorithmic Aspects of Acyclic Edge Colorings
|
Alon, |
|
Inc. |
32 |
4 |
p. 611-614 |
artikel |
4 |
Algorithmic Aspects of Acyclic Edge Colorings
|
Alon, |
|
2001 |
32 |
4 |
p. 611-614 |
artikel |
5 |
An Online Algorithm for the Dynamic Maximal Dense Tree Problem
|
Awerbuch, |
|
Inc. |
32 |
4 |
p. 540-553 |
artikel |
6 |
An Online Algorithm for the Dynamic Maximal Dense Tree Problem
|
Awerbuch, |
|
2001 |
32 |
4 |
p. 540-553 |
artikel |
7 |
Approximations for a Bottleneck Steiner Tree Problem
|
Wang, |
|
Inc. |
32 |
4 |
p. 554-561 |
artikel |
8 |
Approximations for a Bottleneck Steiner Tree Problem
|
Wang, |
|
2001 |
32 |
4 |
p. 554-561 |
artikel |
9 |
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart
|
Schöning, |
|
Inc. |
32 |
4 |
p. 615-623 |
artikel |
10 |
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart
|
Schöning, |
|
2001 |
32 |
4 |
p. 615-623 |
artikel |
11 |
Corrigendum Static Frequency Assignment in Cellular Networks
|
Narayanan, |
|
Inc. |
32 |
4 |
p. 679 |
artikel |
12 |
Corrigendum Static Frequency Assignment in Cellular Networks
|
Narayanan, |
|
2001 |
32 |
4 |
p. 679 |
artikel |
13 |
Delayed Binary Search, or Playing Twenty Questions with a Procrastinator
|
Ambainis, |
|
Inc. |
32 |
4 |
p. 641-651 |
artikel |
14 |
Delayed Binary Search, or Playing Twenty Questions with a Procrastinator
|
Ambainis, |
|
2001 |
32 |
4 |
p. 641-651 |
artikel |
15 |
Distributed and On-Line Routing on Tori
|
Yeh, Tzuoo-Hawn |
|
Inc. |
32 |
4 |
p. 562-593 |
artikel |
16 |
Distributed and On-Line Routing on Tori
|
Yeh, Tzuoo-Hawn |
|
2001 |
32 |
4 |
p. 562-593 |
artikel |
17 |
Improved Algorithms for Uniform Partitions of Points
|
Agarwal, |
|
Inc. |
32 |
4 |
p. 521-539 |
artikel |
18 |
Improved Algorithms for Uniform Partitions of Points
|
Agarwal, |
|
2001 |
32 |
4 |
p. 521-539 |
artikel |
19 |
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints
|
Shachnai, |
|
Inc. |
32 |
4 |
p. 651-678 |
artikel |
20 |
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints
|
Shachnai, |
|
2001 |
32 |
4 |
p. 651-678 |
artikel |
21 |
Randomized Weighted Caching with Two Page Weights
|
Irani, |
|
Inc. |
32 |
4 |
p. 624-640 |
artikel |
22 |
Randomized Weighted Caching with Two Page Weights
|
Irani, |
|
2001 |
32 |
4 |
p. 624-640 |
artikel |