Journal of Combinatorial Optimization, Volume 14

Volume 14, Number 1, July 2007

• Paul Dorbec, Sylvain Gravier, Michael A. Henning:
  Paired-domination in generalized claw-free graphs. 1-7
  Electronic Edition (link) BibTeX
• Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone:
  An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem. 9-33
  Electronic Edition (link) BibTeX
• Yaodong Cui, Qiang Wang:
  Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors. 35-44
  Electronic Edition (link) BibTeX
• Leah Epstein, Deshi Ye:
  Semi-online scheduling with "end of sequence" information. 45-61
  Electronic Edition (link) BibTeX
• Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
  Packing [1, Delta] -factors in graphs of small degree. 63-86
  Electronic Edition (link) BibTeX
• Haiying Wang:
  On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Delta (G) = 3. 87-109
  Electronic Edition (link) BibTeX

Volume 14, Numbers 2-3, October 2007

• Gerard J. Chang, Hung-Lin Fu, Xuding Zhu:
  Editorial note. 111-112
  Electronic Edition (link) BibTeX
• Justie Su-tzu Juan, Gerard J. Chang:
  Group testing in graphs. 113-119
  Electronic Edition (link) BibTeX
• H. B. Chen, Ding-Zhu Du, Frank K. Hwang:
  An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. 121-129
  Electronic Edition (link) BibTeX
• Victor W. Liu, Chiuyuan Chen, Richard B. Chen:
  Optimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks. 131-142
  Electronic Edition (link) BibTeX
• Jyhmin Kuo, Hung-Lin Fu:
  Wide diameters of de Bruijn graphs. 143-152
  Electronic Edition (link) BibTeX
• Shmuel Onn, Uriel G. Rothblum:
  The use of edge-directions and linear programming to enumerate vertices. 153-164
  Electronic Edition (link) BibTeX
• Vladimir D. Tonchev, Hao Wang:
  An algorithm for optimal difference systems of sets. 165-175
  Electronic Edition (link) BibTeX
• Yu-Ping Tsao, Gerard J. Chang:
  Profile minimization on compositions of graphs. 177-190
  Electronic Edition (link) BibTeX
• Chia-Fen Chang, Hung-Lin Fu:
  Near automorphisms of trees with small total relative displacements. 191-195
  Electronic Edition (link) BibTeX
• Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh:
  Hamiltonicity of hypercubes with a constraint of required and faulty edges. 197-204
  Electronic Edition (link) BibTeX
• Chao-Chih Chou, Chin-Mei Fu:
  Decomposition of K _{m , n} into 4-cycles and 2 t -cycles. 205-218
  Electronic Edition (link) BibTeX
• Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu:
  L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. 219-227
  Electronic Edition (link) BibTeX
• Violet R. Syrotiuk, Zhiqiang Zhang, Charles J. Colbourn:
  Transport schemes for topology-transparent scheduling. 229-248
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs, Xiaohua Teresa Jin:
  Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. 249-257
  Electronic Edition (link) BibTeX
• C. A. Rodger, S. K. Westbrook:
  Decompositions of lambda K _v . 259-265
  Electronic Edition (link) BibTeX
• Jer-Jeong Chen, Gerard J. Chang:
  Distance graphs on R ⁿ with 1-norm. 267-274
  Electronic Edition (link) BibTeX
• Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu:
  On cubic 2-independent Hamiltonian connected graphs. 275-294
  Electronic Edition (link) BibTeX
• Ying-Da Chen, Jing-Ho Yan:
  A study on cyclic bandwidth sum. 295-308
  Electronic Edition (link) BibTeX
• Wai Chee Shiu, Richard M. Low:
  Integer-magic spectra of sun graphs. 309-321
  Electronic Edition (link) BibTeX
• Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu:
  Packing 5-cycles into balanced complete m -partite graphs for odd m. 323-329
  Electronic Edition (link) BibTeX
• Hsun-Wen Chang, Pei-Fang Tsai:
  Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats. 331-347
  Electronic Edition (link) BibTeX
• Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu:
  On the equitable k ^*-laceability of hypercubes. 349-364
  Electronic Edition (link) BibTeX
• Shung-Liang Wu, Hung-Lin Fu:
  Maximum cyclic 4-cycle packings of the complete multipartite graph. 365-382
  Electronic Edition (link) BibTeX
• Chao-Chih Chou, Chin-Mei Fu:
  Decomposition of K _{m , n} into 4-cycles and 2 t -cycles. 383
  Electronic Edition (link) BibTeX

Volume 14, Number 4, November 2007

• Jack Douthett, Richard Krantz:
  Maximally even sets and configurations: common threads in mathematics, physics, and music. 385-410
  Electronic Edition (link) BibTeX
• Boting Yang, Yi Cao:
  Monotonicity of strong searching on digraphs. 411-425
  Electronic Edition (link) BibTeX
• Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang:
  Online bin packing of fragile objects with application in cellular networks. 427-435
  Electronic Edition (link) BibTeX
• Refael Hassin, Jérôme Monnot, Danny Segev:
  Approximation algorithms and hardness results for labeled connectivity problems. 437-453
  Electronic Edition (link) BibTeX
• Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin:
  Maximum k -regular induced subgraphs. 455-463
  Electronic Edition (link) BibTeX
• Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos:
  The densest k-subgraph problem on clique graphs. 465-474
  Electronic Edition (link) BibTeX
• Wenhua Li, Jinjiang Yuan, Yixun Lin:
  A note on special optimal batching structures to minimize total weighted completion time. 475-480
  Electronic Edition (link) BibTeX
• Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Stan Uryasev, Grigoriy Zrazhevsky:
  The wireless network jamming problem. 481-498
  Electronic Edition (link) BibTeX