An \(O(n\log n)\) algorithm for finding edge span of cacti Robert JanczewskiKrzysztof Turowski OriginalPaper Open access 17 January 2015 Pages: 1373 - 1382
On judicious partitions of graphs Muhuo LiuBaogang Xu OriginalPaper 20 January 2015 Pages: 1383 - 1398
Acyclic coloring of graphs with some girth restriction Jiansheng CaiBinlu FengGuiying Yan OriginalPaper 24 January 2015 Pages: 1399 - 1404
On identifying codes in the Cartesian product of a path and a complete graph Jason Hedetniemi OriginalPaper 29 January 2015 Pages: 1405 - 1416
A simple greedy approximation algorithm for the minimum connected \(k\)-Center problem Dongyue LiangLiquan MeiWei Wang OriginalPaper 03 February 2015 Pages: 1417 - 1429
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic Renyu XuJianliang WuJin Xu OriginalPaper 03 February 2015 Pages: 1430 - 1442
Optimization techniques for robust multivariate location and scatter estimation C. ChatzinakosL. PitsoulisG. Zioutas OriginalPaper 29 January 2015 Pages: 1443 - 1460
Heuristics for the network design problem with connectivity requirements Roman E. ShanginPanos Pardalos OriginalPaper 17 February 2015 Pages: 1461 - 1478
The 2-surviving rate of planar graphs without 5-cycles Tingting WuJiangxu KongWeifan Wang OriginalPaper 06 February 2015 Pages: 1479 - 1492
New results on two-machine flow-shop scheduling with rejection Liqi ZhangLingfa LuShisheng Li OriginalPaper 11 February 2015 Pages: 1493 - 1504
An approximation algorithm for maximum weight budgeted connected set cover Yingli RanZhao ZhangJun Liang OriginalPaper 11 February 2015 Pages: 1505 - 1517
On statistical bounds of heuristic solutions to location problems Kenneth CarlingXiangli Meng OriginalPaper 20 February 2015 Pages: 1518 - 1549
A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring Donghyun KimWei WangAlade O. Tokuta OriginalPaper 24 February 2015 Pages: 1550 - 1568
Online integrated production–distribution scheduling problems without preemption Xin FengYongxi ChengYinfeng Xu OriginalPaper 24 February 2015 Pages: 1569 - 1585
Equality in a bound that relates the size and the restrained domination number of a graph Johannes H. HattinghErnst J. Joubert OriginalPaper 28 February 2015 Pages: 1586 - 1608
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart Hailing LiuJinjiang YuanWenjie Li OriginalPaper 26 February 2015 Pages: 1609 - 1622
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks Kejia ZhangQilong HanHaiwei Pan OriginalPaper 12 March 2015 Pages: 1623 - 1641
Sizes and transmissions of digraphs with a given clique number Zejun HuangHuiqiu Lin OriginalPaper 13 March 2015 Pages: 1642 - 1649
Total coloring of planar graphs without short cycles Hua CaiJianliang WuLin Sun OriginalPaper 03 April 2015 Pages: 1650 - 1664
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations Larisa KomoskoMikhail BatsynPanos M. Pardalos OriginalPaper 24 March 2015 Pages: 1665 - 1677
On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence Ailian WangWeili WuLei Cui OriginalPaper 29 January 2016 Pages: 1678 - 1684
On the directed cut cone and polytope David AvisConor Meagher OriginalPaper 24 March 2015 Pages: 1685 - 1708
Construction of optimal constant-dimension subspace codes Wayne PullanXin-Wen WuZihui Liu OriginalPaper 28 March 2015 Pages: 1709 - 1719
Budget-constrained minimum cost flows Michael HolzhauserSven O. KrumkeClemens Thielen OriginalPaper 25 March 2015 Pages: 1720 - 1745
Pseudo-automatic beam orientations in multi-criteria intensity-modulated radiation therapy Ahmad-Saher Azizi-Sultan OriginalPaper 27 March 2015 Pages: 1746 - 1759