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.

2012, volume 23, articles 4

A bicriteria approach to scheduling a single machine with job rejection and positional penalties pp. 395-424

Dvir Shabtay, Nufar Gaspar and Liron Yedidsion

A combinatorial model and algorithm for globally searching community structure in complex networks pp. 425-442

Xiang-Sun Zhang, Zhenping Li, Rui-Sheng Wang and Yong Wang

A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs pp. 443-450

Xu Zhu, Wei Wang, Shan Shan, Zhong Wang and Weili Wu

Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks pp. 451-461

Wei Zhang, Zhao Zhang, Wei Wang, Feng Zou and Wonjun Lee

Hamiltonian numbers of Möbius double loop networks pp. 462-470

Gerard J. Chang, Ting-Pang Chang and Li-Da Tong

Fault-tolerant diameter for three family interconnection networks pp. 471-482

Tongliang Shi and Mei Lu

An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration pp. 483-492

Ming Liu, Feifeng Zheng, Chengbin Chu and Jiantong Zhang

Exact and approximation algorithms for the complementary maximal strip recovery problem pp. 493-506

Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang and Binhai Zhu

Perfect matchings in paired domination vertex critical graphs pp. 507-518

Shenwei Huang, Erfang Shan and Liying Kang

Minimum common string partition revisited pp. 519-527

Haitao Jiang, Binhai Zhu, Daming Zhu and Hong Zhu

Algorithms for the minimum weight k-fold (connected) dominating set problem pp. 528-540

Wenkai Ma, Deying Li and Zhao Zhang

2012, volume 23, articles 3

Flattening topologically spherical surface pp. 309-321

Danny Z. Chen and Ewa Misiołek

Tight bound for matching pp. 322-330

Yijie Han

Constraint bipartite vertex cover: simpler exact algorithms and implementations pp. 331-355

Guoqiang Bai and Henning Fernau

Multi-bidding strategy in sponsored search auctions pp. 356-372

Tian-Ming Bu, Xiaotie Deng and Qi Qi

Estimating hybrid frequency moments of data streams pp. 373-394

Sumit Ganguly, Mohit Bansal and Shruti Dube

2012, volume 23, articles 2

Optimal algorithms for online time series search and one-way trading with interrelated prices pp. 159-166

Wenming Zhang, Yinfeng Xu, Feifeng Zheng and Yucheng Dong

Packing cycles exactly in polynomial time pp. 167-188

Qin Chen and Xujin Chen

An optimal online algorithm for single machine scheduling to minimize total general completion time pp. 189-195

Ming Liu, Chengbin Chu, Yinfeng Xu and Jiazhen Huo

Models for the single-vehicle preemptive pickup and delivery problem pp. 196-223

H. L. M. Kerivin, M. Lacroix and A. R. Mahjoub

Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs pp. 224-251

Neng Fan and Panos M. Pardalos

The total {k}-domatic number of a graph pp. 252-260

S. M. Sheikholeslami and L. Volkmann

An inverse approach to convex ordered median problems in trees pp. 261-273

Elisabeth Gassner

Analysis and approximation for bank selection instruction minimization on partitioned memory architecture pp. 274-291

Minming Li, Tiantian Liu, Chun Jason Xue and Yingchao Zhao

The complexity of VLSI power-delay optimization by interconnect resizing pp. 292-300

Konstantin Moiseev, Avinoam Kolodny and Shmuel Wimer

Constructing weakly connected dominating set for secure clustering in distributed sensor network pp. 301-307

Hongjie Du, Weili Wu, Shan Shan, Donghyun Kim and Wonjun Lee

2012, volume 23, articles 1

The competition number of a graph with exactly two holes pp. 1-8

Bo-Jr Li and Gerard J. Chang

Independent dominating sets in triangle-free graphs pp. 9-20

Wayne Goddard and Jeremy Lyle

Improving an exact approach for solving separable integer quadratic knapsack problems pp. 21-28

Federico Della Croce and Dominique Quadri

Combinatorial algorithms for the maximum k-plex problem pp. 29-49

Benjamin McClosky and Illya V. Hicks

