Ausgabe 4/2014
Inhalt (14 Artikel)
Open Access
2-Rainbow domination number of Cartesian products: and
Zofia Stępień, Maciej Zwierzchowski
Strategyproof mechanism design for facility location games with weighted agents on a line
Qiang Zhang, Minming Li
Every planar graph with cycles of length neither 4 nor 5 is -colorable
Lingji Xu, Zhengke Miao, Yingqian Wang
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng
An upper bound of Heilbronn number for eight points in triangles
Liangyu Chen, Zhenbing Zeng, Wei Zhou
Online scheduling with rejection and reordering: exact algorithms for unit size jobs
Leah Epstein, Hanan Zebedat-Haider
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang
Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable
Chenxia Zhao, Xianyue Li