Journal of Combinatorial Optimization

1997 - 2025

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

2017, volume 34, articles 4

A sufficient condition for planar graphs to be (3, 1)-choosable pp. 987-1011

Min Chen, Yingying Fan, Yiqiao Wang and Weifan Wang

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs pp. 1012-1028

Zemin Jin, Yuefang Sun, Sherry H. F. Yan and Yuping Zang

Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ 2 π / 3 antennas pp. 1029-1051

Tien Tran, Min Kyung An and Dung T. Huynh

Approximation for vertex cover in $$\beta $$ β -conflict graphs pp. 1052-1059

Dongjing Miao, Zhipeng Cai, Weitian Tong and Jianzhong Li

The k-hop connected dominating set problem: approximation and hardness pp. 1060-1083

Rafael S. Coelho, Phablo F. S. Moura and Yoshiko Wakabayashi

An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs pp. 1084-1095

Wei Ding and Ke Qiu

Competitive analysis of bi-directional non-preemptive conversion pp. 1096-1113

Günter Schmidt

On the Langberg–Médard multiple unicast conjecture pp. 1114-1132

Kai Cai and Guangyue Han

A primal–dual online algorithm for the k-server problem on weighted HSTs pp. 1133-1146

Wenbin Chen, Fufang Li, Jianxiong Wang, Ke Qi, Maobin Tang and Xiuni Wang

Neighbor sum distinguishing total coloring of planar graphs without 4-cycles pp. 1147-1158

Hongjie Song and Changqing Xu

Discrete parallel machine makespan ScheLoc problem pp. 1159-1186

Corinna Heßler and Kaouthar Deghdak

An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities pp. 1187-1197

Ruyan Fu, Ji Tian, Shisheng Li and Jinjiang Yuan

Bin packing under linear constraints pp. 1198-1209

Zhenbo Wang and Kameng Nip

Hamiltonian numbers in oriented graphs pp. 1210-1217

Li-Da Tong and Hao-Yu Yang

Change-making problems revisited: a parameterized point of view pp. 1218-1236

Steffen Goebbels, Frank Gurski, Jochen Rethmann and Eda Yilmaz

Online set multicover algorithms for dynamic D2D communications pp. 1237-1264

Alan Kuhnle, Xiang Li, J. David Smith and My T. Thai

The computational complexity of QoS measures for orchestrations pp. 1265-1301

Joaquim Gabarro, Sergio Leon-Gaixas and Maria Serna

2-Distance coloring of planar graphs with girth 5 pp. 1302-1322

Wei Dong and Baogang Xu

2017, volume 34, articles 3

Total coloring of outer-1-planar graphs with near-independent crossings pp. 661-675

Xin Zhang

Cost sharing on prices for games on graphs pp. 676-688

Daniel Li Li and Erfang Shan

Near optimal algorithms for online weighted bipartite matching in adversary model pp. 689-705

Xiaoming Sun, Jia Zhang and Jialin Zhang

On the L(2, 1)-labeling conjecture for brick product graphs pp. 706-724

Zehui Shao, Xiaosong Zhang, Huiqin Jiang, Bo Wang and Juanjuan He

Maximum coverage problem with group budget constraints pp. 725-735

Boaz Farbstein and Asaf Levin

Note on power propagation time and lower bounds for the power domination number pp. 736-741

Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter and Michael Young

Neighbor-sum-distinguishing edge choosability of subcubic graphs pp. 742-759

Jingjing Huo, Yiqiao Wang and Weifan Wang

Is there any polynomial upper bound for the universal labeling of graphs? pp. 760-770

Arash Ahadi, Ali Dehghan and Morteza Saghafian

Disconnected $$g_c$$ g c -critical graphs pp. 771-780

Xia Zhang

Optimization techniques for multivariate least trimmed absolute deviation estimation pp. 781-797

G. Zioutas, C. Chatzinakos, T. D. Nguyen and L. Pitsoulis

