| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A better list heuristic for vertex cover
|
Delbot, François
|
|
2008
|
|
3-4 |
p. 125-127
3 p.
|
artikel
|
| 2 |
A conservative scheme for parallel interval narrowing
|
Granvilliers, Laurent
|
|
2000
|
|
3-4 |
p. 141-146
6 p.
|
artikel
|
| 3 |
A fast cost scaling algorithm for submodular flow
|
Iwata, Satoru
|
|
2000
|
|
3-4 |
p. 123-128
6 p.
|
artikel
|
| 4 |
A fast modular multiplication algorithm for calculating the product AB modulo N
|
Chen, Chien-Yuan
|
|
1999
|
|
3-4 |
p. 77-81
5 p.
|
artikel
|
| 5 |
A general method to speed up fixed-parameter-tractable algorithms
|
Niedermeier, Rolf
|
|
2000
|
|
3-4 |
p. 125-129
5 p.
|
artikel
|
| 6 |
A matched approximation bound for the sum of a greedy coloring
|
Bar-Noy, Amotz
|
|
1999
|
|
3-4 |
p. 135-140
6 p.
|
artikel
|
| 7 |
Amplification of slight probabilistic advantage at absolutely no cost in space
|
Macarie, Ioan I.
|
|
1999
|
|
3-4 |
p. 113-118
6 p.
|
artikel
|
| 8 |
A necessary condition for Constructive Negation in Constraint Logic Programming
|
Dovier, Agostino
|
|
2000
|
|
3-4 |
p. 147-156
10 p.
|
artikel
|
| 9 |
An efficient method to generate feasible paths for basis path testing
|
Yan, Jun
|
|
2008
|
|
3-4 |
p. 87-92
6 p.
|
artikel
|
| 10 |
An efficient upper bound of the rotation distance of binary trees
|
Pallo, Jean
|
|
2000
|
|
3-4 |
p. 87-92
6 p.
|
artikel
|
| 11 |
An improved heuristic for “Ulam–Rényi game”
|
Cicalese, Ferdinando
|
|
2000
|
|
3-4 |
p. 119-124
6 p.
|
artikel
|
| 12 |
An interesting way to partition a number
|
Bhatt, P.C.P.
|
|
1999
|
|
3-4 |
p. 141-148
8 p.
|
artikel
|
| 13 |
An optimal layout of multigrid networks
|
Calamoneri, Tiziana
|
|
1999
|
|
3-4 |
p. 137-141
5 p.
|
artikel
|
| 14 |
A note on cyclic-cubes
|
Hwang, Shien-Ching
|
|
1999
|
|
3-4 |
p. 131-135
5 p.
|
artikel
|
| 15 |
An O(|V|2) algorithm for single connectedness
|
Khuller, Samir
|
|
1999
|
|
3-4 |
p. 105-107
3 p.
|
artikel
|
| 16 |
A one-to-one correspondence between a class of leftist trees and binary trees
|
Kemp, Rainer
|
|
1999
|
|
3-4 |
p. 97-105
9 p.
|
artikel
|
| 17 |
Approximating k-hop minimum spanning trees in Euclidean metrics
|
Laue, Sören
|
|
2008
|
|
3-4 |
p. 96-101
6 p.
|
artikel
|
| 18 |
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities
|
Caprara, Alberto
|
|
2000
|
|
3-4 |
p. 111-118
8 p.
|
artikel
|
| 19 |
A relaxation of Havel's 3-color problem
|
Montassier, Mickaël
|
|
2008
|
|
3-4 |
p. 107-109
3 p.
|
artikel
|
| 20 |
A simple bivalency proof that t-resilient consensus requires t+1 rounds
|
Aguilera, Marcos Kawazoe
|
|
1999
|
|
3-4 |
p. 155-158
4 p.
|
artikel
|
| 21 |
Computing two penetration measures for curved 2D objects
|
Sridharan, K.
|
|
1999
|
|
3-4 |
p. 143-148
6 p.
|
artikel
|
| 22 |
Conditional fault Hamiltonicity of the complete graph
|
Fu, Jung-Sheng
|
|
2008
|
|
3-4 |
p. 110-113
4 p.
|
artikel
|
| 23 |
Confusion of memory
|
Moss, Lawrence S.
|
|
2008
|
|
3-4 |
p. 114-119
6 p.
|
artikel
|
| 24 |
1 , 2 Conjecture—the multiplicative version
|
Skowronek-Kaziów, Joanna
|
|
2008
|
|
3-4 |
p. 93-95
3 p.
|
artikel
|
| 25 |
Cryptanalysis of YCN key assignment scheme in a hierarchy
|
Hwang, Min-Shiang
|
|
2000
|
|
3-4 |
p. 97-101
5 p.
|
artikel
|
| 26 |
Editorial Board
|
|
|
2008
|
|
3-4 |
p. IFC-
1 p.
|
artikel
|
| 27 |
Estimating the number of vertices of a polyhedron
|
Avis, David
|
|
2000
|
|
3-4 |
p. 137-143
7 p.
|
artikel
|
| 28 |
Fast practical multi-pattern matching
|
Crochemore, Maxime
|
|
1999
|
|
3-4 |
p. 107-113
7 p.
|
artikel
|
| 29 |
Fault-containing self-stabilization using priority scheduling
|
Ghosh, Sukumar
|
|
2000
|
|
3-4 |
p. 145-151
7 p.
|
artikel
|
| 30 |
Finding and counting small induced subgraphs efficiently
|
Kloks, Ton
|
|
2000
|
|
3-4 |
p. 115-121
7 p.
|
artikel
|
| 31 |
Generating all maximal models of a Boolean expression
|
Kavvadias, Dimitris J.
|
|
2000
|
|
3-4 |
p. 157-162
6 p.
|
artikel
|
| 32 |
Hamming weights of correlation immune Boolean functions
|
Maitra, Subhamoy
|
|
1999
|
|
3-4 |
p. 149-153
5 p.
|
artikel
|
| 33 |
Hierarchical broadcast and gossip networks
|
Fertin, Guillaume
|
|
2000
|
|
3-4 |
p. 131-136
6 p.
|
artikel
|
| 34 |
Honeycomb tori are Hamiltonian
|
Megson, G.M.
|
|
1999
|
|
3-4 |
p. 99-103
5 p.
|
artikel
|
| 35 |
How to prevent interaction of functional and inclusion dependencies
|
Levene, Mark
|
|
1999
|
|
3-4 |
p. 115-125
11 p.
|
artikel
|
| 36 |
Minimum-perimeter enclosures
|
Mitchell, Joseph S.B.
|
|
2008
|
|
3-4 |
p. 120-124
5 p.
|
artikel
|
| 37 |
On 3-choosability of planar graphs without certain cycles
|
Zhang, Haihui
|
|
2008
|
|
3-4 |
p. 102-106
5 p.
|
artikel
|
| 38 |
On distribution properties of sequences with perfect linear complexity profile
|
Schneider, Markus
|
|
2000
|
|
3-4 |
p. 175-182
8 p.
|
artikel
|
| 39 |
On finding medians of weighted discrete points
|
Chung, Kuo-Liang
|
|
2000
|
|
3-4 |
p. 103-106
4 p.
|
artikel
|
| 40 |
On the computational structure of the connected components of a hard problem
|
Matamala, Martin
|
|
1999
|
|
3-4 |
p. 83-90
8 p.
|
artikel
|
| 41 |
On the isomorphism of expressions
|
Ramnath, Sarnath
|
|
2000
|
|
3-4 |
p. 97-102
6 p.
|
artikel
|
| 42 |
On the security of a convertible group signature scheme
|
Saeednia, Shahrokh
|
|
2000
|
|
3-4 |
p. 93-96
4 p.
|
artikel
|
| 43 |
Patchworks and metablocks enumeration
|
Ravelomanana, Vlady
|
|
2000
|
|
3-4 |
p. 77-86
10 p.
|
artikel
|
| 44 |
Path-based depth-first search for strong and biconnected components
|
Gabow, Harold N.
|
|
2000
|
|
3-4 |
p. 107-114
8 p.
|
artikel
|
| 45 |
Random 2-SAT and unsatisfiability
|
Verhoeven, Yann
|
|
1999
|
|
3-4 |
p. 119-123
5 p.
|
artikel
|
| 46 |
Recognizing cographs and threshold graphs through a classification of their edges
|
Nikolopoulos, Stavros D.
|
|
2000
|
|
3-4 |
p. 129-139
11 p.
|
artikel
|
| 47 |
Restricted failure detectors: Definition and reduction protocols
|
Raynal, Michel
|
|
1999
|
|
3-4 |
p. 91-97
7 p.
|
artikel
|
| 48 |
Statistical delay analysis on an ATM switch with self-similar input traffic
|
Ng, Joseph Kee-Yin
|
|
2000
|
|
3-4 |
p. 163-173
11 p.
|
artikel
|
| 49 |
Task migration in 2D wormhole-routed mesh multicomputers
|
Chen, Tzung-Shi
|
|
2000
|
|
3-4 |
p. 103-110
8 p.
|
artikel
|
| 50 |
The complexity of some complementation problems
|
Plaisted, David A.
|
|
1999
|
|
3-4 |
p. 159-165
7 p.
|
artikel
|
| 51 |
The connection between two ways of reasoning about partial functions
|
Fitzgerald, John S.
|
|
2008
|
|
3-4 |
p. 128-132
5 p.
|
artikel
|
| 52 |
The correct diameter of trivalent Cayley graphs
|
Tsai, Chang-Hsiung
|
|
1999
|
|
3-4 |
p. 109-111
3 p.
|
artikel
|
| 53 |
The cost of graceful degradation for omission failures
|
Jayanti, Prasad
|
|
1999
|
|
3-4 |
p. 167-172
6 p.
|
artikel
|
| 54 |
Tree precedence in scheduling: The strong–weak distinction
|
Dror, M.
|
|
1999
|
|
3-4 |
p. 127-134
8 p.
|
artikel
|
| 55 |
Worst-case analysis of Weber's GCD algorithm
|
Lavault, Christian
|
|
1999
|
|
3-4 |
p. 125-130
6 p.
|
artikel
|
| 56 |
Worst case examples for operations on OBDDs
|
Wegener, Ingo
|
|
2000
|
|
3-4 |
p. 91-96
6 p.
|
artikel
|
Tijdschrift beschrijving