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.

2010, volume 19, articles 4

Domination in graphs with bounded propagation: algorithms, formulations and hardness results pp. 429-456

Ashkan Aazami

Labelling algorithms for paired-domination problems in block and interval graphs pp. 457-470

Lei Chen, Changhong Lu and Zhenbing Zeng

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree pp. 471-485

Weifan Wang and Yiqiao Wang

A class of error-correcting pooling designs over complexes pp. 486-491

Tayuan Huang, Kaishun Wang and Chih-Wen Weng

Pooling designs associated with unitary space and ratio efficiency comparison pp. 492-500

Jun Guo

Unconditional secure communication: a Russian Cards protocol pp. 501-530

Zhenhua Duan and Chen Yang

2010, volume 19, articles 3

A Lagrangian bound for many-to-many assignment problems pp. 241-257

Igor Litvinchev, Socorro Rangel and Jania Saucedo

The price of atomic selfish ring routing pp. 258-278

Bo Chen, Xujin Chen and Xiaodong Hu

Keeping partners together: algorithmic results for the hospitals/residents problem with couples pp. 279-303

Eric J. McDermid and David F. Manlove

Algorithms for storage allocation based on client preferences pp. 304-324

Tami Tamir and Benny Vaksendiser

Scheduling internal audit activities: a stochastic combinatorial optimization problem pp. 325-346

Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven Prestwich and Semra Karacaer

Just-in-time scheduling with controllable processing times on parallel machines pp. 347-368

Yaron Leyvand, Dvir Shabtay, George Steiner and Liron Yedidsion

A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions pp. 369-393

Diana Fanghänel and Frauke Liers

An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs pp. 394-414

T. Gomes, J. Craveirinha and L. Jorge

Galaxy cutsets in graphs pp. 415-427

Nicolas Sonnerat and Adrian Vetta

2010, volume 19, articles 2

Adjacent vertex distinguishing total colorings of outerplanar graphs pp. 123-133

Yiqiao Wang and Weifan Wang

A quadratic lower bound for Rocchio’s similarity-based relevance feedback algorithm with a fixed query updating factor pp. 134-157

Zhixiang Chen, Bin Fu and John Abraham

Bayesian coverage optimization models pp. 158-173

James J. Cochran, Martin S. Levy and Jeffrey D. Camm

On dual power assignment optimization for biconnectivity pp. 174-183

Chen Wang, James Willson, Myung-Ah Park, Andras Farago and Weili Wu

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence pp. 184-199

Andrzej Dudek, Joanna Polcyn and Andrzej Ruciński

Complexity analysis for maximum flow problems with arc reversals pp. 200-216

Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou and Panos M. Pardalos

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops pp. 217-240

Lan Liu and Tao Jiang

2010, volume 19, articles 1

Lexicographically minimizing axial motions for the Euclidean TSP pp. 1-15

Francis Sourd

Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults pp. 16-30

Sun-Yuan Hsieh and Chang-Yu Wu

An almost four-approximation algorithm for maximum weight triangulation pp. 31-42

Shiyan Hu

Capacity inverse minimum cost flow problem pp. 43-59

Çiğdem Güler and Horst W. Hamacher

Total restrained domination in claw-free graphs pp. 60-68

Hongxing Jiang and Liying Kang

A tighter formulation of the p-median problem pp. 69-83

Sourour Elloumi

Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan pp. 84-93

Shisheng Li and Jinjiang Yuan

Linear time construction of 5-phylogenetic roots for tree chordal graphs pp. 94-106

William S. Kennedy, Hui Kong, Guohui Lin and Guiying Yan

Worst-case analysis for on-line service policies pp. 107-122

Zhenbo Wang and Wenxun Xing

2009, volume 18, articles 4

A parameterized perspective on packing paths of length two pp. 319-341

Henning Fernau and Daniel Raible

Node-weighted Steiner tree approximation in unit disk graphs pp. 342-349

Feng Zou, Xianyue Li, Suogang Gao and Weili Wu

The robot cleans up pp. 350-361

M. E. Messinger and R. J. Nowakowski

Fixed-parameter tractability of anonymizing data by suppressing entries pp. 362-375

Patricia A. Evans, H. Todd Wareham and Rhonda Chaytor

New algorithms for k-center and extensions pp. 376-392

René Brandenberg and Lucia Roth

Separating sublinear time computations by approximate diameter pp. 393-416

Bin Fu and Zhiyu Zhao

Edge-colouring of joins of regular graphs, I pp. 417-428

Caterina De Simone and Anna Galluccio

2009, volume 18, articles 3

Fibonacci index and stability number of graphs: a polyhedral study pp. 207-228

Véronique Bruyère and Hadrien Mélot

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases pp. 229-257

Serafino Cicerone, Gianlorenzo D’Angelo, Gabriele Stefano, Daniele Frigioni and Alfredo Navarra

A 6.55 factor primal-dual approximation algorithm for the connected facility location problem pp. 258-271

Hyunwoo Jung, Mohammad Khairul Hasan and Kyung-Yong Chwa

Flows with unit path capacities and related packing and covering problems pp. 272-293

Maren Martens and Martin Skutella

Multiple hypernode hitting sets and smallest two-cores with targets pp. 294-306

Peter Damaschke

On recovering syntenic blocks from comparative maps pp. 307-318

Zhixiang Chen, Bin Fu, Minghui Jiang and Binhai Zhu

2009, volume 18, articles 2

Graph coloring by multiagent fusion search pp. 99-123

Xiao-Feng Xie and Jiming Liu

Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems pp. 124-150

Christian Desrosiers, Philippe Galinier, Alain Hertz and Sandrine Paroz

The bandpass problem: combinatorial optimization and library of problems pp. 151-172

Djangir A. Babayev, George I. Bell and Urfat G. Nuriyev

On the total {k}-domination number of Cartesian products of graphs pp. 173-178

Ning Li and Xinmin Hou

A better constant-factor approximation for weighted dominating set in unit disk graph pp. 179-194

Yaochun Huang, Xiaofeng Gao, Zhao Zhang and Weili Wu

The canadian traveller problem and its competitive analysis pp. 195-205

Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu and Zhijun Zhu

2009, volume 18, articles 1

Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron pp. 1-22

F. Bendali and J. Mailfert

Domination and total domination in complementary prisms pp. 23-37

Teresa W. Haynes, Michael A. Henning and Lucas C. Merwe

The weighted link ring loading problem pp. 38-50

Qingqin Nong, Jinjiang Yuan and Yixun Lin

Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison pp. 51-63

Geng-sheng Zhang, Xiao-lei Sun and Bo-li Li

Finding nucleolus of flow game pp. 64-86

Xiaotie Deng, Qizhi Fang and Xiaoxun Sun

Parameterized dominating set problem in chordal graphs: complexity and lower bound pp. 87-97

Chunmei Liu and Yinglei Song