default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 31
Volume 31, Number 1, January 2016
- Dinabandhu Pradhan:
On the complexity of the minimum outer-connected dominating set problem in graphs. 1-12 - Wojciech Kazmierczak:
The best choice problem for posets; colored complete binary trees. 13-28 - Zengfu Wang
, Bill Moran, Xuezhi Wang, Quan Pan:
Approximation for maximizing monotone non-decreasing set functions with a greedy method. 29-43 - Ernst J. Joubert:
An inequality that relates the size of a bipartite graph with its order and restrained domination number. 44-51 - Wyatt J. Desormeaux, Michael A. Henning:
Lower bounds on the total domination number of a graph. 52-66 - Xiaoling Zhang, Jianguo Qian:
L(p, q)-labeling and integer tension of a graph embedded on torus. 67-77 - Xiaoling Zhang, Jianguo Qian:
Erratum to: L(p, q)-labeling and integer tension of a graph embedded on torus. 78 - Hongmei Li, Yin-Feng Xu, Guanqun Ni:
Minimax regret vertex 2-sink location problem in dynamic path networks. 79-94 - Yichao He, Xinlu Zhang, Wenbin Li, Xiang Li, Weili Wu, Suogang Gao:
Algorithms for randomized time-varying knapsack problems. 95-117 - Yuepeng Wang, Yuexuan Wang, Dongxiao Yu, Jiguo Yu, Francis C. M. Lau:
Information exchange with collision detection on multiple channels. 118-135 - Yishuo Shi, Yaping Zhang, Zhao Zhang, Weili Wu:
A greedy algorithm for the minimum 2-connected m-fold dominating set problem. 136-151 - Reinhard Bürgy, Heinz Gröflin:
The blocking job shop with rail-bound transportation. 152-181 - Guifu Su, Liming Xiong, Xiaofeng Su, Guojun Li:
Maximally edge-connected graphs and Zeroth-order general Randić index for α ≤ -1. 182-195 - Zihan Tan:
On the computational complexity of bridgecard. 196-217 - Martin Kochol:
Polynomial algorithms for canonical forms of orientations. 218-222 - Ran Gu, Xueliang Li, Yuejian Peng, Yongtang Shi:
Some Motzkin-Straus type results for non-uniform hypergraphs. 223-238 - Gruia Calinescu:
1.61-approximation for min-power strong connectivity with two power levels. 239-259 - Kejun Zhao, Xiwen Lu:
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan. 260-278 - Longjiang Guo, Yingshu Li, Zhipeng Cai:
Minimum-latency aggregation scheduling in wireless sensor network. 279-310 - Domingos M. Cardoso, Carlos J. Luz:
A simplex like approach based on star sets for recognizing convex-QP adverse graphs. 311-326 - Shubo Chen:
Cacti with the smallest, second smallest, and third smallest Gutman index. 327-332 - Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann, Yancai Zhao:
Signed Roman edge domination numbers in graphs. 333-346 - Lucas de O. Bastos, Luiz Satoru Ochi, Fábio Protti, Anand Subramanian, Ivan César Martins, Rian Gabriel S. Pinheiro:
Efficient algorithms for cluster editing. 347-371 - Yancai Zhao, Erfang Shan:
An efficient algorithm for distance total domination in block graphs. 372-381 - Jin-Xin Zhou:
Atoms of cyclic edge connectivity in regular graphs. 382-395 - Damei Lü, Jianping Sun:
L(2, 1)-labelings of the edge-multiplicity-paths-replacement of a graph. 396-404 - Wensong Lin:
On (s, t)-relaxed L(2, 1)-labeling of graphs. 405-426 - Hongzhuan Wang, Liying Kang:
Further properties on the degree distance of graphs. 427-446
Volume 31, Number 2, February 2016
- Zehui Shao, Jin Xu, Roger K. Yeh:
L(2, 1)-labeling for brick product graphs. 447-462 - Hiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito:
On the best possible competitive ratio for the multislope ski-rental problem. 463-490 - Lidong Wu, Cong-Dian Cheng:
On single machine scheduling with resource constraint. 491-505 - Mario Leston Rey:
Integral packing of branchings in capacitaded digraphs. 506-514 - Jian Li, Yang Li, Panos M. Pardalos:
Multi-depot vehicle routing problem with time windows under shared depot resources. 515-532 - Rom Pinchasi:
Crossing edges and faces of line arrangements in the plane. 533-545 - Xiangtao Li, Minghao Yin:
Modified differential evolution with self-adaptive parameters method. 546-576 - Nan Zhang, Mengfei Yang, Bin Gu, Zhenhua Duan, Cong Tian:
Verifying safety critical task scheduling systems in PPTL axiom system. 577-603 - Qiong Wu, Wai Chee Shiu, Pak Kiu Sun:
L(j, k)-labeling number of Cartesian product of path and cycle. 604-634 - Mingqiang An, Liming Xiong:
Extremal polyomino chains with respect to general Randić index. 635-647 - Shuchao Li, Huihui Zhang, Minjie Zhang:
Further results on the reciprocal degree distance of graphs. 648-668 - M. Reza Khani, Mohammad R. Salavatipour:
Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph. 669-685 - Qian Cao, Guohua Wan:
Semi-online scheduling with combined information on two identical machines in parallel. 686-695 - Dongyue Liang, Zhao Zhang, Xianliang Liu, Wei Wang, Yaolin Jiang:
Approximation algorithms for minimum weight partial connected set cover problem. 696-712 - Hengzhe Li, Yuxing Yang, Baoyindureng Wu:
2-Edge connected dominating sets and 2-Connected dominating sets of a graph. 713-724 - Chung-Shou Liao:
Power domination with bounded time constraints. 725-742 - MohammadAmin Fazli, Azin Ghazimatin, Jafar Habibi, Hamid Haghshenas:
Team selection for prediction tasks. 743-757 - Yann Disser, Jannik Matuschke:
Degree-constrained orientations of embedded graphs. 758-773 - Maksim Barketau, Erwin Pesch, Yakov M. Shafransky:
Scheduling dedicated jobs with variative processing times. 774-785 - Jing Shen, Yaofeng Ren:
Bounding the scaling window of random constraint satisfaction problems. 786-801 - Lasse Kiviluoto, Patric R. J. Östergård, Vesa P. Vaskelainen:
Algorithms for finding maximum transitive subtournaments. 802-814 - Chun-Ying Chiang, Wei-Ting Huang, Hong-Gwa Yeh:
Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis. 815-832 - Dmitriy S. Malyshev:
Two cases of polynomial-time solvability for the coloring problem. 833-845 - Mourad El Ouali, Helena Fohlin, Anand Srivastav:
An approximation algorithm for the partial vertex cover problem in hypergraphs. 846-864 - Chao Wang, Lei Chen, Changhong Lu:
k-Power domination in block graphs. 865-873 - Yi Wang, Jian Cheng, Rong Luo, Gregory Mulley:
Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs. 874-880 - Yanming Chang, Yuejian Peng, Yuping Yao:
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. 881-892 - Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen:
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. 893-901 - Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu, Chanjuan Liu:
Acyclic 3-coloring of generalized Petersen graphs. 902-911 - Emlee W. Nicholson, Bing Wei:
Degree conditions for weakly geodesic pancyclic graphs and their exceptions. 912-917 - Lingli Li, Jianzhong Li, Hong Gao:
Evaluating entity-description conflict on duplicated data. 918-941
Volume 31, Number 3, April 2016
- Jan Florek:
On Barnette's conjecture and the H+- property. 943-960 - Shuchao Li, Huihui Zhang:
Some extremal properties of the multiplicatively weighted Harary index of a graph. 961-978 - Huajun Zhang, Jin Zhao, Hui Luo:
A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems. 979-995 - Yu Yan, Dongxiao Yu, Yuexuan Wang, Jiguo Yu, Francis C. M. Lau:
Bounded information dissemination in multi-channel wireless networks. 996-1012 - Huijuan Wang, Lidong Wu, Xin Zhang, Weili Wu, Bin Liu:
A note on the minimum number of choosability of planar graphs. 1013-1022 - Shmuel Wimer:
Optimal weight allocation in rooted trees. 1023-1033 - Walid Ben-Ameur, Mohamed Didi Biha:
Extended cuts. 1034-1044 - Bin Wang, Dong-Xu Li, Jian-Ping Jiang, Yi-Huan Liao:
A modified firefly algorithm based on light intensity difference. 1045-1060 - Ioannis Mourtos:
Cardinality constraints and systems of restricted representatives. 1061-1089 - Michael A. Henning, Viroshan Naicker:
Disjunctive total domination in graphs. 1090-1110 - Agostinho Agra, Cristina Requejo, Eulália Santos:
Implicit cover inequalities. 1111-1129 - Babak Samadi:
A solution to an open problem on lower against number in graphs. 1130-1133 - Rommel M. Barbosa, Peter Slater:
On the efficiency index of a graph. 1134-1141 - Qingqiong Cai, Xueliang Li, Yan Zhao:
The 3-rainbow index and connected dominating sets. 1142-1159 - Sergey Bereg, José Miguel Díaz-Báñez, David Flores-Peñaloza, Stefan Langerman, Pablo Pérez-Lantero, Jorge Urrutia:
Optimizing some constructions with bars: new geometric knapsack problems. 1160-1173 - Ning Chen, Xiaotie Deng, Paul W. Goldberg, Jinshan Zhang:
On revenue maximization with sharp multi-unit demands. 1174-1205 - Glencora Borradaile, W. Sean Kennedy, Gordon T. Wilfong, Lisa Zhang:
Improving robustness of next-hop routing. 1206-1220 - Wei-Fan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
The entire choosability of plane graphs. 1221-1240 - Xiaonong Lu, Baoqun Yin, Haipeng Zhang:
A reinforcement-learning approach for admission control in distributed network service systems. 1241-1268 - Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Linearizable special cases of the QAP. 1269-1279 - Gruia Calinescu, Benjamin Grimmer, Satyajayant Misra, Sutep Tongngam, Guoliang Xue, Weiyi Zhang:
Improved approximation algorithms for single-tiered relay placement. 1280-1297 - Hu Ding, Branislav Stojkovic, Zihe Chen, Andrew Hughes, Lei Xu, Andrew J. Fritz, Nitasha Sehgal, Ronald Berezney, Jinhui Xu:
Chromatic kernel and its applications. 1298-1315 - Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
An improved two-machine flowshop scheduling with intermediate transportation. 1316-1334 - Iliya Bluskov:
Problem dependent optimization (PDO). 1335-1344 - Ya-Lei Jin, Yeong-Nan Yeh, Xiao-Dong Zhang:
Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree. 1345-1372
Volume 31, Number 4, May 2016
- Robert Janczewski, Krzysztof Turowski:
An O(n log n) algorithm for finding edge span of cacti. 1373-1382 - Muhuo Liu, Baogang Xu:
On judicious partitions of graphs. 1383-1398 - Jiansheng Cai, Binlu Feng, Guiying Yan:
Acyclic coloring of graphs with some girth restriction. 1399-1404 - Jason Hedetniemi:
On identifying codes in the Cartesian product of a path and a complete graph. 1405-1416 - Dongyue Liang, Liquan Mei, James Willson, Wei Wang:
A simple greedy approximation algorithm for the minimum connected k-Center problem. 1417-1429 - Renyu Xu, Jian-Liang Wu, Jin Xu:
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic. 1430-1442 - Christos Chatzinakos, Leonidas S. Pitsoulis, George Zioutas:
Optimization techniques for robust multivariate location and scatter estimation. 1443-1460 - Roman E. Shangin, Panos M. Pardalos:
Heuristics for the network design problem with connectivity requirements. 1461-1478 - Tingting Wu, Jiangxu Kong, Wei-Fan Wang:
The 2-surviving rate of planar graphs without 5-cycles. 1479-1492 - Liqi Zhang, Lingfa Lu, Shisheng Li:
New results on two-machine flow-shop scheduling with rejection. 1493-1504 - Yingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang:
An approximation algorithm for maximum weight budgeted connected set cover. 1505-1517 - Kenneth Carling, Xiangli Meng:
On statistical bounds of heuristic solutions to location problems. 1518-1549 - Donghyun Kim, Wei Wang, Deying Li, Joonglyul Lee, Weili Wu, Alade O. Tokuta:
A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring. 1550-1568 - Xin Feng, Yongxi Cheng, Feifeng Zheng, Yin-Feng Xu:
Online integrated production-distribution scheduling problems without preemption. 1569-1585 - Johannes H. Hattingh, Ernst J. Joubert:
Equality in a bound that relates the size and the restrained domination number of a graph. 1586-1608 - Hailing Liu, Jinjiang Yuan, Wenjie Li:
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart. 1609-1622 - Kejia Zhang, Qilong Han, Guisheng Yin, Haiwei Pan:
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks. 1623-1641 - Zejun Huang, Huiqiu Lin:
Sizes and transmissions of digraphs with a given clique number. 1642-1649 - Hua Cai, Jianliang Wu, Lin Sun:
Total coloring of planar graphs without short cycles. 1650-1664 - Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos:
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. 1665-1677 - Ailian Wang, Weili Wu, Lei Cui:
On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. 1678-1684 - David Avis, Conor Meagher:
On the directed cut cone and polytope. 1685-1708 - Wayne J. Pullan, Xin-Wen Wu, Zihui Liu:
Construction of optimal constant-dimension subspace codes. 1709-1719 - Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen:
Budget-constrained minimum cost flows. 1720-1745 - Ahmad-Saher Azizi-Sultan:
Pseudo-automatic beam orientations in multi-criteria intensity-modulated radiation therapy. 1746-1759
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 2024-11-11 21:34 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:
