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 25, articles 4

Preface: optimization in graphs pp. 499-500

D. J. Guan, Ko-Wei Lih and Xuding Zhu

Equivalence of two conjectures on equitable coloring of graphs pp. 501-504

Bor-Liang Chen, Ko-Wei Lih and Chih-Hung Yen

Structure of Fibonacci cubes: a survey pp. 505-522

Sandi Klavžar

Enumerating the edge-colourings and total colourings of a regular graph pp. 523-535

S. Bessy and F. Havet

The decycling number of outerplanar graphs pp. 536-542

Huilan Chang, Hung-Lin Fu and Min-Yun Lien

(p,q)-total labeling of complete graphs pp. 543-561

Ma-Lian Chia, David Kuo, Jing-Ho Yan and Siou-Ru Yang

Acyclic edge coloring of planar graphs without 4-cycles pp. 562-586

Weifan Wang, Qiaojun Shu and Yiqiao Wang

The partition method for poset-free families pp. 587-596

Jerrold R. Griggs and Wei-Tian Li

A note on optimal pebbling of hypercubes pp. 597-601

Hung-Lin Fu, Kuo-Ching Huang and Chin-Lin Shiue

The broadcast median problem in heterogeneous postal model pp. 602-616

Cheng-Hsiao Tsou, Gen-Huey Chen, Hung-I Yu and Ching-Chi Lin

A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra pp. 617-638

Sen-Peng Eu, Tung-Shan Fu and Yeh-Jong Pan

Three conjectures on the signed cycle domination in graphs pp. 639-645

Jian Guan, Xiaoyan Liu, Changhong Lu and Zhengke Miao

L(p,q)-labeling of sparse graphs pp. 646-660

Clément Charpentier, Mickaël Montassier and André Raspaud

Distance two edge labelings of lattices pp. 661-679

Wensong Lin and Jianzhuan Wu

Chromatic number of distance graphs generated by the sets {2,3,x,y} pp. 680-693

Daphne Der-Fen Liu and Aileen Sutedja

The hamiltonian numbers in digraphs pp. 694-701

Ting-Pang Chang and Li-Da Tong

Some results on the target set selection problem pp. 702-715

Chun-Ying Chiang, Liang-Hao Huang, Bo-Jr Li, Jiaojiao Wu and Hong-Gwa Yeh

The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups pp. 716-736

Xiangwen Li, Vicky Mak-Hau and Sanming Zhou

Colorability of mixed hypergraphs and their chromatic inversions pp. 737-751

Máté Hegyháti and Zsolt Tuza

The game Grundy number of graphs pp. 752-765

Frédéric Havet and Xuding Zhu

On total weight choosability of graphs pp. 766-783

Haili Pan and Daqing Yang

2013, volume 25, articles 3

On sorting unsigned permutations by double-cut-and-joins pp. 339-351

Xin Chen

Constant time approximation scheme for largest well predicted subset pp. 352-367

Bin Fu and Lusheng Wang

Computing maximum upward planar subgraphs of single-source embedded digraphs pp. 368-392

Aimal Rextin and Patrick Healy

Clustering with or without the approximation pp. 393-429

Frans Schalekamp, Michael Yu and Anke Zuylen

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks pp. 430-459

Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes and Sébastien Tixeuil

Minimum-segment convex drawings of 3-connected cubic plane graphs pp. 460-480

Debajyoti Mondal, Rahnuma Islam Nishat, Sudip Biswas and Md. Saidur Rahman

Near optimal solutions for maximum quasi-bicliques pp. 481-497

Lusheng Wang

2013, volume 25, articles 2

Scheduling Packets with Values and Deadlines in Size-Bounded Buffers pp. 165-175

Fei Li

Some variations on constrained minimum enclosing circle problem pp. 176-190

Arindam Karmakar, Sandip Das, Subhas C. Nandy and Binay K. Bhattacharya

Complexity of determining the most vital elements for the p-median and p-center location problems pp. 191-207

Cristina Bazgan, Sonia Toubaline and Daniel Vanderpooten

Coverage with k-transmitters in the presence of obstacles pp. 208-233

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán, Diane Souvaine and Ryuhei Uehara

Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials pp. 234-254

Zhixiang Chen and Bin Fu

Improved approximation for spanning star forest in dense graphs pp. 255-264

Jing He and Hongyu Liang

A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP pp. 265-278

Viet Hung Nguyen

Preemptive scheduling on two identical parallel machines with a single transporter pp. 279-307

Hans Kellerer, Alan J. Soper and Vitaly A. Strusevich

Discrete optimization with polynomially detectable boundaries and restricted level sets pp. 308-325

Yakov Zinder, Julia Memar and Gaurav Singh

A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time pp. 326-337

Tadao Takaoka

2013, volume 25, articles 1

An extension of Stein-Lovász theorem and some of its applications pp. 1-18

Guang-Siang Lee

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs pp. 19-46

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman and Oren Weimann

Edge lifting and total domination in graphs pp. 47-59

Wyatt J. Desormeaux, Teresa W. Haynes and Michael A. Henning

A 6/5-approximation algorithm for the maximum 3-cover problem pp. 60-77

Ioannis Caragiannis and Gianpiero Monaco

Edge-colouring of joins of regular graphs II pp. 78-90

Caterina Simone and Anna Galluccio

The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle pp. 91-98

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

Computational risk management techniques for fixed charge network flow problems with uncertain arc failures pp. 99-122

Alexey Sorokin, Vladimir Boginski, Artyom Nahapetyan and Panos M. Pardalos

Two-stage proportionate flexible flow shop to minimize the makespan pp. 123-134

