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.

2016, volume 32, articles 4

Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference pp. 983-984

Zhipeng Cai, Chaokun Wang and Anu Bourgeois

$$(\alpha, \tau )$$ ( α, τ ) -Monitoring for event detection in wireless sensor networks pp. 985-1001

Ran Bi, Jianzhong Li, Hong Gao and Yingshu Li

Approximate event detection over multi-modal sensing data pp. 1002-1016

Jing Gao, Jianzhong Li and Yingshu Li

An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding pp. 1017-1035

Chenchen Wu, Dachuan Xu, Donglei Du and Wenqing Xu

On the performance of mildly greedy players in cut games pp. 1036-1051

Vittorio Bilò and Mauro Paladini

An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models pp. 1052-1067

Cui Wang, Jiguo Yu, Dongxiao Yu, Baogui Huang and Shanshan Yu

Efficient accuracy evaluation for multi-modal sensed data pp. 1068-1088

Yan Zhang, Hongzhi Wang, Hong Gao and Jianzhong Li

Directed Steiner trees with diffusion costs pp. 1089-1106

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz and Dominique Barth

Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results pp. 1107-1132

Tim Wylie, Michael A. Schuh and Rafal A. Angryk

Approximate sorting of data streams with limited storage pp. 1133-1164

Farzad Farnoud, Eitan Yaakobi and Jehoshua Bruck

Exemplar or matching: modeling DCJ problems with unequal content genome data pp. 1165-1181

Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer and David A. Bader

Reconfiguration of dominating sets pp. 1182-1195

Akira Suzuki, Amer E. Mouawad and Naomi Nishimura

Editorial for Special Issue: COCOA2014 pp. 1196-1196

Zhao Zhang

Towards the price of leasing online pp. 1197-1216

Sebastian Abshoff, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide and Peter Pietrzyk

Approximation schemes for Euclidean vehicle routing problems with time windows pp. 1217-1231

Liang Song, Hejiao Huang and Hongwei Du

Serve or skip: the power of rejection in online bottleneck matching pp. 1232-1253

Barbara M. Anthony and Christine Chung

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing pp. 1254-1287

Annalisa De Bonis

The minimum vulnerability problem on specific graph classes pp. 1288-1304

Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad and Xiao Zhou

The popular matching and condensation problems under matroid constraints pp. 1305-1326

Naoyuki Kamiyama

A practical greedy approximation for the directed Steiner tree problem pp. 1327-1370

Dimitri Watel and Marc-Antoine Weisser

Integer programming methods for special college admissions problems pp. 1371-1399

Kolos Agoston, Péter Biró and Iain McBride

2016, volume 32, articles 3

Improved algorithmic results for unsplittable stable allocation problems pp. 657-671

Ágnes Cseh and Brian C. Dean

Solving constrained optimization problems by solution-based decomposition search pp. 672-695

Amine Lamine, Mahdi Khemakhem, Brahim Hnich and Habib Chabchoub

Robustness of power-law networks: its assessment and optimization pp. 696-720

Huiling Zhang, Yilin Shen and My T. Thai

On strongly planar not-all-equal 3SAT pp. 721-724

Ali Dehghan

Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs pp. 725-740

Shasha Ma and Liancui Zuo

The extremal spectral radii of $$k$$ k -uniform supertrees pp. 741-764

Honghai Li, Jia-Yu Shao and Liqun Qi

A combinatorial proof for the circular chromatic number of Kneser graphs pp. 765-774

Daphne Der-Fen Liu and Xuding Zhu

First-Fit colorings of graphs with no cycles of a prescribed even length pp. 775-783

Manouchehr Zaker and Hossein Soltani

Scheduling two job families on a single machine with two competitive agents pp. 784-799

Shi-Sheng Li, Ren-Xia Chen and Qi Feng

Characterisation of forests with trivial game domination numbers pp. 800-811

M. J. Nadjafi-Arani, Mark Siggers and Hossein Soltani

A minimized-rule based approach for improving data currency pp. 812-841

Mohan Li and Jianzhong Li

The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation pp. 842-854

Sabine Büttner and Sven O. Krumke

Signed total Roman domination in graphs pp. 855-871

Lutz Volkmann

The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance pp. 872-884

Kien Trung Nguyen and Ali Reza Sepasian

Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period pp. 885-905

Natashia Boland, Thomas Kalinowski and Simranjit Kaur

Neighbor sum distinguishing total choosability of planar graphs pp. 906-916

Cunquan Qu, Guanghui Wang, Guiying Yan and Xiaowei Yu

Finding a contra-risk path between two nodes in undirected graphs pp. 917-926

Mehdi Ghiyasvand and Iman Keshtkar

A $$(3,1)^{*}$$ ( 3, 1 ) ∗ -choosable theorem on planar graphs pp. 927-940

Min Chen, André Raspaud and Weifan Wang

Maximum size of digraphs with some parameters pp. 941-950

Huiqiu Lin, Jinlong Shu and Baoyindureng Wu

Packing feedback arc sets in reducible flow graphs pp. 951-959

Han Xiao

A diagnosis algorithm by using graph-coloring under the PMC model pp. 960-969

Qiang Zhu, Guodong Guo, Wenliang Tang and Cun-Quan Zhang

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval pp. 970-981

Imed Kacem, Hans Kellerer and Maryam Seifaddini

2016, volume 32, articles 2

Introduction: Special issue dedicated to the memory of professor Wenqi Huang pp. 331-340

Weidong Chen and Zhixiang Chen

