
Journals in DBLP
Networks 2004, volume: 44, number: 4
 Massimiliano Caramia, Paolo Dell'Olmo
Bounding vertex coloring by truncated multistage branch and bound. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:231242 [Journal]
 Ján Plesník
Minimum kgeodetically connected digraphs. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:243253 [Journal]
 Luis Gouveia, Thomas L. Magnanti, Cristina Requejo
A 2path approach for odddiameterconstrained minimum spanning and Steiner trees. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:254265 [Journal]
 Alberto Caprara, Andrea Lodi, Romeo Rizzi
On dthreshold graphs and ddimensional bin packing. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:266280 [Journal]
 Frédéric Havet, Marc Wennink
The Push Tree problem. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:281291 [Journal]
 Min Xu, XinMin Hou, JunMing Xu
The proof of a conjecture of Bouabdallah and Sotteau. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:292296 [Journal]
 Satoru Iwata, Nozomu Zuiki
A network flow approach to cost allocation for rooted trees. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:297301 [Journal]
 JouMing Chang, JinnShyong Yang, YueLi Wang, Yuwen Cheng
Panconnectivity, faulttolerant hamiltonicity and hamiltonianconnectivity in alternating group graphs. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:302310 [Journal]
