| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear time algorithm to compute a dominating path in an AT-free graph
|
Corneil, Derek G.
|
|
1995
|
54 |
5 |
p. 253-257
5 p.
|
artikel
|
| 2 |
An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
|
Fujiwara, Akihiro
|
|
1995
|
54 |
5 |
p. 295-300
6 p.
|
artikel
|
| 3 |
A note on lexicographic breadth first search for chordal graphs
|
Simon, Klaus
|
|
1995
|
54 |
5 |
p. 249-251
3 p.
|
artikel
|
| 4 |
Exponential lower bounds for the tree-like Hajós calculus
|
Iwama, Kazuo
|
|
1995
|
54 |
5 |
p. 289-294
6 p.
|
artikel
|
| 5 |
On the equivalence covering number of splitgraphs
|
Blokhuis, A.
|
|
1995
|
54 |
5 |
p. 301-304
4 p.
|
artikel
|
| 6 |
On-the-fly analysis of distributed computations
|
Fromentin, Eddy
|
|
1995
|
54 |
5 |
p. 267-274
8 p.
|
artikel
|
| 7 |
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
|
Sajith, G.
|
|
1995
|
54 |
5 |
p. 305-
1 p.
|
artikel
|
| 8 |
3-SAT = SAT for a class of normal modal logics
|
Demri, Stéphane
|
|
1995
|
54 |
5 |
p. 281-287
7 p.
|
artikel
|
| 9 |
Stabilizing phase-clocks
|
Herman, Ted
|
|
1995
|
54 |
5 |
p. 259-265
7 p.
|
artikel
|
| 10 |
Why is the 3D Delaunay triangulation difficult to construct?
|
Sugihara, Kokichi
|
|
1995
|
54 |
5 |
p. 275-280
6 p.
|
artikel
|
Tijdschrift beschrijving