A lower bound of the surviving rate of a planar graph with girth at least seven Weifan WangStephen FinbowPing Wang OriginalPaper 06 September 2012 Pages: 621 - 642
Hardness results and approximation algorithm for total liar’s domination in graphs B. S. PandaS. Paul OriginalPaper 06 September 2012 Pages: 643 - 662
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design Peng Zhang OriginalPaper 06 September 2012 Pages: 663 - 678
Bandwidth sums of block graphs and cacti Gerard Jennhwa ChangMa-Lian ChiaJing-Ho Yan OriginalPaper 14 September 2012 Pages: 679 - 687
Paired versus double domination in K 1,r -free graphs Paul DorbecBert HartnellMichael A. Henning OriginalPaper 15 September 2012 Pages: 688 - 694
Multiple L(j,1)-labeling of the triangular lattice Pu ZhangWensong Lin OriginalPaper 18 September 2012 Pages: 695 - 710
Algorithms with limited number of preemptions for scheduling on parallel machines Yiwei JiangZewei WengJueliang Hu OriginalPaper 19 September 2012 Pages: 711 - 723
Linear time-dependent constraints programming with MSVL Qian MaZhenhua Duan OriginalPaper 28 September 2012 Pages: 724 - 766
The cost of selfishness for maximizing the minimum load on uniformly related machines Leah EpsteinElena KleimanRob van Stee OriginalPaper 06 October 2012 Pages: 767 - 777
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison Shihyen ChenKaizhong Zhang OriginalPaper 12 October 2012 Pages: 778 - 797
Faster algorithm to find anti-risk path between two nodes of an undirected graph Jay MahadeokarSanjeev Saxena OriginalPaper 12 October 2012 Pages: 798 - 807
Solving the Multidimensional Assignment Problem by a Cross-Entropy method Duc Manh NguyenHoai An Le ThiTao Pham Dinh OriginalPaper 12 October 2012 Pages: 808 - 823
