default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 27
Volume 27, Number 1, January 2014
- Guohui Lin:
Preface. 1-2 - Chihao Zhang, Haitao Jiang, Binhai Zhu:
Radiation hybrid map construction problem parameterized. 3-13 - Zhewei Liang, Kaizhong Zhang:
Algorithms for local similarity between forests. 14-31 - Wei Ding
, Guoliang Xue:
Minimum diameter cost-constrained Steiner trees. 32-48 - Eddie Cheng, Ke Qiu, Zhizhang Shen:
The edge-centered surface area of the arrangement graph. 49-64 - Hong Liu, Peng Zhang:
On the generalized multiway cut in trees problem. 65-77 - Iyad A. Kanj, Ge Xia:
On certain geometric properties of the Yao-Yao graphs. 78-87 - Hiroshi Eto, Fengrui Guo, Eiji Miyano:
Distance- $$d$$ independent set problems for bipartite and chordal graphs. 88-99 - Barbara M. Anthony, Christine Chung:
Online bottleneck matching. 100-114 - János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt:
On-line bin packing with restricted repacking. 115-131 - Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. 132-143 - Michel Mollard:
The domination number of Cartesian product of two directed paths. 144-151 - Jianping Li, Weidong Li, Junran Lichen:
The subdivision-constrained routing requests problem. 152-163 - Elisabeth Günther, Felix G. König, Nicole Megow:
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. 164-181 - Feifeng Zheng, E. Zhang, Yinfeng Xu, Wei-Chiang Hong:
Competitive analysis for make-to-order scheduling with reliable lead time quotation. 182-198 - Wei Xiong, Zhao Zhang, Hong-Jian Lai:
Spanning 3-connected index of graphs. 199-208
Volume 27, Number 2, February 2014
- Zheng Fang, Jie Wang:
Efficient identifications of structural similarities for graphs. 209-220 - Deying Li, Qinghua Zhu, Hongwei Du, Jianzhong Li:
An improved distributed data aggregation scheduling in wireless sensor networks. 221-240 - Hossein Abdollahzadeh Ahangar, Michael A. Henning, Christian Löwenstein, Yancai Zhao, Vladimir Samodivkin:
Signed Roman domination in graphs. 241-255 - Andrea Valsecchi, Leonardo Vanneschi, Giancarlo Mauri:
A study of search algorithms' optimization speed. 256-270 - John W. Estes, Bing Wei:
Sharp bounds of the Zagreb indices of k-trees. 271-291 - B. Chaluvaraju, K. A. Vidya:
Generalized perfect domination in graphs. 292-301 - Yongxi Cheng, Yinfeng Xu:
An efficient FPRAS type group testing procedure to approximate the number of defectives. 302-314 - Zi Xu, Donglei Du, Dachuan Xu:
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems. 315-327 - Tzu-Liang Kung, Cheng-Kuan Lin, Lih-Hsing Hsu:
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube. 328-344 - Dmitriy S. Malyshev:
Boundary graph classes for some maximum induced subgraph problems. 345-354 - Qiong Wu, Wai Chee Shiu, Pak Kiu Sun:
Circular L(j, k)-labeling number of direct product of path and cycle. 355-368 - Fu-Tao Hu, Jun-Ming Xu:
Total and paired domination numbers of toroidal meshes. 369-378 - Weifan Wang, Danjun Huang:
The adjacent vertex distinguishing total coloring of planar graphs. 379-396 - Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos:
Improvements to MCS algorithm for the maximum clique problem. 397-416
Volume 27, Number 3, April 2014
- Ghaith M. Jaradat, Masri Ayob, Zulkifli Ahmad:
On the performance of Scatter Search for post-enrolment course timetabling problems. 417-439 - Min Chen, André Raspaud, Weifan Wang:
Star list chromatic number of planar subcubic graphs. 440-450 - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the total outer-connected domination in graphs. 451-461 - Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. 462-486 - Thang N. Dinh, Yilin Shen, Dung T. Nguyen, My T. Thai:
On the approximability of positive influence dominating set in social networks. 487-503 - Hai Du, Yinfeng Xu:
An approximation algorithm for k-center problem on a convex polygon. 504-518 - Yingqian Wang, Ping Sheng:
Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles. 519-529 - Fuliang Lu, Lianzhu Zhang:
The Pfaffian property of Cartesian products of graphs. 530-540 - Junxing Wang:
A simple Byzantine Generals protocol. 541-544 - Liwei Zhong, Shoucheng Luo, Lidong Wu, Lin Xu, Jinghui Yang, Guochun Tang:
A two-stage approach for surgery scheduling. 545-556 - Haiyan Li, Yanting Liang, Muhuo Liu, Baogang Xu:
On minimum balanced bipartitions of triangle-free graphs. 557-566 - Fei-Huang Chang, Hong-Bin Chen, Frank K. Hwang:
Are there more almost separable partitions than separable partitions? 567-573 - Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at minimum cost. 574-596 - Woo-Lahm Kwak, Soo Y. Chang:
Order consolidation for hierarchical product lines. 597-608 - Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties. 609-620
Volume 27, Number 4, May 2014
- Weifan Wang, Stephen Finbow, Ping Wang:
A lower bound of the surviving rate of a planar graph with girth at least seven. 621-642 - B. S. Panda, Subhabrata Paul:
Hardness results and approximation algorithm for total liar's domination in graphs. 643-662 - Peng Zhang:
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design. 663-678 - Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo, Ji-Yin Lin, Jing-Ho Yan:
Bandwidth sums of block graphs and cacti. 679-687 - Paul Dorbec, Bert L. Hartnell, Michael A. Henning:
Paired versus double domination in K 1, r -free graphs. 688-694 - Pu Zhang, Wensong Lin:
Multiple L(j, 1)-labeling of the triangular lattice. 695-710 - Yiwei Jiang, Zewei Weng, Jueliang Hu:
Algorithms with limited number of preemptions for scheduling on parallel machines. 711-723 - Qian Ma, Zhenhua Duan:
Linear time-dependent constraints programming with MSVL. 724-766 - Leah Epstein, Elena Kleiman, Rob van Stee:
The cost of selfishness for maximizing the minimum load on uniformly related machines. 767-777 - Shihyen Chen, Kaizhong Zhang:
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison. 778-797 - Jay Mahadeokar, Sanjeev Saxena:
Faster algorithm to find anti-risk path between two nodes of an undirected graph. 798-807 - Duc Manh Nguyen, Hoai An Le Thi, Tao Pham Dinh:
Solving the Multidimensional Assignment Problem by a Cross-Entropy method. 808-823
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 2025-12-04 01:27 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
