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.

2011, volume 21, articles 4

Semi-online scheduling on two uniform machines with the known largest size pp. 393-408

Sheng-Yi Cai and Qi-Fan Yang

Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction pp. 409-422

Bin Ma and Louxin Zhang

On the number of separable partitions pp. 423-433

Frank K. Hwang and Uriel G. Rothblum

A Branch and Cut solver for the maximum stable set problem pp. 434-457

Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt and Panos M. Pardalos

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling pp. 458-480

György Dósa, M. Grazia Speranza and Zsolt Tuza

On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2) pp. 481-496

Haoli Wang, Xirong Xu, Yuansheng Yang and Kai Lü

Approximation scheme for restricted discrete gate sizing targeting delay minimization pp. 497-510

Chen Liao and Shiyan Hu

2011, volume 21, articles 3

Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems pp. 269-292

Luis A. Dupont and Rafael H. Villarreal

Approximation algorithms for multicast routing in ad hoc wireless networks pp. 293-305

Deying Li and Qinghua Zhu

The k-coloring fitness landscape pp. 306-329

Hend Bouziri, Khaled Mellouli and El-Ghazali Talbi

Hardness and algorithms for rainbow connection pp. 330-347

Sourav Chakraborty, Eldar Fischer, Arie Matsliah and Raphael Yuster

Data aggregation for p-median problems pp. 348-363

Bader F. AlBdaiwi, Diptesh Ghosh and Boris Goldengorin

Approximating k-generalized connectivity via collapsing HSTs pp. 364-382

Danny Segev

On the generalized constrained longest common subsequence problems pp. 383-392

Yi-Ching Chen and Kun-Mao Chao

2011, volume 21, articles 2

On the parameterized complexity of the Multi-MCT and Multi-MCST problems pp. 151-158

Wenbin Chen, Matthew C. Schmidt and Nagiza F. Samatova

Efficient algorithms for supergraph query processing on graph databases pp. 159-191

Shuo Zhang, Xiaofeng Gao, Weili Wu, Jianzhong Li and Hong Gao

Approximation and hardness results for label cut and related problems pp. 192-208

Peng Zhang, Jin-Yi Cai, Lin-Qing Tang and Wen-Bo Zhao

Bounding the total domination subdivision number of a graph in terms of its order pp. 209-218

Odile Favaron, Hossein Karami and Seyyed Mahmoud Sheikholeslami

Approximating the chromatic index of multigraphs pp. 219-246

Guantao Chen, Xingxing Yu and Wenan Zang

Minimizing the sum cost in linear extensions of a poset pp. 247-253

Longcheng Liu, Biao Wu and Enyu Yao

Approximating capacitated tree-routings in networks pp. 254-267

Ehab Morsy and Hiroshi Nagamochi

2011, volume 21, articles 1

Preface pp. 1-1

Xiaodong Hu and Jie Wang

Covering directed graphs by in-trees pp. 2-18

Naoyuki Kamiyama and Naoki Katoh

Compact labelings for efficient first-order model-checking pp. 19-46

Bruno Courcelle, Cyril Gavoille and Mamadou Moustapha Kanté

Visual cryptography on graphs pp. 47-66

Steve Lu, Daniel Manchala and Rafail Ostrovsky

New algorithms for online rectangle filling with k-lookahead pp. 67-82

Haitao Wang, Amitabh Chaudhary and Danny Z. Chen

Average-case competitive analyses for one-way trading pp. 83-107

Hiroshi Fujiwara, Kazuo Iwama and Yoshiyuki Sekiguchi

A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints pp. 108-123

Hung Q. Ngo, Anh Le and Yang Wang

The orbit problem is in the GapL hierarchy pp. 124-137

V. Arvind and T. C. Vijayaraghavan

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times pp. 138-149

Ming Liu, Chengbin Chu, Yinfeng Xu and Feifeng Zheng

2010, volume 20, articles 4

Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2 pp. 325-334

