nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for drawing binary trees in the plane
|
Shin, Chan-Su |
|
1998 |
66 |
3 |
p. 133-139 7 p. |
artikel |
2 |
A linear time algorithm for a matching problem on the circle
|
Cabrelli, Carlos A. |
|
1998 |
66 |
3 |
p. 161-164 4 p. |
artikel |
3 |
An algorithm for modular exponentiation
|
Dimitrov, V.S. |
|
1998 |
66 |
3 |
p. 155-159 5 p. |
artikel |
4 |
A note on the Ádám conjecture for double loops
|
Litow, B. |
|
1998 |
66 |
3 |
p. 149-153 5 p. |
artikel |
5 |
Application of the special Latin square to a parallel routing algorithm on a recursive circulant network
|
Kim, Seongyeol |
|
1998 |
66 |
3 |
p. 141-147 7 p. |
artikel |
6 |
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
|
Czyzowicz, Jurek |
|
1998 |
66 |
3 |
p. 125-126 2 p. |
artikel |
7 |
Fast data transmission and maximal dynamic flow
|
Xue, Guoliang |
|
1998 |
66 |
3 |
p. 127-132 6 p. |
artikel |
8 |
Maximum network flow with floating point arithmetic
|
Althaus, Ernst |
|
1998 |
66 |
3 |
p. 109-113 5 p. |
artikel |
9 |
On circularly-hidden surface removal
|
Nakhoon, Baek |
|
1998 |
66 |
3 |
p. 119-123 5 p. |
artikel |
10 |
On the chromatic index of graphs with 2m + 1 vertices and 2m 2 edges
|
Rhee, Chongkye |
|
1998 |
66 |
3 |
p. 115-118 4 p. |
artikel |