nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
|
Linial, Nathan |
|
2000 |
20 |
4 |
p. 545-568 |
artikel |
2 |
Biased Positional Games for Which Random Strategies are Nearly Optimal
|
Bednarska, Małgorzata |
|
2000 |
20 |
4 |
p. 477-488 |
artikel |
3 |
Efficient Testing of Large Graphs
|
Alon, Noga |
|
2000 |
20 |
4 |
p. 451-476 |
artikel |
4 |
Finding Convex Sets in Convex Position
|
Tóth, Géza |
|
2000 |
20 |
4 |
p. 589-596 |
artikel |
5 |
Hedetniemi's Conjecture and the Retracts of a Product of Graphs
|
Larose, Benoit |
|
2000 |
20 |
4 |
p. 531-544 |
artikel |
6 |
Morse Theory and Evasiveness
|
Forman, Robin |
|
2000 |
20 |
4 |
p. 489-504 |
artikel |
7 |
On a Conjecture of Kemnitz
|
Rónyai, Lajos |
|
2000 |
20 |
4 |
p. 569-573 |
artikel |
8 |
On Cayley Graphs on the Symmetric Group Generated by Tranpositions
|
Friedman, Joel |
|
2000 |
20 |
4 |
p. 505-519 |
artikel |
9 |
On the Number of Edges in Colour-Critical Graphs and Hypergraphs
|
Kostochka, A. V. |
|
2000 |
20 |
4 |
p. 521-530 |
artikel |
10 |
Total Dual Integrality of Matching Forest Constraints
|
Schrijver, Alexander |
|
2000 |
20 |
4 |
p. 575-588 |
artikel |