nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Closed Separator Sets
|
Kriesell, Matthias |
|
|
25 |
5 |
p. 575-598 |
artikel |
2 |
Closed Separator Sets
|
Kriesell, Matthias |
|
2005 |
25 |
5 |
p. 575-598 |
artikel |
3 |
On Graphs That Do Not Contain The Cube And Related Problems
|
Pinchasi, Rom |
|
|
25 |
5 |
p. 615-623 |
artikel |
4 |
On Graphs That Do Not Contain The Cube And Related Problems
|
Pinchasi, Rom |
|
2005 |
25 |
5 |
p. 615-623 |
artikel |
5 |
Proof Of A Conjecture Of Erdős On Triangles In Set-Systems
|
Mubayi, Dhruv |
|
|
25 |
5 |
p. 599-614 |
artikel |
6 |
Proof Of A Conjecture Of Erdős On Triangles In Set-Systems
|
Mubayi, Dhruv |
|
2005 |
25 |
5 |
p. 599-614 |
artikel |
7 |
Small Forbidden Configurations IV: The 3 Rowed Case
|
Anstee*, Richard |
|
|
25 |
5 |
p. 503-518 |
artikel |
8 |
Small Forbidden Configurations IV: The 3 Rowed Case
|
Anstee*, Richard |
|
2005 |
25 |
5 |
p. 503-518 |
artikel |
9 |
The Fractional Chromatic Number Of The Categorical Product Of Graphs
|
Tardif, Claude |
|
|
25 |
5 |
p. 625-632 |
artikel |
10 |
The Fractional Chromatic Number Of The Categorical Product Of Graphs
|
Tardif, Claude |
|
2005 |
25 |
5 |
p. 625-632 |
artikel |
11 |
The Hardness of 3-Uniform Hypergraph Coloring
|
Dinur*, Irit |
|
|
25 |
5 |
p. 519-535 |
artikel |
12 |
The Hardness of 3-Uniform Hypergraph Coloring
|
Dinur*, Irit |
|
2005 |
25 |
5 |
p. 519-535 |
artikel |
13 |
The Liar Game Over an Arbitrary Channel
|
Dumitriu, Ioana |
|
|
25 |
5 |
p. 537-559 |
artikel |
14 |
The Liar Game Over an Arbitrary Channel
|
Dumitriu, Ioana |
|
2005 |
25 |
5 |
p. 537-559 |
artikel |
15 |
The Turán Number Of The Fano Plane
|
Keevash, Peter |
|
|
25 |
5 |
p. 561-574 |
artikel |
16 |
The Turán Number Of The Fano Plane
|
Keevash, Peter |
|
2005 |
25 |
5 |
p. 561-574 |
artikel |