Neighbor sum distinguishing index of 2-degenerate graphs pp. 798-809

Xiaolan Hu, Yaojun Chen, Rong Luo and Zhengke Miao

A two-phase algorithm for bin stretching with stretching factor 1.5 pp. 810-828

Martin Böhm, Jiří Sgall, Rob Stee and Pavel Veselý

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5 pp. 829-829

Martin Böhm, Jiří Sgall, Rob Stee and Pavel Veselý

A refined algorithm for maximum independent set in degree-4 graphs pp. 830-873

Mingyu Xiao and Hiorshi Nagamochi

On list r-hued coloring of planar graphs pp. 874-890

Haiyang Zhu, Sheng Chen, Lianying Miao and Xinzhong Lv

The traveling salesman problem on grids with forbidden neighborhoods pp. 891-915

Anja Fischer and Philipp Hungerländer

Nordhaus–Gaddum type result for the matching number of a graph pp. 916-930

Huiqiu Lin, Jinlong Shu and Baoyindureng Wu

Multiple facility location on a network with linear reliability order of edges pp. 931-955

Refael Hassin, R. Ravi and F. Sibel Salman

A simple approximation algorithm for minimum weight partial connected set cover pp. 956-963

Yubai Zhang, Yingli Ran and Zhao Zhang

On global integer extrema of real-valued box-constrained multivariate quadratic functions pp. 964-986

Sascha Wörz

2017, volume 34, articles 2

Single-machine scheduling with production and rejection costs to minimize the maximum earliness pp. 331-342

Lingfa Lu and Liqi Zhang

The Weight Function Lemma for graph pebbling pp. 343-361

Glenn Hurlbert

Two-agent scheduling of time-dependent jobs pp. 362-377

Cheng He and Joseph Y.-T. Leung

A note on (s, t)-relaxed L(2, 1)-labeling of graphs pp. 378-382

Taiyin Zhao and Guangmin Hu

The adjacent vertex distinguishing total chromatic numbers of planar graphs with $$\Delta =10$$ Δ = 10 pp. 383-397

Xiaohan Cheng, Guanghui Wang and Jianliang Wu

Fibonacci helps to evacuate from a convex region in a grid network pp. 398-413

Lan Qin and Yinfeng Xu

On the vertex cover $$P_3$$ P 3 problem parameterized by treewidth pp. 414-425

Jianhua Tu, Lidong Wu, Jing Yuan and Lei Cui

Equitable vertex arboricity of 5-degenerate graphs pp. 426-432

Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang and Jianliang Wu

Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans pp. 433-440

Jinjiang Yuan

Improved upper bound for the degenerate and star chromatic numbers of graphs pp. 441-452

Jiansheng Cai, Xueliang Li and Guiying Yan

On the online multi-agent O–D k-Canadian Traveler Problem pp. 453-461

Davood Shiri and F. Sibel Salman

Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values pp. 462-482

Guang Zhang, Erfang Shan, Liying Kang and Yanxia Dong

Online scheduling to minimize the total weighted completion time plus the rejection cost pp. 483-503

Ran Ma and Jinjiang Yuan

On Motzkin–Straus type results for non-uniform hypergraphs pp. 504-521

Qingsong Tang, Yuejian Peng, Xiangde Zhang and Cheng Zhao

Fractional matching preclusion of graphs pp. 522-533

Yan Liu and Weiwei Liu

Total edge irregularity strength of accordion graphs pp. 534-544

Muhammad Kamran Siddiqui, Deeba Afzal and Muhammad Ramzan Faisal

Distance domination in graphs with given minimum and maximum degree pp. 545-553

Michael A. Henning and Nicolas Lichiardopol

Recoverable robust spanning tree problem under interval uncertainty representations pp. 554-573

Mikita Hradovich, Adam Kasperski and Paweł Zieliński

On maximum Wiener index of trees and graphs with given radius pp. 574-587

Kinkar Ch. Das and M. J. Nadjafi-Arani

