Journal of Combinatorial Optimization, Volume 38 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Journal of Combinatorial Optimization

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 38, Number 1, July 2019

• 
  • 
  • 
  • 
  • 
    Bin Liu, Yuxia Yan, Qizhi Fang, Junyu Dong, Weili Wu, Huijuan Wang:
    Maximizing profit of multiple adoptions in social networks with a martingale approach. 1-20
• 
  • 
  • 
  • 
  • 
    Chen Chen, Yu Wei:
    Robust multiobjective portfolio optimization: a set order relations approach. 21-49
• 
  • 
  • 
  • 
  • 
    Baruch Mor:
    Minmax scheduling problems with common due-date and completion time penalty. 50-71
• 
  • 
  • 
  • 
  • 
    Dávid Szeszlér:
    Hitting a path: a generalization of weighted connectivity via game theory. 72-85
• 
  • 
  • 
  • 
  • 
    L. Bayón, Pedro Fortuny, J. M. Grau, Antonio M. Oller-Marcén, M. M. Ruiz:
    The Best-or-Worst and the Postdoc problems with random number of candidates. 86-110
• 
  • 
  • 
  • 
  • 
    Douglas S. Altner, Erica K. Mason, Leslie D. Servi:
    Two-stage stochastic days-off scheduling of multi-skilled analysts with training options. 111-129
• 
  • 
  • 
  • 
  • 
    Iztok Peterin, Ismael González Yero:
    Efficient closed domination in digraph products. 130-149
• 
  • 
  • 
  • 
  • 
    Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang:
    An improved approximation algorithm for the minimum 3-path partition problem. 150-164
• 
  • 
  • 
  • 
  • 
    Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
    Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. 165-184
• 
  • 
  • 
  • 
  • 
    Yulin Chang, Qiancheng Ouyang, Guanghui Wang:
    Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10. 185-196
• 
  • 
  • 
  • 
  • 
    Huijuan Wang, Panos M. Pardalos, Bin Liu:
    Optimal channel assignment with list-edge coloring. 197-207
• 
  • 
  • 
  • 
  • 
    Jianming Zhu, Shuyue Liu, Smita Ghosh:
    Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update. 208-223
• 
  • 
  • 
  • 
  • 
    Nicolas Pinson, Frits C. R. Spieksma:
    Online interval scheduling on two related machines: the power of lookahead. 224-253
• 
  • 
  • 
  • 
  • 
    Davood Shiri, F. Sibel Salman:
    On the randomized online strategies for the k-Canadian traveler problem. 254-267
• 
  • 
  • 
  • 
  • 
    Xueliang Li, Wen Xia:
    Skew-rank of an oriented graph and independence number of its underlying graph. 268-277
• 
  • 
  • 
  • 
  • 
    Song Luo, Yuji Matsuura, Ying Miao, Maiko Shigeno:
    Non-adaptive group testing on graphs with connectivity. 278-291
• 
  • 
  • 
  • 
  • 
    Boris Brimkov, Derek Mikesell, Logan A. Smith:
    Connected power domination in graphs. 292-315
• 
  • 
  • 
  • 
  • 
    Maksim Barketau:
    Determining the interset distance. 316-332

Volume 38, Number 2, August 2019

• 
  • 
  • 
  • 
  • 
    Rana Khoeilar, Hossein Karami, Seyed Mahmoud Sheikholeslami:
    On two conjectures concerning total domination subdivision number in graphs. 333-340
• 
  • 
  • 
  • 
  • 
    Byung-Cheon Choi, Changmuk Kang:
    A linear time-cost tradeoff problem with multiple milestones under a comb graph. 341-361
• 
  • 
  • 
  • 
  • 
    Peter Damaschke:
    Parameterized Mixed Graph Coloring. 362-374
• 
  • 
  • 
  • 
  • 
    Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa:
    Approximation algorithms for Median Hub Location Problems. 375-401
• 
  • 
  • 
  • 
  • 
    Kai Yang, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du:
    A temporal logic programming approach to planning. 402-420
• 
  • 
  • 
  • 
  • 
    Shuchao Li, Licheng Zhang, Minjie Zhang:
    On the extremal cacti of given parameters with respect to the difference of zagreb indices. 421-442
