Volume 29, Issue 3 | Journal of Combinatorial Optimization

Search all Journal of Combinatorial Optimization articles

Volume 29, Issue 3

April 2015

Special Issue: Graph Paths, Treewidth, and Pathwidth: Selected Papers from AAIM 2013

Issue Editor:

Xiangyang Li

Filter by

Volume:

Sort by

Date published:

New to old Old to new

9 articles in this issue

Optimal shortest path set problem in undirected graphs
Huili Zhang
Yinfeng Xu
Xingang Wen
OriginalPaper 05 July 2014 Pages: 511 - 530
Large hypertree width for sparse random hypergraphs
Tian Liu
Chaoyi Wang
Ke Xu
OriginalPaper 08 January 2014 Pages: 531 - 540
Zero-visibility cops and robber and the pathwidth of a graph
Dariusz Dereniowski
Danny Dyer
Boting Yang
OriginalPaper 19 February 2014 Pages: 541 - 564
An integer programming approach for the Chinese postman problem with time-dependent travel time
Jinghao Sun
Yakun Meng
Guozhen Tan
OriginalPaper 23 May 2014 Pages: 565 - 588
Expected computations on color spanning sets
Chao Li
Chenglin Fan
Binhai Zhu
OriginalPaper 18 June 2014 Pages: 589 - 604
Faster exact computation of rSPR distance
Zhi-Zhong Chen
Ying Fan
Lusheng Wang
OriginalPaper 08 December 2013 Pages: 605 - 635
A set covering approach for multi-depot train driver scheduling
Masoud Yaghini
Mohammad Karimi
Mohadeseh Rahbar
OriginalPaper 07 April 2013 Pages: 636 - 654
On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
Wensong Lin
Benqiu Dai
OriginalPaper 09 April 2013 Pages: 655 - 669
On the hardness of learning queries from tree structured data
Xianmin Liu
Jianzhong Li
OriginalPaper 10 April 2013 Pages: 670 - 684