| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An improved kernel for Max-Bisection above tight lower bound
|
Feng, Qilong
|
|
|
818 |
C |
p. 12-21
|
artikel
|
| 2 |
An incentive compatible, efficient market for air traffic flow management
|
Mehta, Ruta
|
|
|
818 |
C |
p. 41-50
|
artikel
|
| 3 |
Complexity and algorithms for finding a subset of vectors with the longest sum
|
Shenmaier, Vladimir
|
|
|
818 |
C |
p. 60-73
|
artikel
|
| 4 |
Editorial Board
|
|
|
|
818 |
C |
p. ii
|
artikel
|
| 5 |
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
|
Conte, Alessio
|
|
|
818 |
C |
p. 2-11
|
artikel
|
| 6 |
Linear representation of transversal matroids and gammoids parameterized by rank
|
Misra, Pranabendu
|
|
|
818 |
C |
p. 51-59
|
artikel
|
| 7 |
NP-completeness results for partitioning a graph into total dominating sets
|
Koivisto, Mikko
|
|
|
818 |
C |
p. 22-31
|
artikel
|
| 8 |
On scheduling multiple two-stage flowshops
|
Wu, Guangwei
|
|
|
818 |
C |
p. 74-82
|
artikel
|
| 9 |
On the modulo degree complexity of Boolean functions
|
Li, Qian
|
|
|
818 |
C |
p. 32-40
|
artikel
|
| 10 |
Preface to the special issue on Computing and Combinatorics
|
Cao, Yixin
|
|
|
818 |
C |
p. 1
|
artikel
|
| 11 |
The existence of universally agreed fairest semi-matchings in any given bipartite graph
|
Xu, Jian
|
|
|
818 |
C |
p. 83-91
|
artikel
|
Tijdschrift beschrijving