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.

2018, volume 35, articles 4

Edge-disjoint spanning trees and the number of maximum state circles of a graph pp. 997-1008

Xiaoli Ma, Baoyindureng Wu and Xian’an Jin

Integer programming approach to static monopolies in graphs pp. 1009-1041

Babak Moazzez and Hossein Soltani

Smart elements in combinatorial group testing problems pp. 1042-1060

Dániel Gerbner and Máté Vizer

A feasibility approach for constructing combinatorial designs of circulant type pp. 1061-1085

Francisco J. Aragón Artacho, Rubén Campoy, Ilias Kotsireas and Matthew K. Tam

An optimal Tate pairing computation using Jacobi quartic elliptic curves pp. 1086-1103

Srinath Doss and Roselyn Kaondera-Shava

The number of edges, spectral radius and Hamilton-connectedness of graphs pp. 1104-1127

Ming-Zhu Chen and Xiao-Dong Zhang

FPT-algorithms for some problems related to integer programming pp. 1128-1146

D. V. Gribanov, D. S. Malyshev, P. M. Pardalos and S. I. Veselov

Channel assignment problem and n-fold t-separated $$L(j_1,j_2,\ldots,j_m)$$ L ( j 1, j 2, …, j m ) -labeling of graphs pp. 1147-1167

Wensong Lin and Chenli Shen

A local search approximation algorithm for a squared metric k-facility location problem pp. 1168-1184

Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang and Zhenning Zhang

Dynamic work hour optimization for casual workers pp. 1185-1201

Weimin Ma, Wei Shao and Xiaodong Ji

Maximizing misinformation restriction within time and budget constraints pp. 1202-1240

Canh V. Pham, My T. Thai, Hieu V. Duong, Bao Q. Bui and Huan X. Hoang

Greedy Nim $$_\mathrm{{k}}$$ k Game pp. 1241-1249

Xinzhong Lv, Rongxing Xu and Xuding Zhu

A continuous characterization of the maximum vertex-weighted clique in hypergraphs pp. 1250-1260

Qingsong Tang, Xiangde Zhang, Guoren Wang and Cheng Zhao

Quantile and mean value measures of search process complexity pp. 1261-1285

Jaromír Kukal and Matej Mojzeš

On the lower bounds of random Max 3 and 4-SAT pp. 1286-1299

Guangyan Zhou and Zongsheng Gao

Some extremal results on the colorful monochromatic vertex-connectivity of a graph pp. 1300-1311

Qingqiong Cai, Xueliang Li and Di Wu

On the algorithmic aspects of strong subcoloring pp. 1312-1329

M. A. Shalu, S. Vijayakumar, S. Devi Yamini and T. P. Sandhya

2018, volume 35, articles 3

A randomized competitive group testing procedure pp. 667-683

Guiqing Zhang, Yongxi Cheng and Yinfeng Xu

Minimal path decomposition of complete bipartite graphs pp. 684-702

Costas K. Constantinou and Georgios Ellinas

The Best-or-Worst and the Postdoc problems pp. 703-723

L. Bayón, P. Fortuny Ayuso, J. M. Grau, A. M. Oller-Marcén and M. M. Ruiz

Sparse multipartite graphs as partition universal for graphs with bounded degree pp. 724-739

Qizhong Lin and Yusheng Li

An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs pp. 740-753

Xing Feng, Lianzhu Zhang and Mingzu Zhang

Special cases of the quadratic shortest path problem pp. 754-777

Hao Hu and Renata Sotirov

Neighbor sum distinguishing list total coloring of subcubic graphs pp. 778-793

You Lu, Chuandong Xu and Zhengke Miao

Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem pp. 794-813

Asaf Levin and Aleksander Vainer

The Wiener index of Sierpiński-like graphs pp. 814-841

Chunmei Luo, Liancui Zuo and Philip B. Zhang

Critical objective function values in linear sum assignment problems pp. 842-852

Ivan Belik and Kurt Jörnsten

The matching extension problem in general graphs is co-NP-complete pp. 853-859

Jan Hackfeld and Arie M. C. A. Koster

Race to idle or not: balancing the memory sleep time with DVS for energy minimization pp. 860-894

Chenchen Fu, Vincent Chau, Minming Li and Chun Jason Xue

Complexity and inapproximability results for the Power Edge Set problem pp. 895-905

Sonia Toubaline, Claudia D’Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber and Hadas Shachnai

Generalized acyclic edge colorings via entropy compression pp. 906-920

Laihao Ding, Guanghui Wang and Jianliang Wu

Reliability evaluation of a multicast over coded packet networks pp. 921-940

M. A. Raayatpanah and P. M. Pardalos

Online covering salesman problem pp. 941-954

Huili Zhang and Yinfeng Xu

An approximation algorithm for maximum internal spanning tree pp. 955-979

Zhi-Zhong Chen, Youta Harada, Fei Guo and Lusheng Wang

Planar graphs without chordal 5-cycles are 2-good pp. 980-996

Weifan Wang, Tingting Wu, Xiaoxue Hu and Yiqiao Wang

2018, volume 35, articles 2

The longest commonly positioned increasing subsequences problem pp. 331-340

Xiaozhou He and Yinfeng Xu

Arcs in $$\mathbb Z^2_{2p}$$ Z 2 p 2 pp. 341-349

Zofia Stȩpień and Lucjan Szymaszkiewicz

Tight bounds for NF-based bounded-space online bin packing algorithms pp. 350-364