Solving haplotype inference problem with non-genotyped founders via integer linear programming pp. 50-60

Yongxi Cheng and Guohui Lin

A new approach to solve open-partition problems pp. 61-78

Huilan Chang, Frank K. Hwang and Uriel G. Rothblum

On backbone coloring of graphs pp. 79-93

Weifan Wang, Yuehua Bu, Mickaël Montassier and André Raspaud

The max quasi-independent set problem pp. 94-117

N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. T. Paschos and O. Pottié

On the construction of k-connected m-dominating sets in wireless networks pp. 118-139

Yingshu Li, Yiwei Wu, Chunyu Ai and Raheem Beyah

Acyclic chromatic indices of planar graphs with girth at least five pp. 140-157

Qiaojun Shu and Weifan Wang

2011, volume 22, articles 4

A generalization of Macula’s disjunct matrices pp. 495-498

Ping Zhao, Kefeng Diao and Kaishun Wang

Resource-sharing systems and hypergraph colorings pp. 499-508

Wu-Hsiung Lin and Gerard J. Chang

Optimal on-line algorithms for one batch machine with grouped processing times pp. 509-516

Yang Fang, Peihai Liu and Xiwen Lu

The Maximum Box Problem for moving points in the plane pp. 517-530

S. Bereg, J. M. Díaz-Báñez, P. Pérez-Lantero and I. Ventura

Selfish bin coloring pp. 531-548

Leah Epstein, Sven O. Krumke, Asaf Levin and Heike Sperber

Super cyclically edge connected transitive graphs pp. 549-562

Zhao Zhang and Bing Wang

On the vertex characterization of single-shape partition polytopes pp. 563-571

Yu-Chi Liu and Jun-Jie Pan

Revised GRASP with path-relinking for the linear ordering problem pp. 572-593

W. Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos and Mauricio G. C. Resende

Optimality conditions for a bilevel matroid problem pp. 594-608

Diana Fanghänel

A closest vector problem arising in radiation therapy planning pp. 609-629

Céline Engelbeen, Samuel Fiorini and Antje Kiesel

Optimal tree structure with loyal users and batch updates pp. 630-639

Yu-Ki Chan, Minming Li and Weiwei Wu

Co-2-plex polynomials pp. 640-650

Benjamin McClosky, Anthony Simms and Illya V. Hicks

On domination number of Cartesian product of directed paths pp. 651-662

Juan Liu, Xindong Zhang and Jixiang Meng

PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs pp. 663-673

Lidan Fan, Zhao Zhang and Wei Wang

Optimal semi-online algorithm for scheduling with rejection on two uniform machines pp. 674-683

Xiao Min, Jing Liu and Yuqing Wang

Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs pp. 684-698

Chunmei Liu and Yinglei Song

Geometric rounding: a dependent randomized rounding scheme pp. 699-725

Dongdong Ge, Simai He, Yinyu Ye and Jiawei Zhang

Improved floor-planning of graphs via adjacency-preserving transformations pp. 726-746

Huaming Zhang and Sadish Sadasivam

A rearrangement of adjacency matrix based approach for solving the crossing minimization problem pp. 747-762

Neng Fan and Panos M. Pardalos

Fast searching games on graphs pp. 763-777

Donald Stanley and Boting Yang

The multiple sequence sets: problem and heuristic algorithms pp. 778-796

Kang Ning and Hon Wai Leong

Minimizing makespan in an ordered flow shop with machine-dependent processing times pp. 797-818

Byung-Cheon Choi, Joseph Y.-T. Leung and Michael L. Pinedo

SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling pp. 819-844

Karine Deschinkel, Sid-Ahmed-Ali Touati and Sébastien Briais

Polynomially solvable special cases of the quadratic bottleneck assignment problem pp. 845-856

Rainer E. Burkard and Roswitha Rissner

Minimum d-blockers and d-transversals in graphs pp. 857-872

Marie-Christine Costa, Dominique Werra and Christophe Picouleau

A modified power spectral density test applied to weighing matrices with small weight pp. 873-881

Ilias S. Kotsireas, Christos Koukouvinos and Panos M. Pardalos

Improving an upper bound on the size of k-regular induced subgraphs pp. 882-894

