| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A simple ( 2 + ϵ ) -approximation algorithm for Split Vertex Deletion
|
Drescher, Matthew
|
|
|
121 |
C |
p.
|
artikel
|
| 2 |
Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity
|
Cigler, J.
|
|
|
121 |
C |
p.
|
artikel
|
| 3 |
Coloring circle arrangements: New 4-chromatic planar graphs
|
Chiu, Man-Kwun
|
|
|
121 |
C |
p.
|
artikel
|
| 4 |
Colouring strong products
|
Esperet, Louis
|
|
|
121 |
C |
p.
|
artikel
|
| 5 |
Descents on nonnesting multipermutations
|
Elizalde, Sergi
|
|
|
121 |
C |
p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
121 |
C |
p.
|
artikel
|
| 7 |
[No title]
|
Nešetřil, Jaroslav
|
|
|
121 |
C |
p.
|
artikel
|
| 8 |
On sumsets of nonbases of maximum size
|
Bajnok, Béla
|
|
|
121 |
C |
p.
|
artikel
|
| 9 |
On tangencies among planar curves with an application to coloring L-shapes
|
Ackerman, Eyal
|
|
|
121 |
C |
p.
|
artikel
|
| 10 |
Partitioning a 2-edge-coloured graph of minimum degree 2 n / 3 + o ( n ) into three monochromatic cycles
|
Allen, Peter
|
|
|
121 |
C |
p.
|
artikel
|
| 11 |
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
|
Espuny Díaz, Alberto
|
|
|
121 |
C |
p.
|
artikel
|
| 12 |
10 problems for partitions of triangle-free graphs
|
Balogh, József
|
|
|
121 |
C |
p.
|
artikel
|
| 13 |
Reconstruction of random geometric graphs: Breaking the Ω ( r ) distortion barrier
|
Dani, Varsha
|
|
|
121 |
C |
p.
|
artikel
|
| 14 |
Rota’s basis conjecture holds for random bases of vector spaces
|
Sauermann, Lisa
|
|
|
121 |
C |
p.
|
artikel
|
| 15 |
Schur properties of randomly perturbed sets
|
Das, Shagnik
|
|
|
121 |
C |
p.
|
artikel
|
| 16 |
Weak diameter coloring of graphs on surfaces
|
Dvořák, Zdeněk
|
|
|
121 |
C |
p.
|
artikel
|
Tijdschrift beschrijving