Zengti Li, Suogang Gao, Hongjie Du, Feng Zou and Weili Wu

Separator-based data reduction for signed graph balancing pp. 335-360

Falk Hüffner, Nadja Betzler and Rolf Niedermeier

An approximation algorithm for the k-level capacitated facility location problem pp. 361-368

Donglei Du, Xing Wang and Dachuan Xu

Semi-online scheduling with known maximum job size on two uniform machines pp. 369-384

Qian Cao and Zhaohui Liu

Strong formulation for the spot 5 daily photograph scheduling problem pp. 385-398

Glaydston Mattos Ribeiro, Miguel Fragoso Constantino and Luiz Antonio Nogueira Lorena

Polynomial time approximation schemes for minimum disk cover problems pp. 399-412

Chen Liao and Shiyan Hu

Constructing error-correcting pooling designs with symplectic space pp. 413-421

Jun Guo, Yuexuan Wang, Suogang Gao, Jiangchen Yu and Weili Wu

A polynomially solvable case of optimal linear extension problem of a poset pp. 422-428

Biao Wu, Enyu Yao and Longcheng Liu

On the max-weight edge coloring problem pp. 429-442

Giorgio Lucarelli, Ioannis Milis and Vangelis T. Paschos

2010, volume 20, articles 3

An upper bound on the total restrained domination number of a tree pp. 205-223

Johannes H. Hattingh, Elizabeth Jonck and Ernst J. Joubert

Embedded paths and cycles in faulty hypercubes pp. 224-248

Nelson Castañeda and Ivan S. Gotchev

Hardness of k-Vertex-Connected Subgraph Augmentation Problem pp. 249-258

Changcun Ma, Donghyun Kim, Yuexuan Wang, Wei Wang, Nassim Sohaee and Weili Wu

Cost sharing and strategyproof mechanisms for set cover games pp. 259-284

Xiang-Yang Li, Zheng Sun, Weizhao Wang and Wei Lou

On-line machine scheduling with batch setups pp. 285-306

Lele Zhang and Andrew Wirth

Incremental Facility Location Problem and Its Competitive Algorithms pp. 307-320

Wenqiang Dai and Xianju Zeng

A short proof of a result on a Vizing-like problem for integer total domination pp. 321-323

Michael A. Henning

2010, volume 20, articles 2

A hybrid beam search looking-ahead algorithm for the circular packing problem pp. 101-130

Hakim Akeb and Mhand Hifi

The p-maxian problem on block graphs pp. 131-141

Liying Kang and Yukun Cheng

The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design pp. 142-160

Geng-Sheng Zhang and Yu-Qin Yang

Online scheduling with a buffer on related machines pp. 161-179

György Dósa and Leah Epstein

Algorithms and time complexity of the request-service problem pp. 180-193

Chunmei Liu, Legand Burge and Ajoni Blake

Well paired-dominated graphs pp. 194-204

S. L. Fitzpatrick and B. L. Hartnell

2010, volume 20, articles 1

Finding checkerboard patterns via fractional 0–1 programming pp. 1-26

Andrew Trapp, Oleg A. Prokopyev and Stanislav Busygin

Median problems with positive and negative weights on cycles and cacti pp. 27-46

Rainer E. Burkard and Johannes Hatzl

EiSIRS: a formal model to analyze the dynamics of worm propagation in wireless sensor networks pp. 47-62

Xiaoming Wang, Qiaoliang Li and Yingshu Li

Periodic complementary binary sequences and Combinatorial Optimization algorithms pp. 63-75

I. S. Kotsireas, C. Koukouvinos, P. M. Pardalos and O. V. Shylo

On the total domination subdivision number in some classes of graphs pp. 76-84

O. Favaron, H. Karami, R. Khoeilar and S. M. Sheikholeslami

A note on hierarchical scheduling on two uniform machines pp. 85-95

Zhiyi Tan and An Zhang

New error-correcting pooling designs associated with finite vector spaces pp. 96-100

Jizhu Nan and Jun Guo