Loyalty improvement beyond the seeds in social networks Huan MaYuqing ZhuWeili Wu OriginalPaper 18 April 2013 Pages: 685 - 700
Generalized Canadian traveller problems Chung-Shou LiaoYamming Huang OriginalPaper 23 April 2013 Pages: 701 - 712
The \(r\)-acyclic chromatic number of planar graphs Guanghui WangGuiying YanXin Zhang OriginalPaper 24 April 2013 Pages: 713 - 722
Optimal-constrained multicast sub-graph over coded packet networks M. A. RaayatpanahH. Salehi FathabadiP. M. Pardalos OriginalPaper 25 April 2013 Pages: 723 - 738
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines Paul C. BellPrudence W. H. Wong OriginalPaper 27 April 2013 Pages: 739 - 749
Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results Mirko RuokokoskiHarri EhtamoPanos M. Pardalos OriginalPaper 08 May 2013 Pages: 750 - 780
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times An ZhangYiwei JiangJueliang Hu OriginalPaper 15 May 2013 Pages: 781 - 795
The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs Ruixue ZhangPing ZhaoFuliang Lu OriginalPaper 15 May 2013 Pages: 796 - 802
Complete forcing numbers of catacondensed hexagonal systems Shou-Jun XuHeping ZhangJinzhuan Cai OriginalPaper 15 May 2013 Pages: 803 - 814
Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks Zhipeng CaiYueming DuanAnu G. Bourgeois OriginalPaper 16 May 2013 Pages: 815 - 835
The online \(k\)-server problem with max-distance objective Yinfeng XuHongmei LiLi Luo OriginalPaper 16 May 2013 Pages: 836 - 846
Parameterizations of hitting set of bundles and inverse scope Peter Damaschke OriginalPaper 17 May 2013 Pages: 847 - 858
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem Theodoros GevezesLeonidas Pitsoulis OriginalPaper 17 May 2013 Pages: 859 - 883