József Békési and Gábor Galambos

Vertex arboricity of planar graphs without intersecting 5-cycles pp. 365-372

Hua Cai, Jianliang Wu and Lin Sun

On vertex-parity edge-colorings pp. 373-388

Borut Lužar, Mirko Petruševski and Riste Škrekovski

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints pp. 389-408

K. Subramani and Piotr Wojciechowski

A local search approximation algorithm for the uniform capacitated k-facility location problem pp. 409-423

Lu Han, Dachuan Xu, Donglei Du and Dongmei Zhang

Algorithm complexity of neighborhood total domination and $$(\rho,\gamma _{nt})$$ ( ρ, γ n t ) -graphs pp. 424-435

Changhong Lu, Bing Wang and Kan Wang

A characterization of linearizable instances of the quadratic minimum spanning tree problem pp. 436-453

Ante Ćustić and Abraham P. Punnen

Upper bounds for adjacent vertex-distinguishing edge coloring pp. 454-462

Junlei Zhu, Yuehua Bu and Yun Dai

Properly colored trails, paths, and bridges pp. 463-472

Wayne Goddard and Robert Melville

A low complexity semidefinite relaxation for large-scale MIMO detection pp. 473-492

Rupaj Kumar Nayak and Mahendra Prasad Biswal

An approximation algorithm for soft capacitated k-facility location problem pp. 493-511

Yanjun Jiang, Dachuan Xu, Donglei Du, Chenchen Wu and Dongmei Zhang

From theory to practice: maximizing revenues for on-line dial-a-ride pp. 512-529

Ananya Christman, William Forcier and Aayam Poudel

Online lazy bureaucrat scheduling with a machine deadline pp. 530-537

Ling Gai and Guochuan Zhang

The connected disk covering problem pp. 538-554

Yi Xu, Jigen Peng, Wencheng Wang and Binhai Zhu

List-edge-coloring of planar graphs without 6-cycles with three chords pp. 555-562

Haiying Wang and Jianliang Wu

Two-step values for games with two-level communication structure pp. 563-587

Sylvain Béal, Anna Khmelnitskaya and Philippe Solal

Two extremal problems related to orders pp. 588-612

Biao Wu and Yuejian Peng

On computing a minimum secure dominating set in block graphs pp. 613-631

D. Pradhan and Anupriya Jha

Bin packing game with a price of anarchy of $$\frac{3}{2}$$ 3 2 pp. 632-640

Q. Q. Nong, T. Sun, T. C. E. Cheng and Q. Z. Fang

Computational aspects of greedy partitioning of graphs pp. 641-665

Piotr Borowiecki

2018, volume 35, articles 1

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven pp. 1-13

Xiaohan Cheng and Jianliang Wu

A note on domination and total domination in prisms pp. 14-20

Wayne Goddard and Michael A. Henning

A tight lower bound for the hardness of clutters pp. 21-25

Vahan Mkrtchyan and Hovhannes Sargsyan

Harsanyi power solution for games with restricted cooperation pp. 26-47

Zhengxing Zou and Qiang Zhang

Partitioning dense uniform hypergraphs pp. 48-63

Shufei Wu and Jianfeng Hou

Bounds on the domination number of a digraph pp. 64-74

Guoliang Hao and Jianguo Qian

Weak {2}-domination number of Cartesian products of cycles pp. 75-85

Zepeng Li, Zehui Shao and Jin Xu

Rainbow vertex connection of digraphs pp. 86-107

Hui Lei, Shasha Li, Henry Liu and Yongtang Shi

Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility pp. 108-125

Weiya Zhong and Yun Shi

Nordhaus–Gaddum bounds for total Roman domination pp. 126-133

J. Amjadi, S. M. Sheikholeslami and M. Soroudi

Total and forcing total edge-to-vertex monophonic number of a graph pp. 134-147

J. John and K. Uma Samundesvari

Deterministic construction of compressed sensing matrices based on semilattices pp. 148-161

Jun Guo and Junli Liu

Large even factors of graphs pp. 162-169

Jing Chen and Genghua Fan

Competitive intensity and quality maximizing seedings in knock-out tournaments pp. 170-188

Dmitry Dagaev and Alex Suzdaltsev

Algorithms for testing occurrences of length 4 patterns in permutations pp. 189-208

Yijie Han and Sanjeev Saxena

On general threshold and general cascade models of social influence pp. 209-215

Weili Wu, Hongwei Du, Huijuan Wang, Lidong Wu, Zhenhua Duan and Cong Tian

Online MapReduce processing on two identical parallel machines pp. 216-223

Jidan Huang, Feifeng Zheng, Yinfeng Xu and Ming Liu

Partitioning of supply/demand graphs with capacity limitations: an ant colony approach pp. 224-249

Raka Jovanovic, Abdelkader Bousselham and Stefan Voß

The maximum cardinality cut problem in co-bipartite chain graphs pp. 250-265

Arman Boyacı, Tınaz Ekim and Mordechai Shalom

Closed-loop supply chain inventory management with recovery information of reusable containers pp. 266-292

Tianji Yang, Chao Fu, Xinbao Liu, Jun Pei, Lin Liu and Panos M. Pardalos

GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs pp. 293-317

Yan Zhao, Liping Chen, Gang Xie, Jianjun Zhao and Jianwan Ding

Approximation algorithms for precedence-constrained identical machine scheduling with rejection pp. 318-330

Xianzhao Zhang, Dachuan Xu, Donglei Du and Chenchen Wu