Triple-solution approach for the strip packing problem with two-staged patterns pp. 588-604

Yi-Ping Cui, Yongwu Zhou and Yaodong Cui

A note on orientation and chromatic number of graphs pp. 605-611

Manouchehr Zaker

Independent sets in some classes of $$S_{i, j, k}$$ S i, j, k -free graphs pp. 612-630

T. Karthick

Task assignment in tree-like hierarchical structures pp. 631-655

Cem Evrendilek, Ismail Hakki Toroslu and Seyedsasan Hashemikhabir

Matching and domination numbers in r-uniform hypergraphs pp. 656-659

Liying Kang, Shan Li, Yanxia Dong and Erfang Shan

2017, volume 34, articles 1

The k-metric dimension pp. 1-30

Ron Adar and Leah Epstein

Lawler’s minmax cost problem under uncertainty pp. 31-46

Nadia Brauner, Gerd Finke and Yakov Shafransky

Parameterized algorithms for min–max 2-cluster editing pp. 47-63

Li-Hsuan Chen and Bang Ye Wu

Neighbor sum distinguishing total coloring of 2-degenerate graphs pp. 64-70

Jingjing Yao, Xiaowei Yu, Guanghui Wang and Changqing Xu

An exact semidefinite programming approach for the max-mean dispersion problem pp. 71-93

Michele Garraffa, Federico Della Croce and Fabio Salassa

On zero-sum $$\mathbb {Z}_{2j}^k$$ Z 2 j k -magic graphs pp. 94-113

J. P. Georges, D. Mauro and K. Wash

Modified linear programming and class 0 bounds for graph pebbling pp. 114-132

Daniel W. Cranston, Luke Postle, Chenxiao Xue and Carl Yerger

Minimizing the number of tardy jobs in two-machine settings with common due date pp. 133-140

Federico Della Croce, Christos Koulamas and Vincent T’kindt

On minimally 2-connected graphs with generalized connectivity $$\kappa _{3}=2$$ κ 3 = 2 pp. 141-164

Shasha Li, Wei Li, Yongtang Shi and Haina Sun

Upper bounds of proper connection number of graphs pp. 165-173

Fei Huang, Xueliang Li and Shujing Wang

Note on incidence chromatic number of subquartic graphs pp. 174-181

Petr Gregor, Borut Lužar and Roman Soták

Rainbow connection numbers of Cayley graphs pp. 182-193

Yingbin Ma and Zaiping Lu

The thickness of the complete multipartite graphs and the join of graphs pp. 194-202

Yichao Chen and Yan Yang

A faster strongly polynomial time algorithm to solve the minimum cost tension problem pp. 203-217

Mehdi Ghiyasvand

The minimum value of geometric-arithmetic index of graphs with minimum degree 2 pp. 218-232

Mahdi Sohrabi-Haghighat and Mohammadreza Rostami

Characterizations of k-cutwidth critical trees pp. 233-244

Zhen-Kun Zhang and Hong-Jian Lai

Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields pp. 245-256

Yingmo Jie, Cheng Guo and Zhangjie Fu

Total coloring of planar graphs without adjacent chordal 6-cycles pp. 257-265

Huijuan Wang, Bin Liu, Xiaoli Wang, Guangmo Tong, Weili Wu and Hongwei Gao

Approximation algorithms for k-level stochastic facility location problems pp. 266-278

Lucas P. Melo, Flávio K. Miyazawa, Lehilton L. C. Pedrosa and Rafael C. S. Schouery

Maximizing target-temporal coverage of mission-driven camera sensor networks pp. 279-301

Yi Hong, Deying Li, Donghyun Kim, Wenping Chen, Jiguo Yu and Alade O. Tokuta

Local ratio method on partial set multi-cover pp. 302-313

Yingli Ran, Yishuo Shi and Zhao Zhang

Centralized and decentralized rumor blocking problems pp. 314-329

Xin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang and Ker-I Ko