Optimal space coverage with white convex polygons pp. 341-353

Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi and MohammadAli Safari

Euclidean movement minimization pp. 354-367

Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi and MohammadAli Safari

Multi-start iterated tabu search for the minimum weight vertex cover problem pp. 368-384

Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding and Bo Peng

Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness pp. 385-395

Qijia Liu and Jinjiang Yuan

Multi-neighborhood based path relinking for two-sided assembly line balancing problem pp. 396-415

Zhaoyang Yang, Guojun Zhang and Haiping Zhu

A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang pp. 416-444

Lei Wang and Aihua Yin

Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem pp. 445-468

Xinyun Wu, Shengfeng Yan, Xin Wan and Zhipeng Lü

A three-phased local search approach for the clique partitioning problem pp. 469-491

Yi Zhou, Jin-Kao Hao and Adrien Goëffon

Tabu search for the real-world carpooling problem pp. 492-512

Can Huang, Defu Zhang, Yain-Whar Si and Stephen C. H. Leung

A hybrid algorithm based on variable neighbourhood for the strip packing problem pp. 513-530

Defu Zhang, Yuxin Che, Furong Ye, Yain-Whar Si and Stephen C. H. Leung

Solving the maximum vertex weight clique problem via binary quadratic programming pp. 531-549

Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü and Qinghua Wu

The expected values of Hosoya index and Merrifield–Simmons index in a random polyphenylene chain pp. 550-562

Guihua Huang, Meijun Kuang and Hanyuan Deng

An effective discrete dynamic convexized method for solving the winner determination problem pp. 563-593

Geng Lin, Wenxing Zhu and M. Montaz Ali

An $$O^{*}(1.4366^n)$$ O ∗ ( 1. 4366 n ) -time exact algorithm for maximum $$P_2$$ P 2 -packing in cubic graphs pp. 594-607

Maw-Shang Chang, Li-Hsuan Chen and Ling-Ju Hung

Total and paired domination numbers of $$C_m$$ C m bundles over a cycle $$C_n$$ C n pp. 608-625

Fu-Tao Hu, Moo Young Sohn and Xue-gang Chen

A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles pp. 626-638

Jihui Wang, Qiaoling Ma, Xue Han and Xiuyun Wang

A note on the duality between matchings and vertex covers in balanced hypergraphs pp. 639-644

Robert Scheidweiler and Eberhard Triesch

An improved bound on 2-distance coloring plane graphs with girth 5 pp. 645-655

Wei Dong and Wensong Lin

2016, volume 32, articles 1

Special Issue for FAW 2014 pp. 1-2

Jianer Chen and John E. Hopcroft

Algorithms for the workflow satisfiability problem engineered for counting constraints pp. 3-24

D. Cohen, J. Crampton, A. Gagarin, G. Gutin and M. Jones

Dynamic matchings in left vertex weighted convex bipartite graphs pp. 25-50

Quan Zu, Miaomiao Zhang and Bin Yu

Performances of pure random walk algorithms on constraint satisfaction problems with growing domains pp. 51-66

Wei Xu and Fuzhou Gong

Kernelization and randomized Parameterized algorithms for Co-path Set problem pp. 67-78

Qilong Feng, Qian Zhou and Jianxin Wang

Constrained pairwise and center-star sequences alignment problems pp. 79-94

Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang and Jianyu Shi

Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs pp. 95-110

Hao Chen, Zihan Lei, Tian Liu, Ziyang Tang, Chaoyi Wang and Ke Xu

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees pp. 111-143

Feng Shi, Qilong Feng, Jie You and Jianxin Wang

Efficient approximation algorithms for computing k disjoint constrained shortest paths pp. 144-158

Longkun Guo

Partial degree bounded edge packing problem for graphs and $$k$$ k -uniform hypergraphs pp. 159-173

Pawan Aurora, Sumit Singh and Shashank K. Mehta

Strong minimum energy hierarchical topology in wireless sensor networks pp. 174-187

B. S. Panda and D. Pushparaj Shetty

List edge and list total coloring of planar graphs with maximum degree 8 pp. 188-197

Huijuan Wang, Bin Liu, Xin Zhang, Lidong Wu, Weili Wu and Hongwei Gao

New analysis and computational study for the planar connected dominating set problem pp. 198-225

Marjan Marzban, Qian-Ping Gu and Xiaohua Jia

A complexity dichotomy and a new boundary class for the dominating set problem pp. 226-243

D. S. Malyshev

2-Distance coloring of a planar graph without 3, 4, 7-cycles pp. 244-259

Yuehua Bu and Xia Lv

Upper bounds for the total rainbow connection of graphs pp. 260-266

Hui Jiang, Xueliang Li and Yingying Zhang

Computing unique maximum matchings in $$O(m)$$ O ( m ) time for König–Egerváry graphs and unicyclic graphs pp. 267-277

Vadim E. Levit and Eugen Mandrescu

Distributed wireless link scheduling in the SINR model pp. 278-292

Dongxiao Yu, Yuexuan Wang, Qiangsheng Hua, Jiguo Yu and Francis C. M. Lau

On strongly planar 3SAT pp. 293-298

Lidong Wu

Signed mixed Roman domination numbers in graphs pp. 299-317

H. Abdollahzadeh Ahangar, L. Asgharsharghi, S. M. Sheikholeslami and L. Volkmann

Complete forcing numbers of primitive coronoids pp. 318-330

Shou-Jun Xu, Xiu-Song Liu, Wai Hong Chan and Heping Zhang