nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A decision method for Parikh slenderness of context-free languages
|
Honkala, Juha |
|
1997 |
73 |
1 |
p. 1-4 4 p. |
artikel |
2 |
A linear-time algorithm for computing the intersection of all odd cycles in a graph
|
Cai, Leizhen |
|
1997 |
73 |
1 |
p. 27-34 8 p. |
artikel |
3 |
A note on approximate inclusion-exclusion
|
Melkman, Avraham A |
|
1997 |
73 |
1 |
p. 23-26 4 p. |
artikel |
4 |
Directed rectangle-visibility graphs have unbounded dimension
|
Romanik, Kathleen |
|
1997 |
73 |
1 |
p. 35-39 5 p. |
artikel |
5 |
Editorial Board
|
|
|
1997 |
73 |
1 |
p. iii-iv nvt p. |
artikel |
6 |
Nondegenerate functions and permutations
|
O'Connor, Luke |
|
1997 |
73 |
1 |
p. 41-57 17 p. |
artikel |
7 |
On the number of spanning trees and Eulerian tours in iterated line digraphs
|
Huaxiao, Zhang |
|
1997 |
73 |
1 |
p. 59-67 9 p. |
artikel |
8 |
Preserving approximation in the Min—Weighted Set Cover Problem
|
Gambosi, Giorgio |
|
1997 |
73 |
1 |
p. 13-22 10 p. |
artikel |
9 |
Random walks and electrical resistances in products of graphs
|
Bollobás, Béla |
|
1997 |
73 |
1 |
p. 69-79 11 p. |
artikel |
10 |
Resolution search
|
Chvátal, V |
|
1997 |
73 |
1 |
p. 81-99 19 p. |
artikel |
11 |
The rotation graphs of perfect matchings of plane bipartite graphs
|
Zhang, Heping |
|
1997 |
73 |
1 |
p. 5-12 8 p. |
artikel |