Ausgabe 1/2017
Inhalt (22 Artikel)
Neighbor sum distinguishing total coloring of 2-degenerate graphs
Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu
An exact semidefinite programming approach for the max-mean dispersion problem
Michele Garraffa, Federico Della Croce, Fabio Salassa
Modified linear programming and class 0 bounds for graph pebbling
Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger
Minimizing the number of tardy jobs in two-machine settings with common due date
Federico Della Croce, Christos Koulamas, Vincent T’kindt
On minimally 2-connected graphs with generalized connectivity
Shasha Li, Wei Li, Yongtang Shi, Haina Sun
The minimum value of geometric-arithmetic index of graphs with minimum degree 2
Mahdi Sohrabi-Haghighat, Mohammadreza Rostami
Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
Yingmo Jie, Cheng Guo, Zhangjie Fu
Total coloring of planar graphs without adjacent chordal 6-cycles
Huijuan Wang, Bin Liu, Xiaoli Wang, Guangmo Tong, Weili Wu, Hongwei Gao
Approximation algorithms for k-level stochastic facility location problems
Lucas P. Melo, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery
Maximizing target-temporal coverage of mission-driven camera sensor networks
Yi Hong, Deying Li, Donghyun Kim, Wenping Chen, Jiguo Yu, Alade O. Tokuta
Centralized and decentralized rumor blocking problems
Xin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang, Ker-I Ko