nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Constructing extremal triangle-free graphs using integer programming
|
Banak, Ali Erdem |
|
|
50 |
C |
p. |
artikel |
2 |
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions
|
Chen, Rui |
|
|
50 |
C |
p. |
artikel |
3 |
Editorial Board
|
|
|
|
50 |
C |
p. |
artikel |
4 |
Hard problems on box-totally dual integral polyhedra
|
Chervet, Patrick |
|
|
50 |
C |
p. |
artikel |
5 |
More on online weighted edge coloring
|
Epstein, Leah |
|
|
50 |
C |
p. |
artikel |
6 |
On cut polytopes and graph minors
|
Kaparis, Konstantinos |
|
|
50 |
C |
p. |
artikel |
7 |
On the general Z -type index of connected graphs
|
Chen, Chaohui |
|
|
50 |
C |
p. |
artikel |
8 |
Optimal length cutting plane refutations of integer programs
|
Subramani, K. |
|
|
50 |
C |
p. |
artikel |
9 |
Packing mixed hyperarborescences
|
Szigeti, Zoltán |
|
|
50 |
C |
p. |
artikel |
10 |
The k -aggregation closure for covering sets
|
Zhu, Haoran |
|
|
50 |
C |
p. |
artikel |
11 |
The maximum number of short paths in a Halin graph
|
He, Shunhai |
|
|
50 |
C |
p. |
artikel |