Issue 1/2020
Content (17 Articles)
Approximation algorithms for two-stage flexible flow shop scheduling
Minghui Zhang, Yan Lan, Xin Han
The seeding algorithm for k-means problem with penalties
Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang
Less is more approach for competing groups scheduling with different learning effects
Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos
Open Access
Graphs with equal domination and covering numbers
Andrzej Lingas, Mateusz Miotk, Jerzy Topp, Paweł Żyliński
Neighbor product distinguishing total colorings of 2-degenerate graphs
Enqiang Zhu, Chanjuan Liu, Jiguo Yu
Algorithmic results on double Roman domination in graphs
S. Banerjee, Michael A. Henning, D. Pradhan
On the extremal graphs with respect to the total reciprocal edge-eccentricity
Lifang Zhao, Hongshuai Li, Yuping Gao
Approximation algorithm for a generalized Roman domination problem in unit ball graphs
Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang, Xiaoyan Zhang
The structure of graphs with given number of blocks and the maximum Wiener index
Stéphane Bessy, François Dross, Katarína Hriňáková, Martin Knor, Riste Škrekovski
Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs
Shuwan Zhu, Wenjuan Fan, Tongzhu Liu, Shanlin Yang, Panos M. Pardalos
Efficient algorithms for measuring the funnel-likeness of DAGs
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
Chao Song, Changqing Xu