nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
|
Jain, Kamal |
|
2001 |
21 |
1 |
p. 39-60 |
artikel |
2 |
Critical Facets of the Stable Set Polytope
|
Lipták, László |
|
2001 |
21 |
1 |
p. 61-88 |
artikel |
3 |
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
|
Meyer auf der Heide, Friedhelm |
|
2001 |
21 |
1 |
p. 95-138 |
artikel |
4 |
Edge-Coloring Bipartite Multigraphs in O(E logD) Time
|
Cole, Richard |
|
2001 |
21 |
1 |
p. 5-12 |
artikel |
5 |
Integer and Fractional Packings in Dense Graphs
|
Haxell, P. E. |
|
2001 |
21 |
1 |
p. 13-38 |
artikel |
6 |
Note – Uncrossing a Family of Set-Pairs
|
Fleiner, Tamás |
|
2001 |
21 |
1 |
p. 145-150 |
artikel |
7 |
Ryser's Conjecture for Tripartite 3-Graphs
|
Aharoni, Ron |
|
2001 |
21 |
1 |
p. 1-4 |
artikel |
8 |
The Clique Complex and Hypergraph Matching
|
Meshulam, Roy |
|
2001 |
21 |
1 |
p. 89-94 |
artikel |
9 |
Tilings of the Square With Similar Right Triangles
|
Szegedy, Balázs |
|
2001 |
21 |
1 |
p. 139-144 |
artikel |