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.

2013, volume 26, articles 4

The topology aware file distribution problem pp. 621-635

Shawn T. O’Neil, Amitabh Chaudhary, Danny Z. Chen and Haitao Wang

Property testing for cyclic groups and beyond pp. 636-654

François Le Gall and Yuichi Yoshida

Optimal strategies for the one-round discrete Voronoi game on a line pp. 655-669

Aritra Banik, Bhaswar B. Bhattacharya and Sandip Das

Unavoidable regularities in long words with bounded number of symbol occurrences pp. 670-686

Juha Kortelainen, Tuomas Kortelainen and Ari Vesanen

(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation pp. 687-708

Yuichi Asahiro, Kenta Kanmera and Eiji Miyano

Finding paths with minimum shared edges pp. 709-722

Masoud T. Omran, Jörg-Rüdiger Sack and Hamid Zarrabi-Zadeh

The density maximization problem in graphs pp. 723-754

Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter and Dorothea Wagner

Flipping triangles and rectangles pp. 755-769

Minghui Jiang

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs pp. 770-785

B. S. Panda and D. Pradhan

On the cores of games arising from integer edge covering functions of graphs pp. 786-798

Boram Park, Suh-Ryung Kim and Hye Kyung Kim

A new three-machine shop scheduling: complexity and approximation algorithm pp. 799-810

Jianming Dong, Yong Chen, An Zhang and Qifan Yang

A note on anti-coordination and social interactions pp. 811-818

Zhigang Cao and Xiaoguang Yang

L(d,1)-labelings of the edge-path-replacement of a graph pp. 819-831

Damei Lü and Nianfeng Lin

Largest area convex hull of imprecise data based on axis-aligned squares pp. 832-859

Wenqi Ju, Jun Luo, Binhai Zhu and Ovidiu Daescu

2013, volume 26, articles 3

Preface pp. 415-415

Guangting Chen, Guohui Lin and Zhiyi Tan

Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations pp. 416-436

Gyorgy Dosa, Zsolt Tuza and Deshi Ye

Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration pp. 437-447

Min Ji, Chou-Jung Hsu and Dar-Li Yang

Semi-online scheduling for jobs with release times pp. 448-464

Rongheng Li, Liying Yang, Xiaoqiong He, Qiang Chen and Xiayan Cheng

On the mod sum number of H m,n pp. 465-471

Wenqing Dou

Semi-online scheduling on two identical machines with rejection pp. 472-479

Xiao Min, Yuqing Wang, Jing Liu and Min Jiang

Online LPT algorithms for parallel machines scheduling with a single server pp. 480-488

Chunjie Su

Single machine scheduling problems with subcontracting options pp. 489-498

Weiya Zhong and Zhiming Huo

Relay node placement in two-tiered wireless sensor networks with base stations pp. 499-508

Guangting Chen and Suhui Cui

Minimizing the maximum bump cost in linear extensions of a poset pp. 509-519

Biao Wu, Longcheng Liu and Enyu Yao

Algorithms for the maximum k-club problem in graphs pp. 520-554

Shahram Shahinpour and Sergiy Butenko

Applications of extension grey prediction model for power system forecasting pp. 555-567

Wei Niu, Juan Cheng and Guoqing Wang

A bilevel programming problem with maximization of a supermodular function in the lower level pp. 568-584

Diana Fanghänel

Minimum degree, edge-connectivity and radius pp. 585-591

Baoyindureng Wu, Xinhui An, Guojie Liu, Guiying Yan and Xiaoping Liu

Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs pp. 592-607

Bang Ye Wu

Roman domination on strongly chordal graphs pp. 608-619

Chun-Hung Liu and Gerard J. Chang

2013, volume 26, articles 2

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing pp. 223-236

Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting and Xin Han

Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints pp. 237-250

Martin Birks, Daniel Cole, Stanley P. Y. Fung and Huichao Xue

The k-Canadian Travelers Problem with communication pp. 251-265

Huili Zhang, Yinfeng Xu and Lan Qin

On some geometric problems of color-spanning sets pp. 266-283

Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu and Ovidiu Daescu

Approximation algorithm for uniform bounded facility location problem pp. 284-291

Weng Kerui

Tight approximation bounds for combinatorial frugal coverage algorithms pp. 292-309

Ioannis Caragiannis, Christos Kaklamanis and Maria Kyropoulou

The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders pp. 310-332

Franz J. Brandenburg, Andreas Gleißner and Andreas Hofmeier

A tight analysis of Brown-Baker-Katseff sequences for online strip packing pp. 333-344

W. Kern and J. J. Paulus

Optimal job insertion in the no-wait job shop pp. 345-371

Reinhard Bürgy and Heinz Gröflin

Objective functions with redundant domains pp. 372-384

Fatima Affif Chaouche, Carrie Rutherford and Robin Whitty

L(2,1)-labelings of the edge-path-replacement of a graph pp. 385-392

Lü Damei

Super-cyclically edge-connected regular graphs pp. 393-411

Jin-Xin Zhou and Yan-Quan Feng

Erratum to: Tight bound for matching pp. 412-414

Yijie Han

2013, volume 26, articles 1

The three-dimensional matching problem in Kalmanson matrices pp. 1-9

Sergey Polyakovskiy, Frits C. R. Spieksma and Gerhard J. Woeginger

On the outer-connected domination in graphs pp. 10-18

M. H. Akhbari, R. Hasni, O. Favaron, H. Karami and S. M. Sheikholeslami

Parameterized complexity of k-anonymity: hardness and tractability pp. 19-43

Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi and Yuri Pirola

Optimal key tree structure for two-user replacement and deletion problems pp. 44-70

Weiwei Wu, Minming Li and Enhong Chen

Maximum latency scheduling problem on two-person cooperative games pp. 71-81

Yanhong Gu, Jing Fan, Guochun Tang and Jiaofei Zhong

On the union of intermediate nodes of shortest paths pp. 82-85

Xiang Li, Xiaodong Hu and Wonjun Lee

An adaptive multistart tabu search approach to solve the maximum clique problem pp. 86-108

Qinghua Wu and Jin-Kao Hao

The maximum flow problem with disjunctive constraints pp. 109-119

Ulrich Pferschy and Joachim Schauer

Independent dominating sets in regular graphs pp. 120-126

Julie Haviland

Approximate min-max relations on plane graphs pp. 127-134

Jie Ma, Xingxing Yu and Wenan Zang

Embeddings of circulant networks pp. 135-151

Indra Rajasingh, Paul Manuel, M. Arockiaraj and Bharati Rajan

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ pp. 152-160

Hervé Hocquard and Mickaël Montassier

Practical unicast and convergecast scheduling schemes for cognitive radio networks pp. 161-177

Shouling Ji, Arif Selcuk Uluagac, Raheem Beyah and Zhipeng Cai

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation pp. 178-189

Cristina Bazgan, Sonia Toubaline and Daniel Vanderpooten

Metric dimension of some distance-regular graphs pp. 190-197

Jun Guo, Kaishun Wang and Fenggao Li

On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines pp. 198-222

Shlomo Karhi and Dvir Shabtay