nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithmic expedients for the Prize Collecting Steiner Tree Problem
|
Haouari, Mohamed |
|
2010 |
7 |
1-2 |
p. 32-47 16 p. |
artikel |
2 |
Computing Steiner points for gradient-constrained minimum networks
|
Thomas, D.A. |
|
2010 |
7 |
1-2 |
p. 21-31 11 p. |
artikel |
3 |
Editorial Board
|
|
|
2010 |
7 |
1-2 |
p. IFC- 1 p. |
artikel |
4 |
Generating partitions of a graph into a fixed number of minimum weight cuts
|
Reinelt, Gerhard |
|
2010 |
7 |
1-2 |
p. 1-12 12 p. |
artikel |
5 |
Gusein-Zade problem for directed path
|
Przykucki, Michał |
|
2010 |
7 |
1-2 |
p. 13-20 8 p. |
artikel |
6 |
Labeled Traveling Salesman Problems: Complexity and approximation
|
Couëtoux, Basile |
|
2010 |
7 |
1-2 |
p. 74-85 12 p. |
artikel |
7 |
Quantitative stability analysis for vector problems of 0–1 programming
|
Emelichev, Vladimir |
|
2010 |
7 |
1-2 |
p. 48-63 16 p. |
artikel |
8 |
The integral stable allocation problem on graphs
|
Biró, Péter |
|
2010 |
7 |
1-2 |
p. 64-73 10 p. |
artikel |
9 |
Triangle-free graphs with large independent domination number
|
Shiu, Wai Chee |
|
2010 |
7 |
1-2 |
p. 86-92 7 p. |
artikel |