• 
  • 
  • 
  • 
  • 
    Hechao Liu, Hanyuan Deng, Zikai Tang:
    Minimum Szeged index among unicyclic graphs with perfect matchings. 443-455
• 
  • 
  • 
  • 
  • 
    Wai Lam Fong, Wai Hong Chan:
    The edge coloring game on trees with the number of colors greater than the game chromatic index. 456-480
• 
  • 
  • 
  • 
  • 
    Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani:
    Clustering without replication in combinatorial circuits. 481-501
• 
  • 
  • 
  • 
  • 
    Damir Hasic, Eric Tannier:
    Gene tree reconciliation including transfers with replacement is NP-hard and FPT. 502-544
• 
  • 
  • 
  • 
  • 
    Dan Yi, Junlei Zhu, Lixia Feng, Jiaxin Wang, Mengyini Yang:
    Optimal r-dynamic coloring of sparse graphs. 545-555
• 
  • 
  • 
  • 
  • 
    Liying Kang, Lele Liu, Erfang Shan:
    The eigenvectors to the p-spectral radius of general hypergraphs. 556-569
• 
  • 
  • 
  • 
  • 
    Yong Lu, Ligong Wang, Qiannan Zhou:
    The rank of a complex unit gain graph in terms of the rank of its underlying graph. 570-588
• 
  • 
  • 
  • 
  • 
    Jun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu:
    A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. 589-607
• 
  • 
  • 
  • 
  • 
    Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt:
    A tight linear time \frac{13}{12}−approximationalgorithmforthe-approximation algorithm for the−approximationalgorithmfortheP2 || C_{\max }$$ problem. 608-617
• 
  • 
  • 
  • 
  • 
    Jin Zhang, Min Li, Yishui Wang, Chenchen Wu, Dachuan Xu:
    Approximation algorithm for squared metric two-stage stochastic facility location problem. 618-634
• 
  • 
  • 
  • 
  • 
    Yuchao Li, Wei Wang, Zishen Yang:
    The connected vertex cover problem in k-regular graphs. 635-645
• 
  • 
  • 
  • 
  • 
    Shuichi Miyazaki, Kazuya Okamoto:
    Jointly stable matchings. 646-665

Volume 38, Number 3, October 2019

• 
  • 
  • 
  • 
  • 
    Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou:
    Extremal digraphs for an upper bound on the Roman domination number. 667-679
• 
  • 
  • 
  • 
  • 
    Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou:
    On the k-domination number of digraphs. 680-688
• 
  • 
  • 
  • 
  • 
    Li Guan, Jianping Li, Weidong Li, Junran Lichen:
    Improved approximation algorithms for the combination problem of parallel machine scheduling and path. 689-697
• 
  • 
  • 
  • 
  • 
    Yuan Gao, Jinjiang Yuan:
    Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. 698-711
• 
  • 
  • 
  • 
  • 
    Mahsa Darkooti, Abdollah Alhevaz, Sadegh Rahimi, Hadi Rahbani:
    On perfect Roman domination number in trees: complexity and bounds. 712-720
• 
  • 
  • 
  • 
  • 
    Majid Hajian, Michael A. Henning, Nader Jafari Rad:
    A new lower bound on the domination number of a graph. 721-738
• 
  • 
  • 
  • 
  • 
    Doost Ali Mojdeh, Babak Samadi:
    Packing parameters in graphs: new bounds and a solution to an open problem. 739-747
• 
  • 
  • 
  • 
  • 
    Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol, Mauricio G. C. Resende:
    Hybrid algorithms for placement of virtual machines across geo-separated data centers. 748-793
• 
  • 
  • 
  • 
  • 
    Zuosong Liang, Erfang Shan, Liying Kang:
    The clique-perfectness and clique-coloring of outer-planar graphs. 794-807
• 
  • 
  • 
  • 
  • 
    Mohamed Barkaoui, Jean Berger, Abdeslem Boukhtouta:
    An evolutionary approach for the target search problem in uncertain environment. 808-835
• 
  • 
  • 
  • 
  • 
    Zepeng Li, Zehui Shao, Shoujun Xu:
    2-Rainbow domination stability of graphs. 836-845