Byung-Cheon Choi and Kangbok Lee

A new two-party bargaining mechanism pp. 135-163

Y. H. Gu, M. Goh, Q. L. Chen, R. D. Souza and G. C. Tang

2012, volume 24, articles 4

Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA pp. 397-412

Julien Schleich, Hoai An Le Thi and Pascal Bouvry

Min-energy broadcast in mobile ad hoc networks with restricted motion pp. 413-426

J. M. Díaz-Báñez, R. Fabila-Monroy, D. Flores-Peñaloza, M. A. Heredia and J. Urrutia

Parity and strong parity edge-colorings of graphs pp. 427-436

Hsiang-Chun Hsu and Gerard J. Chang

Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem pp. 437-458

Jean-Charles Créput, Amir Hajjam, Abderrafiaa Koukam and Olivier Kuhn

On the complexity of path problems in properly colored directed graphs pp. 459-467

Donatella Granata, Behnam Behdani and Panos M. Pardalos

Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors pp. 468-484

Yang Wang, Hung Q. Ngo and Thanh-Nhan Nguyen

Dispatching design for storage-centric wireless sensor networks pp. 485-507

Minming Li, Qin Liu, Jianping Wang and Yingchao Zhao

Competent genetic algorithms for weighing matrices pp. 508-525

I. S. Kotsireas, C. Koukouvinos, P. M. Pardalos and D. E. Simos

On the fractionality of the path packing problem pp. 526-539

Natalia Vanetik

A branch-and-bound algorithm for the minimum cut linear arrangement problem pp. 540-563

Gintaras Palubeckis and Dalius Rubliauskas

Algebraic connectivity of an even uniform hypergraph pp. 564-579

Shenglong Hu and Liqun Qi

An optimal square coloring of planar graphs pp. 580-592

Yuehua Bu and Xubo Zhu

Online scheduling on uniform machines with two hierarchies pp. 593-612

Li-ying Hou and Liying Kang

LLL-reduction for integer knapsacks pp. 613-626

Iskander Aliev and Martin Henk

The paths embedding of the arrangement graphs with prescribed vertices in given position pp. 627-646

Yuan-Hsiang Teng, Jimmy J. M. Tan, Chey-Woei Tsay and Lih-Hsing Hsu

2012, volume 24, articles 3

Minimum statuses of connected graphs with fixed maximum degree and order pp. 147-161

Chiang Lin, Wei-Han Tsai, Jen-Ling Shang and Yuan-Jen Zhang

The total {k}-domatic number of wheels and complete graphs pp. 162-175

Jing Chen, Xinmin Hou and Ning Li

Vertices in all minimum paired-dominating sets of block graphs pp. 176-191

Lei Chen, Changhong Lu and Zhenbing Zeng

The second largest number of maximal independent sets in connected graphs with at most one cycle pp. 192-201

Min-Jen Jou

Min-cost multiflows in node-capacitated undirected networks pp. 202-228

Maxim A. Babenko and Alexander Karzanov

Approximation schemes for two-machine flow shop scheduling with two agents pp. 229-239

Wenchang Luo, Lin Chen and Guochuan Zhang

Long cycles in hypercubes with optimal number of faulty vertices pp. 240-265

Jiří Fink and Petr Gregor

On L(2,1)-labeling of generalized Petersen graphs pp. 266-279

Yuan-Zhen Huang, Chun-Ying Chiang, Liang-Hao Huang and Hong-Gwa Yeh

Random restricted matching and lower bounds for combinatorial optimization pp. 280-298

Stefan Steinerberger

Some results on the injective chromatic number of graphs pp. 299-318

Min Chen, Geňa Hahn, André Raspaud and Weifan Wang

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring pp. 319-328

Jianping Li, Weidong Li and Lusheng Wang

A Nordhaus-Gaddum-type result for the induced path number pp. 329-338

Johannes H. Hattingh, Osama A. Saleh, Lucas C. Merwe and Terry J. Walters

k-tuple total domination in cross products of graphs pp. 339-346

Michael A. Henning and Adel P. Kazemi

Exact combinatorial algorithms and experiments for finding maximum k-plexes pp. 347-373

Hannes Moser, Rolf Niedermeier and Manuel Sorge

The complexity of influence maximization problem in the deterministic linear threshold model pp. 374-378

Zaixin Lu, Wei Zhang, Weili Wu, Joonmo Kim and Bin Fu

On cyclic vertex-connectivity of Cartesian product digraphs pp. 379-388

Da Huang and Zhao Zhang

Note on the hardness of generalized connectivity pp. 389-396

Shasha Li and Xueliang Li

2012, volume 24, articles 2

Introduction pp. 65-66

Satoshi Fujita and Md. Saidur Rahman

A rooted-forest partition with uniform vertex demand pp. 67-98

Naoki Katoh and Shin-ichi Tanigawa

Small grid drawings of planar graphs with balanced partition pp. 99-115

Xiao Zhou, Takashi Hikino and Takao Nishizeki

Acyclically 3-colorable planar graphs pp. 116-130

Patrizio Angelini and Fabrizio Frati

FPT algorithms for Connected Feedback Vertex Set pp. 131-146

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh and Somnath Sikdar

2012, volume 24, articles 1

Max-coloring paths: tight bounds and extensions pp. 1-14

Telikepalli Kavitha and Julián Mestre

Shifting strategy for geometric graphs without geometry pp. 15-31

Imran A. Pirwani

Minimum covering with travel cost pp. 32-51

Sándor P. Fekete, Joseph S. B. Mitchell and Christiane Schmidt

Online maximum directed cut pp. 52-64

Amotz Bar-Noy and Michael Lampis