no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
|
Krivelevich, Michael |
|
2001 |
41 |
1 |
p. 99-113 15 p. |
article |
2 |
Approximation Algorithms for Independent Sets in Map Graphs
|
Chen, Zhi-Zhong |
|
2001 |
41 |
1 |
p. 20-40 21 p. |
article |
3 |
Computing Chow Forms and Some Applications
|
Jeronimo, Gabriela |
|
2001 |
41 |
1 |
p. 52-68 17 p. |
article |
4 |
Deterministic Dictionaries
|
Hagerup, Torben |
|
2001 |
41 |
1 |
p. 69-85 17 p. |
article |
5 |
Efficient Merging and Construction of Evolutionary Trees
|
Lingas, Andrzej |
|
2001 |
41 |
1 |
p. 41-51 11 p. |
article |
6 |
How Helpers Hasten h-Relations
|
Sanders, Peter |
|
2001 |
41 |
1 |
p. 86-98 13 p. |
article |
7 |
Papers to Appear in Forthcoming Issues
|
|
|
2001 |
41 |
1 |
p. 114- 1 p. |
article |
8 |
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
|
Bang-Jensen, Jørgen |
|
2001 |
41 |
1 |
p. 1-19 19 p. |
article |