Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 33
Volume 33, Number 1, January 2017
- Zemin Jin, Yuping Zang:
Anti-Ramsey coloring for matchings in complete bipartite graphs. 1-12 - Bumtle Kang, Suh-Ryung Kim, Ji Yeon Park:
On consecutive edge magic total labelings of connected bipartite graphs. 13-27 - Xiao Wang, Baoyindureng Wu:
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree. 28-34 - Vicky H. Mak-Hau
:
On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches. 35-59 - Salim Haddadi:
Benders decomposition for set covering problems - Almost satisfying the consecutive ones property. 60-80 - Boting Yang:
Lower bounds for positive semidefinite zero forcing and their applications. 81-105 - Limin Wang, Wenxue Du, Zhao Zhang, Xiaoyan Zhang:
A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks. 106-122 - Qingqiong Cai, Xueliang Li, Di Wu:
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. 123-131 - Zhao Zhang, Wen Xu, Weili Wu, Ding-Zhu Du:
A novel approach for detecting multiple rumor sources in networks with partial observations. 132-146 - Zuosong Liang, Erfang Shan, Yuzhong Zhang:
A linear-time algorithm for clique-coloring problem in circular-arc graphs. 147-155 - Yongtang Shi, Meiqin Wei, Jun Yue, Yan Zhao:
Coupon coloring of some special graphs. 156-164 - Yunfang Tang, Xuding Zhu:
Total weight choosability of Mycielski graphs. 165-182 - Xinsheng Xiong, Yong Zhao, Yang Chen:
A computational approach to the multi-period many-to-one matching with ties. 183-201 - Mekkia Kouider, Mohamed Zamime:
On the b-coloring of tight graphs. 202-214 - Matthew Aldridge, Leonardo Baldassini, Karen Gunderson:
Almost separable matrices. 215-236 - Tong Li, Cunquan Qu, Guanghui Wang, Xiaowei Yu:
Neighbor product distinguishing total colorings. 237-253 - Xiaodong Liang, Rui Wang, Jixiang Meng:
Code for polyomino and computer search of isospectral polyominoes. 254-264 - Huijuan Wang, Bin Liu, Yan Gu, Xin Zhang, Weili Wu, Hongwei Gao:
Total coloring of planar graphs without adjacent short cycles. 265-274 - Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao:
A solution to a conjecture on the generalized connectivity of graphs. 275-282 - Yuefang Sun, Xueliang Li:
On the difference of two generalized connectivities of a graph. 283-291 - Maja Cevnik, Janez Zerovnik:
Broadcasting on cactus graphs. 292-316 - Lin Sun, Jian-Liang Wu:
On (p, 1)-total labelling of planar graphs. 317-325 - Neethi K. S., Sanjeev Saxena:
Maximal independent sets in a generalisation of caterpillar graph. 326-332 - Joanna Skowronek-Kaziów:
Graphs with multiplicative vertex-coloring 2-edge-weightings. 333-338 - Dan Yin, Hong Gao, Zhaonian Zou, Jianzhong Li:
Minimized-cost cube query on heterogeneous information networks. 339-364
Volume 33, Number 2, February 2017
- Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity properties of complementary prisms. 365-372 - Bang Ye Wu, Li-Hsuan Chen:
An improved parameterized algorithm for the p-cluster vertex deletion problem. 373-388 - Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth:
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. 389-402 - Luis Evaristo Caraballo, Carlos Ochoa, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Matching colored points with rectangles. 403-421 - Neethi K. S., Sanjeev Saxena:
Maximum cardinality neighbourly sets in quadrilateral free graphs. 422-444 - Andrzej Kozik:
Handling precedence constraints in scheduling problems by the sequence pair representation. 445-472 - Manzhan Gu, Xiwen Lu, Jinwei Gu:
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan. 473-495 - Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis. 496-529 - Minghui Zhang, Xin Han, Yan Lan, Hing-Fung Ting:
Online bin packing problem with buffer and bounded size revisited. 530-542 - Clément Charpentier, Sylvain Gravier, Thomas Lecorre:
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs. 543-550 - Peter Brown, Yuedong Yang, Yaoqi Zhou, Wayne J. Pullan:
A heuristic for the time constrained asymmetric linear sum assignment problem. 551-566 - Qingqin Nong, G. Q. Fan, Qizhi Fang:
A coordination mechanism for a scheduling game with parallel-batching machines. 567-579 - Zixing Tang, Baoyindureng Wu, Lin Hu, Manouchehr Zaker:
More bounds for the Grundy number of graphs. 580-589 - Cong Chen, Yinfeng Xu, Yuqing Zhu, Chengyu Sun:
Online MapReduce scheduling problem of minimizing the makespan. 590-608 - Dan He, Wensong Lin:
On (s, t)-relaxed strong edge-coloring of graphs. 609-625 - Hongyu He, Mengqi Liu, Ji-Bo Wang:
Resource constrained scheduling with general truncated job-dependent learning effect. 626-644 - Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn:
On nonlinear multi-covering problems. 645-659 - Kai Deng, Heping Zhang:
Anti-forcing spectra of perfect matchings of graphs. 660-680 - Zhigang Cao, Xujin Chen, Xiaodong Hu, Changjun Wang:
Approximation algorithms for pricing with negative network externalities. 681-712 - A. Bahremandpour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Roman game domination number of a graph. 713-725 - Amiyne Zakouni, Jiawei Luo, Fouad Kharroubi:
Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks. 726-741 - Rafael F. Santos, Alessandro Andrioni, André C. Drummond, Eduardo C. Xavier:
Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks. 742-778 - Lin Sun, Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. 779-790 - Yingli Ran, Zhao Zhang, Hongwei Du, Yuqing Zhu:
Approximation algorithm for partial positive influence problem in social network. 791-802 - Zaixin Lu, Zhao Zhang, Weili Wu:
Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. 803-808
Volume 33, Number 3, April 2017
- Dmitriy S. Malyshev:
Polynomial-time approximation algorithms for the coloring problem in some cases. 809-813 - Filipa D. Carvalho, Maria Teresa Almeida:
The triangle k-club problem. 814-846 - Miao Zhang, Min Chen, Yiqiao Wang:
A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable. 847-865 - Jueliang Hu, Yiwei Jiang, Ping Zhou, An Zhang, Qinghui Zhang:
Total completion time minimization in online hierarchical scheduling of unit-size jobs. 866-881 - Yongjie Yang, Jiong Guo:
Possible winner problems on partial tournaments: a parameterized study. 882-896 - Amir Daneshgar, Meysam Madani:
On the odd girth and the circular chromatic number of generalized Petersen graphs. 897-923 - Xiaofeng Gu:
Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs. 924-933 - Xueling Zhong, Zhangming Pan, Dakui Jiang:
Scheduling with release times and rejection on two parallel machines. 934-944 - Zhang Xingong, Wang Yong:
Two-agent scheduling problems on a single-machine to minimize the total weighted late work. 945-955 - Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang:
Construction independent spanning trees on locally twisted cubes in parallel. 956-967 - Jeremy Lyle, Sean Patterson:
A note on the annihilation number and 2-domination number of a tree. 968-976 - Reinhard Bürgy, Heinz Gröflin:
The no-wait job shop with regular objective: a method based on optimal job insertion. 977-1010 - Qiaojun Shu, Weifan Wang, Yiqiao Wang:
A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. 1011-1020 - Karuvachery Pravas, Ambat Vijayakumar:
Convex median and anti-median at prescribed distance. 1021-1029 - Mehdy Roayaei, Mohammadreza Razzazi:
Augmenting weighted graphs to establish directed point-to-point connectivity. 1030-1056 - Assaf J. Kfoury, Saber Mirzaei:
Efficient reassembling of graphs, part 1: the linear case. 1057-1089 - Tao Wang:
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles. 1090-1105 - Chen-Wan Lin, Bang Ye Wu:
On the minimum routing cost clustered tree problem. 1106-1121 - Dongxiao Niu, Tiannan Ma, Bingyi Liu:
Power load forecasting by wavelet least squares support vector machine with improved fruit fly optimization algorithm. 1122-1143
Volume 33, Number 4, May 2017
- Liang Song, Hao Gu, Hejiao Huang:
A lower bound for the adaptive two-echelon capacitated vehicle routing problem. 1145-1167 - Chunyan Liu, Hejiao Huang, Hongwei Du:
Optimal RSUs deployment with delay bound along highways in VANET. 1168-1182 - Markus Chimani, Petr Hlinený:
A tighter insertion-based approximation of the crossing number. 1183-1225 - Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
Maximum flows in generalized processing networks. 1226-1256 - Byeong Moon Kim, Yoomi Rho, Byung Chul Song:
Lambda number for the direct product of some family of graphs. 1257-1265 - Wei Yang, Xinhui An, Baoyindureng Wu:
Paired-domination number of claw-free odd-regular graphs. 1266-1275 - Chunyan Liu, Hejiao Huang, Hongwei Du, Xiaohua Jia:
Optimal RSUs placement with delay bounded message dissemination in vehicular networks. 1276-1299 - Ulrich Pferschy, Joachim Schauer:
Approximation of knapsack problems with conflict and forcing graphs. 1300-1323 - Shuchao Li, Lin Liu, Yueyu Wu:
On the coefficients of the independence polynomial of graphs. 1324-1342 - Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu:
Even factors of graphs. 1343-1353 - Ying Bai, Xiangwen Li, Gexin Yu:
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable. 1354-1364 - Ushnish Sarkar, Avishek Adhikari:
A new graph parameter and a construction of larger graph without increasing radio k-chromatic number. 1365-1377 - Florian Pausinger:
Bounds for the traveling salesman paths of two-dimensional modular lattices. 1378-1394 - Ye Tian, Ke Li, Wei Yang, Zhiyong Li:
A new effective branch-and-bound algorithm to the high order MIMO detection problem. 1395-1410 - Guosong Yu, Yanling Mao, Jiaoliao Xiao:
A new upper bound for the online square packing problem in a strip. 1411-1420 - Nibedita Mandal, Pratima Panigrahi:
On irreducible no-hole L(2, 1)-coloring of subdivision of graphs. 1421-1442 - Xueliang Li, Di Wu:
The (vertex-)monochromatic index of a graph. 1443-1453 - Baruch Mor, Gur Mosheiov:
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. 1454-1468 - Adam Woryna:
The solution of a generalized secretary problem via analytic expressions. 1469-1491
a service of 
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-04-22 20:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
