default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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 - Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone:
An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem. 9-33 - Yaodong Cui, Qiang Wang:
Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors. 35-44 - Leah Epstein, Deshi Ye:
Semi-online scheduling with "end of sequence" information. 45-61 - Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Packing [1, Delta] -factors in graphs of small degree. 63-86 - Haiying Wang:
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Delta (G) = 3. 87-109
Volume 14, Numbers 2-3, October 2007
- Gerard J. Chang, Hung-Lin Fu, Xuding Zhu:
Editorial note. 111-112 - Justie Su-tzu Juan, Gerard J. Chang:
Group testing in graphs. 113-119 - 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 - Victor W. Liu, Chiuyuan Chen, Richard B. Chen:
Optimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks. 131-142 - Jyhmin Kuo, Hung-Lin Fu:
Wide diameters of de Bruijn graphs. 143-152 - Shmuel Onn, Uriel G. Rothblum:
The use of edge-directions and linear programming to enumerate vertices. 153-164 - Vladimir D. Tonchev, Hao Wang:
An algorithm for optimal difference systems of sets. 165-175 - Yu-Ping Tsao, Gerard J. Chang:
Profile minimization on compositions of graphs. 177-190 - Chia-Fen Chang, Hung-Lin Fu:
Near automorphisms of trees with small total relative displacements. 191-195 - Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh:
Hamiltonicity of hypercubes with a constraint of required and faulty edges. 197-204 - Chao-Chih Chou, Chin-Mei Fu:
Decomposition of K m , n into 4-cycles and 2 t -cycles. 205-218 - 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 - Violet R. Syrotiuk, Zhiqiang Zhang, Charles J. Colbourn:
Transport schemes for topology-transparent scheduling. 229-248 - Jerrold R. Griggs, Xiaohua Teresa Jin:
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. 249-257 - C. A. Rodger, S. K. Westbrook:
Decompositions of lambda K v . 259-265 - Jer-Jeong Chen, Gerard J. Chang:
Distance graphs on R n with 1-norm. 267-274 - Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu:
On cubic 2-independent Hamiltonian connected graphs. 275-294 - Ying-Da Chen, Jing-Ho Yan:
A study on cyclic bandwidth sum. 295-308 - Wai Chee Shiu, Richard M. Low:
Integer-magic spectra of sun graphs. 309-321 - Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu:
Packing 5-cycles into balanced complete m -partite graphs for odd m. 323-329 - Hsun-Wen Chang, Pei-Fang Tsai:
Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats. 331-347 - Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu:
On the equitable k *-laceability of hypercubes. 349-364 - Shung-Liang Wu, Hung-Lin Fu:
Maximum cyclic 4-cycle packings of the complete multipartite graph. 365-382 - Chao-Chih Chou, Chin-Mei Fu:
Decomposition of K m , n into 4-cycles and 2 t -cycles. 383
Volume 14, Number 4, November 2007
- Jack Douthett, Richard Krantz:
Maximally even sets and configurations: common threads in mathematics, physics, and music. 385-410 - Boting Yang, Yi Cao:
Monotonicity of strong searching on digraphs. 411-425 - 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 - Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation algorithms and hardness results for labeled connectivity problems. 437-453 - Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin:
Maximum k -regular induced subgraphs. 455-463 - Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos:
The densest k-subgraph problem on clique graphs. 465-474 - Wenhua Li, Jinjiang Yuan, Yixun Lin:
A note on special optimal batching structures to minimize total weighted completion time. 475-480 - Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Stan Uryasev, Grigoriy Zrazhevsky:
The wireless network jamming problem. 481-498
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-29 00:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