Carlos J. Luz

2011, volume 22, articles 3

On the readability of monotone Boolean formulae pp. 293-304

Khaled Elbassioni, Kazuhisa Makino and Imran Rauf

Honeynet games: a game theoretic approach to defending network monitors pp. 305-324

Jin-Yi Cai, Vinod Yegneswaran, Chris Alfeld and Paul Barford

An improved time-space lower bound for tautologies pp. 325-338

Scott Diehl, Dieter Melkebeek and Ryan Williams

Popular matchings: structure and algorithms pp. 339-358

Eric McDermid and Robert W. Irving

Online tree node assignment with resource augmentation pp. 359-377

Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting and Yong Zhang

On the performances of Nash equilibria in isolation games pp. 378-391

Vittorio Bilò, Michele Flammini, Gianpiero Monaco and Luca Moscardelli

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise pp. 392-408

Masaki Yamamoto, Shuji Kijima and Yasuko Matsui

Convex partitions with 2-edge connected dual graphs pp. 409-425

Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine and Csaba D. Tóth

Why locally-fair maximal flows in client-server networks perform well pp. 426-437

Kenneth A. Berman and Chad Yoshikawa

Strongly chordal and chordal bipartite graphs are sandwich monotone pp. 438-456

Pinar Heggernes, Federico Mancini, Charis Papadopoulos and R. Sritharan

On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries pp. 457-468

Ivona Bezáková, Nayantara Bhatnagar and Dana Randall

Sublinear-time algorithms for tournament graphs pp. 469-481

Stefan Dantchev, Tom Friedetzky and Lars Nagel

Separating NE from some nonuniform nondeterministic complexity classes pp. 482-493

Bin Fu, Angsheng Li and Liyu Zhang

2011, volume 22, articles 2

The flexible blocking job shop with transfer and set-up times pp. 121-144

Heinz Gröflin, Dinh Nguyen Pham and Reinhard Bürgy

Pooling designs for clone library screening in the inhibitor complex model pp. 145-152

Fei-huang Chang, Huilan Chang and Frank K. Hwang

An optimal semi-online algorithm for 2-machine scheduling with an availability constraint pp. 153-165

Hongying Li and Chunjie Su

Restrained domination in cubic graphs pp. 166-179

Johannes H. Hattingh and Ernst J. Joubert

A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem pp. 180-201

José Fernando Gonçalves and Mauricio G. C. Resende

Optimal wafer cutting in shuttle layout problems pp. 202-216

Lasse Nisted, David Pisinger and Avri Altman

A characterization of graphs with disjoint dominating and paired-dominating sets pp. 217-234

Justin Southey and Michael A. Henning

Upper paired-domination in claw-free graphs pp. 235-251

Paul Dorbec and Michael A. Henning

Sharp bounds for Zagreb indices of maximal outerplanar graphs pp. 252-269

Ailin Hou, Shuchao Li, Lanzhen Song and Bing Wei

Reconstruction of hidden graphs and threshold group testing pp. 270-281

Huilan Chang, Hong-Bin Chen, Hung-Lin Fu and Chie-Huai Shi

On the power domination number of the generalized Petersen graphs pp. 282-291

Guangjun Xu and Liying Kang

2011, volume 22, articles 1

Which trees have a differentiating-paired dominating set? pp. 1-18

Michael A. Henning and John McCoy

A special combinatorial problem: pitch arrangement for pneumatic tires pp. 19-34

Wei-Chu Weng

Robust multi-sensor scheduling for multi-site surveillance pp. 35-51

Nikita Boyko, Timofey Turko, Vladimir Boginski, David E. Jeffcoat, Stanislav Uryasev, Grigoriy Zrazhevsky and Panos M. Pardalos

Line facility location in weighted regions pp. 52-70

Yam Ki Cheung and Ovidiu Daescu

On the Bandpass problem pp. 71-77

Guohui Lin

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree pp. 78-96

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono and Kouhei Zenmyo

Anonymizing binary and small tables is hard to approximate pp. 97-119

Paola Bonizzoni, Gianluca Della Vedova and Riccardo Dondi