Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 40
Volume 40, Number 1, July 2020
- Jiangxu Kong, Xiaoxue Hu
, Yiqiao Wang:
Plane graphs with Δ =7 are entirely 10-colorable. 1-20 - Wei Ding, Ke Qiu:
Approximating the asymmetric p-center problem in parameterized complete digraphs. 21-35 - Xiang Li, Hongbin George Du, Panos M. Pardalos:
A variation of DS decomposition in set function optimization. 36-44 - Haitao Wu, Yaojun Chen, Xiaolan Hu:
Planar graphs without 4- and 6-cycles are (7 : 2)-colorable. 45-58 - Yan Liu, Mengxia Lei, Xueli Su:
Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number. 59-68 - Anuj Rawat, Mark A. Shayman:
A $\frac{5}{2}$-approximation algorithm for coloring rooted subtrees of a degree 3 tree. 69-97 - M. R. Chithra, Manju K. Menon:
Secure domination of honeycomb networks. 98-109 - Zohreh Hosseini Nodeh, Ali Babapour Azar, Rashed Khanjani Shiraz, Salman Khodayifar, Panos M. Pardalos:
Joint chance constrained shortest path problem with Copula theory. 110-140 - Thi Thanh Sang Nguyen, Pham Minh Thu Do:
Classification optimization for training a large dataset with Naïve Bayes. 141-169 - Ji Tian, Yan Zhou, Ruyan Fu:
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown. 170-180 - Addie Armstrong, Nancy Eaton:
New restrictions on defective coloring with applications to steinberg-type graphs. 181-204 - Abbas Salehi, Behrooz Masoumi:
KATZ centrality with biogeography-based optimization for influence maximization problem. 205-226 - Lily Chen, Shumei Chen, Ren Zhao, Xiangqian Zhou:
The strong chromatic index of graphs with edge weight eight. 227-233 - Fernando A. Morales, Jairo A. Martínez:
Analysis of Divide-and-Conquer strategies for the 0-1 minimization knapsack problem. 234-278
Volume 40, Number 2, August 2020
- Radoslav Fulek, Csaba D. Tóth:
Crossing minimization in perturbed drawings. 279-302 - Brad D. Woods, Abraham P. Punnen:
A class of exponential neighbourhoods for the quadratic travelling salesman problem. 303-332 - Cong Chen, Yinfeng Xu:
Coordination mechanisms for scheduling selfish jobs with favorite machines. 333-365 - Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang:
Approximation algorithms for the selling with preference. 366-378 - Diego P. Rubert, Eloi Araujo, Marco Aurelio Stefanes, Jens Stoye, Fábio Viduani Martinez:
Searching and inferring colorful topological motifs in vertex-colored graphs. 379-411 - Xuqing Bai, Hong Chang, Xueliang Li:
More on limited packings in graphs. 412-430 - Hazhar Rahmani, Jason M. O'Kane:
Integer linear programming formulations of the filter partitioning minimization problem. 431-453 - Hakan Kutucu, Arif Gürsoy, Mehmet Kurt, Urfat G. Nuriyev:
The band collocation problem. 454-481 - Prosenjit Bose, Valentin Gledel, Claire Pennarun, Sander Verdonschot:
Power domination on triangular grids with triangular and hexagonal shape. 482-500 - Jafar Amjadi, R. Khoeilar, Mustapha Chellali, Zehui Shao:
On the Roman domination subdivision number of a graph. 501-511 - Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos:
On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering. 512-546 - Zeynep Adak, Mahmure Övül Arioglu Akan, Serol Bulkan:
Multiprocessor open shop problem: literature review and future directions. 547-569
Volume 40, Number 3, October 2020
- Zhuo Pan, Yu Yang, Xianyue Li, Shou-Jun Xu:
The complexity of total edge domination and some related results on trees. 571-589 - Pawan Aurora, Shashank K. Mehta:
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation. 590-609 - Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
Selfish colorful bin packing games. 610-635 - Masoumeh Zojaji, Mohammad Reza Mollakhalili Meybodi, Kamal Mirzaie:
A rapid learning automata-based approach for generalized minimum spanning tree problem. 636-659 - Norelhouda Sekkal, Fayçal Belkaid:
A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints. 660-696 - Peter Dankelmann, Fadekemi Janet Osaye:
Average eccentricity, minimum degree and maximum degree in graphs. 697-712 - B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap:
Maximum weight induced matching in some subclasses of bipartite graphs. 713-732 - Shuangyao Zhao, Qiang Zhang, Zhanglin Peng, Xiaonong Lu:
Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering. 733-756 - Zhuo Pan, Xianyue Li, Shou-Jun Xu:
Complexity and characterization aspects of edge-related domination for graphs. 757-773 - Zhichao Geng, Jiayu Liu:
Single machine batch scheduling with two non-disjoint agents and splitable jobs. 774-795 - Oleg Duginov:
Bottleneck subset-type restricted matching problems. 796-805 - Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang:
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. 806-824 - Wenguo Yang, Shengminjie Chen, Suixiang Gao, Ruidong Yan:
Boosting node activity by recommendations in social networks. 825-847 - Lu Han, Dachuan Xu, Yicheng Xu, Dongmei Zhang:
Approximating the τ-relaxed soft capacitated facility location problem. 848-860
Volume 40, Number 4, November 2020
- Dexin Zou, Chong Jiang, Weiwei Liu:
Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect. 861-868 - Brahim Chaourar:
Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$. 869-875 - Rico Walter, Alexander Lawrinenko:
A characterization of optimal multiprocessor schedules and new dominance rules. 876-900 - Xiang Li, Hongbin George Du:
A short proof for stronger version of DS decomposition in set function optimization. 901-906 - Wenguo Yang, Yapu Zhang, Ding-Zhu Du:
Influence maximization problem: properties and algorithms. 907-928 - Peihai Liu, Xiwen Lu:
New approximation algorithms for machine scheduling with rejection on single and parallel machine. 929-952 - Tomás Vetrík, Selvaraj Balachandran:
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number. 953-973 - Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online maximum matching with recourse. 974-1007 - Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang:
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. 1008-1019 - Jun Wang, Huajun Zhang:
Intersecting families in $\left( {\begin{array}{c}{[m]}\\ \ell \end{array}}\right) \cup \left( {\begin{array}{c}{[n]}\\ k\end{array}}\right) $. 1020-1029 - Kien Trung Nguyen, Nguyen Thanh Hung, Huong Nguyen-Thu:
A linear time algorithm for the p-maxian problem on trees with distance constraint. 1030-1043 - Ren-Xia Chen, Shi-Sheng Li:
Minimizing maximum delivery completion time for order scheduling with rejection. 1044-1064 - Shaojing Du, Suogang Gao, Bo Hou, Wen Liu:
An approximation algorithm for submodular hitting set problem with linear penalties. 1065-1074 - Javad Tayyebi, Ali Reza Sepasian:
Partial inverse min-max spanning tree problem. 1075-1091 - A'na Wang, Meirui Ren, Hailong Ma, Lichen Zhang, Peng Li, Longjiang Guo:
Maximizing user type diversity for task assignment in crowdsourcing. 1092-1120 - Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum Wiener index of maximal planar graphs. 1121-1135
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-05-31 18:44 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:
