Skip to main content


Journal of Combinatorial Optimization

Journal of Combinatorial Optimization 1/2020

Ausgabe 1/2020

Inhaltsverzeichnis ( 17 Artikel )

23.09.2019 | Ausgabe 1/2020

Approximation algorithms for two-stage flexible flow shop scheduling

Minghui Zhang, Yan Lan, Xin Han

26.09.2019 | Ausgabe 1/2020

The seeding algorithm for k-means problem with penalties

Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang

04.10.2019 | Ausgabe 1/2020

Less is more approach for competing groups scheduling with different learning effects

Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos

25.10.2019 | Ausgabe 1/2020 Open Access

Graphs with equal domination and covering numbers

Andrzej Lingas, Mateusz Miotk, Jerzy Topp, Paweł Żyliński

19.10.2019 | Ausgabe 1/2020

Neighbor product distinguishing total colorings of 2-degenerate graphs

Enqiang Zhu, Chanjuan Liu, Jiguo Yu

19.10.2019 | Ausgabe 1/2020

Bounds on upper transversals in hypergraphs

Michael A. Henning, Anders Yeo

19.10.2019 | Ausgabe 1/2020

Algorithmic results on double Roman domination in graphs

S. Banerjee, Michael A. Henning, D. Pradhan

21.10.2019 | Ausgabe 1/2020

On the extremal graphs with respect to the total reciprocal edge-eccentricity

Lifang Zhao, Hongshuai Li, Yuping Gao

24.10.2019 | Ausgabe 1/2020

Approximation algorithm for a generalized Roman domination problem in unit ball graphs

Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang, Xiaoyan Zhang

11.11.2019 | Ausgabe 1/2020 Open Access

Remarks on Barnette’s conjecture

Jan Florek

19.10.2019 | Ausgabe 1/2020

Tree-coloring problems of bounded treewidth graphs

Bi Li, Xin Zhang

24.10.2019 | Ausgabe 1/2020

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

29.10.2019 | Ausgabe 1/2020

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

07.11.2019 | Ausgabe 1/2020

Efficient algorithms for measuring the funnel-likeness of DAGs

Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

22.10.2019 | Ausgabe 1/2020

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve

Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia

06.11.2019 | Ausgabe 1/2020 Open Access

On the König deficiency of zero-reducible graphs

Miklós Bartha, Miklós Krész

07.11.2019 | Ausgabe 1/2020

Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13

Chao Song, Changqing Xu

Aktuelle Ausgaben

Premium Partner