Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 39
Volume 39, Number 1, January 2020
- Minghui Zhang, Yan Lan, Xin Han:
Approximation algorithms for two-stage flexible flow shop scheduling. 1-14 - Min Li, Dachuan Xu
, Jun Yue, Dongmei Zhang, Peng Zhang:
The seeding algorithm for k-means problem with penalties. 15-32 - Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos:
Less is more approach for competing groups scheduling with different learning effects. 33-54 - Andrzej Lingas, Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Graphs with equal domination and covering numbers. 55-71 - Enqiang Zhu, Chanjuan Liu, Jiguo Yu:
Neighbor product distinguishing total colorings of 2-degenerate graphs. 72-76 - Michael A. Henning, Anders Yeo:
Bounds on upper transversals in hypergraphs. 77-89 - S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Algorithmic results on double Roman domination in graphs. 90-114 - Lifang Zhao, Hongshuai Li, Yuping Gao:
On the extremal graphs with respect to the total reciprocal edge-eccentricity. 115-137 - Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang, Xiaoyan Zhang:
Approximation algorithm for a generalized Roman domination problem in unit ball graphs. 138-148 - Jan Florek:
Remarks on Barnette's conjecture. 149-155 - Bi Li, Xin Zhang:
Tree-coloring problems of bounded treewidth graphs. 156-169 - Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. 170-184 - Shuwan Zhu, Wenjuan Fan, Tongzhu Liu, Shanlin Yang, Panos M. Pardalos:
Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs. 185-215 - Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient algorithms for measuring the funnel-likeness of DAGs. 216-245 - Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia:
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. 246-272 - Miklós Bartha, Miklós Krész:
On the König deficiency of zero-reducible graphs. 273-292 - Chao Song, Changqing Xu:
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13. 293-303
Volume 39, Number 2, February 2020
- Shaojie Tang:
Price of dependence: stochastic submodular maximization with dependent items. 305-314 - Anna B. Khmelnitskaya, Özer Selçuk, Dolf Talman:
The average covering tree value for directed graph games. 315-333 - Yuezhong Zhang, Suogang Gao:
On the edge metric dimension of convex polytopes and its related graphs. 334-350 - Xiangxiang Liu, Ligong Wang, Xihe Li:
The Wiener index of hypergraphs. 351-364 - Shuchao Li, Wanting Sun:
On the zero forcing number of a graph involving some classical parameters. 365-384 - Sabrine Malek, Wady Naanaa:
A new approximate cluster deletion algorithm for diamond-free graphs. 385-411 - Hervé Hocquard, Jakub Przybylo:
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. 412-424 - Yanxia Dong, Moo Young Sohn, Zuosong Liang:
Domination and matching in power and generalized power hypergraphs. 425-436 - Renzo Gómez, Yoshiko Wakabayashi:
Nontrivial path covers of graphs: existence, minimization and maximization. 437-456 - Patrick J. Andersen, Charl J. Ras:
Degree bounded bottleneck spanning trees in three dimensions. 457-491 - Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang, Yujie Zheng:
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. 492-508 - Wenming Zhang, Yongxi Cheng:
A new upper bound on the work function algorithm for the k-server problem. 509-518 - Chunmei Ma, Dan Huang:
Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain. 519-546 - Wenjuan Fan, Yi Wang, Tongzhu Liu, Guixian Tong:
A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA-VNS algorithm. 547-580 - Xin Zhang, Bei Niu:
Equitable partition of graphs into induced linear forests. 581-588 - Sonu Rani, Sasmita Barik:
On alternating paths and the smallest positive eigenvalue of trees. 589-601 - Fraj Naifar, Mariem Gzara, Taïcir Moalla Loukil:
A new leader guided optimization for the flexible job shop problem. 602-617 - Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
Local search strikes again: PTAS for variants of geometric covering and packing. 618-635
Volume 39, Number 3, April 2020
- Qiulan Zhao, Jinjiang Yuan:
Bicriteria scheduling of equal length jobs on uniform parallel machines. 637-661 - Tien Tran, Dung T. Huynh:
The complexity of symmetric connectivity in directional wireless sensor networks. 662-686 - Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck:
Compact quadratizations for pseudo-Boolean functions. 687-707 - Feifeng Zheng, Yaxin Pang, Ming Liu, Yinfeng Xu:
Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles. 708-724 - Yingli Ran, Yishuo Shi, Changbing Tang, Zhao Zhang:
A primal-dual algorithm for the minimum partial set multi-cover problem. 725-746 - Abolfazl Poureidi, Nader Jafari Rad:
Algorithmic and complexity aspects of problems related to total Roman domination for graphs. 747-763 - Vincent T'kindt, Lei Shang, Federico Della Croce:
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. 764-775 - Lkhagva Buyantogtokh, Batmend Horoldagva, Kinkar Chandra Das:
On reduced second Zagreb index. 776-791 - Rupaj Kumar Nayak, Nirmalya Kumar Mohanty:
Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation. 792-825 - Shuo-I Wang, Fu-Hsing Wang:
Linear time algorithms for finding independent spanning trees on pyramid networks. 826-848 - Daniel Li Li, Erfang Shan:
Marginal contributions and derivatives for set functions in cooperative games. 849-858 - Liqiong Xu, Yingzhi Tian, Hong-Jian Lai:
On the sizes of bi-k-maximal graphs. 859-873 - Natalia de Castro, María Ángeles Garrido-Vizuete, Rafael Robles, María Trinidad Villar-Liñán:
Contrast in greyscales of graphs. 874-898 - Yi Hong, Yongcai Wang, Yuqing Zhu, Deying Li, Zhibo Chen, Jing Li:
3D camera sensor scheduling algorithms for indoor multi-objective tracking. 899-914 - Ruizhi Lin, Heping Zhang:
Fractional matching preclusion number of graphs and the perfect matching polytope. 915-932
Volume 39, Number 4, May 2020
- Yi Chu, Boxiao Liu, Shaowei Cai, Chuan Luo, Haihang You:
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs. 933-954 - Qiulan Zhao, Zhibin Chen, Jiajun Sang:
Co-density and fractional edge cover packing. 955-987 - Sergey Bereg, Andrew Brunner, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
On the robustness of a synchronized multi-robot system. 988-1016 - Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh:
Maximum independent and disjoint coverage. 1017-1037 - Atílio G. Luiz, C. N. Campos, Simone Dantas, Diana Sasaki:
Neighbour-distinguishing labellings of powers of paths and powers of cycles. 1038-1059 - Dawei Li, Xiwen Lu:
Two-machine flow shop scheduling with an operator non-availability period to minimize makespan. 1060-1078 - Sajjad Salehi, Fattaneh Taghiyareh:
Stabilizing social structure via modifying local patterns. 1079-1095 - Frank de Meijer, Renata Sotirov:
The quadratic cycle cover problem: special cases and efficient bounds. 1096-1128 - Yulin Chang, Fei Jing, Guanghui Wang:
Local antimagic orientation of graphs. 1129-1152 - Assaf J. Kfoury, Benjamin Sisson:
Efficient reassembling of three-regular planar graphs. 1153-1207 - Qingqin Nong, Jiazhu Fang, Suning Gong, Ding-Zhu Du, Yan Feng, Xiaoying Qu:
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice. 1208-1220
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-06-24 20:03 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:
