nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs
|
Lai, T.H. |
|
1995 |
18 |
2 |
p. 358-375 18 p. |
artikel |
2 |
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
|
Furer, M. |
|
1995 |
18 |
2 |
p. 203-220 18 p. |
artikel |
3 |
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
|
Bodlaender, H.L. |
|
1995 |
18 |
2 |
p. 238-255 18 p. |
artikel |
4 |
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
|
Breslauer, D. |
|
1995 |
18 |
2 |
p. 278-295 18 p. |
artikel |
5 |
Edge Coloring Series Parallel Graphs
|
Caspi, Y. |
|
1995 |
18 |
2 |
p. 296-321 26 p. |
artikel |
6 |
The Competitiveness of On-Line Assignments
|
Azar, Y. |
|
1995 |
18 |
2 |
p. 221-237 17 p. |
artikel |
7 |
The Complexity of Data Reduction on a Reconfigurable Linear Array
|
Benasher, Y. |
|
1995 |
18 |
2 |
p. 322-357 36 p. |
artikel |
8 |
Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
|
Deberg, M. |
|
1995 |
18 |
2 |
p. 256-277 22 p. |
artikel |