• 
  • 
  • 
  • 
  • 
    Leah Epstein:
    A lower bound for online rectangle packing. 846-866
• 
  • 
  • 
  • 
  • 
    Gergely Kovács, Benedek Nagy, Béla Vizvári:
    Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach. 867-886
• 
  • 
  • 
  • 
  • 
    Ping Li, Lan Wang, Yang Wu, Hong-Jian Lai:
    Characterizations of matroids with an element lying in a restricted number of circuits. 887-910
• 
  • 
  • 
  • 
  • 
    Michael A. Henning, Pawaton Kaemawichanurat:
    Semipaired domination in maximal outerplanar graphs. 911-926
• 
  • 
  • 
  • 
  • 
    Marika Ivanová, Dag Haugland:
    Integer programming formulations for the shared multicast tree problem. 927-956
• 
  • 
  • 
  • 
  • 
    Shi-Sheng Li, Ren-Xia Chen, Qi Feng, Chengwen Jiao:
    Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. 957-971
• 
  • 
  • 
  • 
  • 
    Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang:
    Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. 972-986

Volume 38, Number 4, November 2019

• 
  • 
  • 
  • 
  • 
    Yuqing Zhu, Ruidong Yan, Deying Li:
    Minimum cost stability in exchange networks. 987-1004
• 
  • 
  • 
  • 
  • 
    Xianyue Li, Xichao Shu, Huijing Huang, Jingjing Bai:
    Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. 1005-1018
• 
  • 
  • 
  • 
  • 
    Chuanwen Luo, Yongcai Wang, Yi Hong, Wenping Chen, Xingjian Ding, Yuqing Zhu, Deying Li:
    Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks. 1019-1042
• 
  • 
  • 
  • 
  • 
    Kenjiro Takazawa:
    Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function. 1043-1065
• 
  • 
  • 
  • 
  • 
    Yiwei Jiang, Ping Zhou, Wei Zhou:
    MapReduce machine covering problem on a small number of machines. 1066-1076
• 
  • 
  • 
  • 
  • 
    Chen Song, Rong-Xia Hao:
    Antimagic orientations for the complete k-ary trees. 1077-1085
• 
  • 
  • 
  • 
  • 
    Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, Joanna Tomasik:
    Multiple Canadians on the road: minimizing the distance competitive ratio. 1086-1100
• 
  • 
  • 
  • 
  • 
    Canh V. Pham, Quat V. Phu, Huan X. Hoang, Jun Pei, My T. Thai:
    Minimum budget for misinformation blocking in online social networks. 1101-1127
• 
  • 
  • 
  • 
  • 
    Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang:
    The α-spectral radius of uniform hypergraphs concerning degrees and domination number. 1128-1142
• 
  • 
  • 
  • 
  • 
    Shunzhe Zhang, Huiqing Liu, Dong Li, Xiaolan Hu:
    Fractional matching preclusion of the restricted HL-graphs. 1143-1154
• 
  • 
  • 
  • 
  • 
    Kameng Nip, Zhenbo Wang:
    On the approximability of the two-phase knapsack problem. 1155-1179
• 
  • 
  • 
  • 
  • 
    Micheal Arockiaraj, Jessie Abraham, Arul Jeya Shalini:
    Node set optimization problem for complete Josephus cubes. 1180-1195
• 
  • 
  • 
  • 
  • 
    Ali Çivril:
    Approximation of Steiner forest via the bidirected cut relaxation. 1196-1212
• 
  • 
  • 
  • 
  • 
    Madalina M. Drugan:
    Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem. 1213-1262
• 
  • 
  • 
  • 
  • 
    Xiaofei Qian, Jun Pei, Xinbao Liu, Mi Zhou, Panos M. Pardalos:
    Information security decisions for two firms in a market with different types of customers. 1263-1285
• 
  • 
  • 
  • 
  • 
    Wenwen Tian, Fei Zhao, Zheng Sun, Xuesong Mei, Guangde Chen:
    Orderings of a class of trees with respect to the Merrifield-Simmons index and the Hosoya index. 1286-1295
• 
  • 
  • 
  • 
  • 
    Huajun Zhang:
    On the maximum size of subfamilies of labeled set with given matching number. 1296-1304

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: