| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An integer programming approach for the Chinese postman problem with time-dependent travel time
|
Sun, Jinghao
|
|
2014
|
29 |
3 |
p. 565-588
|
artikel
|
| 2 |
A set covering approach for multi-depot train driver scheduling
|
Yaghini, Masoud
|
|
2013
|
29 |
3 |
p. 636-654
|
artikel
|
| 3 |
Expected computations on color spanning sets
|
Li, Chao
|
|
2014
|
29 |
3 |
p. 589-604
|
artikel
|
| 4 |
Faster exact computation of rSPR distance
|
Chen, Zhi-Zhong
|
|
2013
|
29 |
3 |
p. 605-635
|
artikel
|
| 5 |
Large hypertree width for sparse random hypergraphs
|
Liu, Tian
|
|
2014
|
29 |
3 |
p. 531-540
|
artikel
|
| 6 |
On $$(s,t)$$(s,t)-relaxed $$L(2,1)$$L(2,1)-labelings of the triangular lattice
|
Lin, Wensong
|
|
2013
|
29 |
3 |
p. 655-669
|
artikel
|
| 7 |
On the hardness of learning queries from tree structured data
|
Liu, Xianmin
|
|
2013
|
29 |
3 |
p. 670-684
|
artikel
|
| 8 |
Optimal shortest path set problem in undirected graphs
|
Zhang, Huili
|
|
2014
|
29 |
3 |
p. 511-530
|
artikel
|
| 9 |
Zero-visibility cops and robber and the pathwidth of a graph
|
Dereniowski, Dariusz
|
|
2014
|
29 |
3 |
p. 541-564
|
artikel
|
Tijdschrift beschrijving