nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast algorithm for string matching with mismatches
|
Dermouche, A |
|
1995 |
55 |
2 |
p. 105-110 6 p. |
artikel |
2 |
A 3-valued wakeup protocol
|
Valois, John D |
|
1995 |
55 |
2 |
p. 89-93 5 p. |
artikel |
3 |
Finding an approximate minimum-link visibility path inside a simple polygon
|
Alsuwaiyel, Muhammad H |
|
1995 |
55 |
2 |
p. 75-79 5 p. |
artikel |
4 |
Incremental constraint deletion in systems of linear constraints
|
Huynh, Tien |
|
1995 |
55 |
2 |
p. 111-115 5 p. |
artikel |
5 |
Iterative improvement of vertex covers
|
Saab, Youssef |
|
1995 |
55 |
2 |
p. 95-98 4 p. |
artikel |
6 |
Linear bounds for on-line Steiner problems
|
Westbrook, Jeffery |
|
1995 |
55 |
2 |
p. 59-63 5 p. |
artikel |
7 |
Simple linear time recognition of unit interval graphs
|
Corneil, Derek G |
|
1995 |
55 |
2 |
p. 99-104 6 p. |
artikel |
8 |
Some results on selectivity and self-reducibility
|
Wang, Jie |
|
1995 |
55 |
2 |
p. 81-87 7 p. |
artikel |
9 |
The lazy z-buffer
|
Hill, Steve |
|
1995 |
55 |
2 |
p. 65-70 6 p. |
artikel |
10 |
The pagenumber of the class of bandwidth-k graphs is k − 1
|
Swaminathan, R.P |
|
1995 |
55 |
2 |
p. 71-74 4 p. |
artikel |