Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jco/jco38.bht:"
download as .bib file
@article{DBLP:journals/jco/AltnerMS19,
author = {Douglas S. Altner and
Erica K. Mason and
Leslie D. Servi},
title = {Two-stage stochastic days-off scheduling of multi-skilled analysts
with training options},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {111--129},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0368-5},
doi = {10.1007/S10878-018-0368-5},
timestamp = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AltnerMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ArockiarajAS19,
author = {Micheal Arockiaraj and
Jessie Abraham and
Arul Jeya Shalini},
title = {Node set optimization problem for complete Josephus cubes},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1180--1195},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00443-9},
doi = {10.1007/S10878-019-00443-9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ArockiarajAS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarkaouiBB19,
author = {Mohamed Barkaoui and
Jean Berger and
Abdeslem Boukhtouta},
title = {An evolutionary approach for the target search problem in uncertain
environment},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {808--835},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00413-1},
doi = {10.1007/S10878-019-00413-1},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarkaouiBB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Barketau19,
author = {Maksim Barketau},
title = {Determining the interset distance},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {316--332},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00384-3},
doi = {10.1007/S10878-019-00384-3},
timestamp = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Barketau19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BayonFGOR19,
author = {L. Bay{\'{o}}n and
Pedro Fortuny and
J. M. Grau and
Antonio M. Oller{-}Marc{\'{e}}n and
M. M. Ruiz},
title = {The Best-or-Worst and the Postdoc problems with random number of candidates},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {86--110},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0367-6},
doi = {10.1007/S10878-018-0367-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BayonFGOR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeneditoP19,
author = {Marcelo Pinheiro Leite Benedito and
Lehilton L. C. Pedrosa},
title = {Approximation algorithms for Median Hub Location Problems},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {375--401},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00386-1},
doi = {10.1007/S10878-019-00386-1},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BeneditoP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BergeDGLRT19,
author = {Pierre Berg{\'{e}} and
Jean Desmarchelier and
Wen Guo and
Aur{\'{e}}lie Lefebvre and
Arpad Rimmel and
Joanna Tomasik},
title = {Multiple Canadians on the road: minimizing the distance competitive
ratio},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1086--1100},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00438-6},
doi = {10.1007/S10878-019-00438-6},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BergeDGLRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BrimkovMS19,
author = {Boris Brimkov and
Derek Mikesell and
Logan A. Smith},
title = {Connected power domination in graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {292--315},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00380-7},
doi = {10.1007/S10878-019-00380-7},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BrimkovMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangOW19,
author = {Yulin Chang and
Qiancheng Ouyang and
Guanghui Wang},
title = {Adjacent vertex distinguishing total choosability of planar graphs
with maximum degree at least 10},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {185--196},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-00375-w},
doi = {10.1007/S10878-018-00375-W},
timestamp = {Mon, 14 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChangOW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenGLSXZ19,
author = {Yong Chen and
Randy Goebel and
Guohui Lin and
Bing Su and
Yao Xu and
An Zhang},
title = {An improved approximation algorithm for the minimum 3-path partition
problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {150--164},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-00372-z},
doi = {10.1007/S10878-018-00372-Z},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenGLSXZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenW19,
author = {Chen Chen and
Yu Wei},
title = {Robust multiobjective portfolio optimization: a set order relations
approach},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {21--49},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0364-9},
doi = {10.1007/S10878-018-0364-9},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChoiK19,
author = {Byung{-}Cheon Choi and
Changmuk Kang},
title = {A linear time-cost tradeoff problem with multiple milestones under
a comb graph},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {341--361},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00385-2},
doi = {10.1007/S10878-019-00385-2},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChoiK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Civril19,
author = {Ali {\c{C}}ivril},
title = {Approximation of Steiner forest via the bidirected cut relaxation},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1196--1212},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00444-8},
doi = {10.1007/S10878-019-00444-8},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Civril19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CroceST19,
author = {Federico Della Croce and
Rosario Scatamacchia and
Vincent T'kindt},
title = {A tight linear time {\textdollar}{\textdollar}{\textbackslash}frac\{13\}\{12\}{\textdollar}{\textdollar}
-approximation algorithm for the {\textdollar}{\textdollar}P2 {\(\vert\)}{\(\vert\)}
C{\_}\{{\textbackslash}max \}{\textdollar}{\textdollar} problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {608--617},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00399-w},
doi = {10.1007/S10878-019-00399-W},
timestamp = {Fri, 16 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CroceST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DEmidioFFLP19,
author = {Mattia D'Emidio and
Luca Forlizzi and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
title = {Hardness, approximability, and fixed-parameter tractability of the
clustered shortest-path tree problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {165--184},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-00374-x},
doi = {10.1007/S10878-018-00374-X},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DEmidioFFLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Damaschke19,
author = {Peter Damaschke},
title = {Parameterized Mixed Graph Coloring},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {362--374},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00388-z},
doi = {10.1007/S10878-019-00388-Z},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Damaschke19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DarkootiARR19,
author = {Mahsa Darkooti and
Abdollah Alhevaz and
Sadegh Rahimi and
Hadi Rahbani},
title = {On perfect Roman domination number in trees: complexity and bounds},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {712--720},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00408-y},
doi = {10.1007/S10878-019-00408-Y},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DarkootiARR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DonovanGMS19,
author = {Zola Donovan and
Gregory Z. Gutin and
Vahan Mkrtchyan and
K. Subramani},
title = {Clustering without replication in combinatorial circuits},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {481--501},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00394-1},
doi = {10.1007/S10878-019-00394-1},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DonovanGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Drugan19a,
author = {Madalina M. Drugan},
title = {Random walk's correlation function for multi-objective {NK} landscapes
and quadratic assignment problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1213--1262},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00445-7},
doi = {10.1007/S10878-019-00445-7},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Drugan19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Epstein19,
author = {Leah Epstein},
title = {A lower bound for online rectangle packing},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {846--866},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00423-z},
doi = {10.1007/S10878-019-00423-Z},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Epstein19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FongC19,
author = {Wai Lam Fong and
Wai Hong Chan},
title = {The edge coloring game on trees with the number of colors greater
than the game chromatic index},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {456--480},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00395-0},
doi = {10.1007/S10878-019-00395-0},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FongC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaoY19,
author = {Yuan Gao and
Jinjiang Yuan},
title = {Unbounded parallel-batch scheduling under agreeable release and processing
to minimize total weighted number of tardy jobs},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {698--711},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00407-z},
doi = {10.1007/S10878-019-00407-Z},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GaoY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuanLLL19,
author = {Li Guan and
Jianping Li and
Weidong Li and
Junran Lichen},
title = {Improved approximation algorithms for the combination problem of parallel
machine scheduling and path},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {689--697},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00406-0},
doi = {10.1007/S10878-019-00406-0},
timestamp = {Tue, 14 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuanLLL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HajianHR19,
author = {Majid Hajian and
Michael A. Henning and
Nader Jafari Rad},
title = {A new lower bound on the domination number of a graph},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {721--738},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00409-x},
doi = {10.1007/S10878-019-00409-X},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HajianHR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HasicT19,
author = {Damir Hasic and
Eric Tannier},
title = {Gene tree reconciliation including transfers with replacement is NP-hard
and {FPT}},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {502--544},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00396-z},
doi = {10.1007/S10878-019-00396-Z},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HasicT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HenningK19,
author = {Michael A. Henning and
Pawaton Kaemawichanurat},
title = {Semipaired domination in maximal outerplanar graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {911--926},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00427-9},
doi = {10.1007/S10878-019-00427-9},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HenningK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/IvanovaH19,
author = {Marika Ivanov{\'{a}} and
Dag Haugland},
title = {Integer programming formulations for the shared multicast tree problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {927--956},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00428-8},
doi = {10.1007/S10878-019-00428-8},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/IvanovaH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangZZ19,
author = {Yiwei Jiang and
Ping Zhou and
Wei Zhou},
title = {MapReduce machine covering problem on a small number of machines},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1066--1076},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00436-8},
doi = {10.1007/S10878-019-00436-8},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JiangZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KangLS19,
author = {Liying Kang and
Lele Liu and
Erfang Shan},
title = {The eigenvectors to the p-spectral radius of general hypergraphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {556--569},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00393-2},
doi = {10.1007/S10878-019-00393-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KangLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KaoPHWC19,
author = {Shih{-}Shun Kao and
Kung{-}Jui Pai and
Sun{-}Yuan Hsieh and
Ro{-}Yu Wu and
Jou{-}Ming Chang},
title = {Amortized efficiency of constructing multiple independent spanning
trees on bubble-sort networks},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {972--986},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00430-0},
doi = {10.1007/S10878-019-00430-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KaoPHWC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KhoeilarKS19,
author = {Rana Khoeilar and
Hossein Karami and
Seyed Mahmoud Sheikholeslami},
title = {On two conjectures concerning total domination subdivision number
in graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {333--340},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00383-4},
doi = {10.1007/S10878-019-00383-4},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KhoeilarKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KovacsNV19,
author = {Gergely Kov{\'{a}}cs and
Benedek Nagy and
B{\'{e}}la Vizv{\'{a}}ri},
title = {Chamfer distances on the isometric grid: a structural description
of minimal distances based on linear programming approach},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {867--886},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00425-x},
doi = {10.1007/S10878-019-00425-X},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KovacsNV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiCFJ19,
author = {Shi{-}Sheng Li and
Ren{-}Xia Chen and
Qi Feng and
Chengwen Jiao},
title = {Parallel-machine scheduling with job-dependent cumulative deterioration
effect and rejection},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {957--971},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00429-7},
doi = {10.1007/S10878-019-00429-7},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiCFJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiSHB19,
author = {Xianyue Li and
Xichao Shu and
Huijing Huang and
Jingjing Bai},
title = {Capacitated partial inverse maximum spanning tree under the weighted
Hamming distance},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1005--1018},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00433-x},
doi = {10.1007/S10878-019-00433-X},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiSHB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiSX19,
author = {Zepeng Li and
Zehui Shao and
Shoujun Xu},
title = {2-Rainbow domination stability of graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {836--845},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00414-0},
doi = {10.1007/S10878-019-00414-0},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiSX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiWWL19,
author = {Ping Li and
Lan Wang and
Yang Wu and
Hong{-}Jian Lai},
title = {Characterizations of matroids with an element lying in a restricted
number of circuits},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {887--910},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00426-w},
doi = {10.1007/S10878-019-00426-W},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiWWL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiWY19,
author = {Yuchao Li and
Wei Wang and
Zishen Yang},
title = {The connected vertex cover problem in k-regular graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {635--645},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00403-3},
doi = {10.1007/S10878-019-00403-3},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiX19,
author = {Xueliang Li and
Wen Xia},
title = {Skew-rank of an oriented graph and independence number of its underlying
graph},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {268--277},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00382-5},
doi = {10.1007/S10878-019-00382-5},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZZ19,
author = {Shuchao Li and
Licheng Zhang and
Minjie Zhang},
title = {On the extremal cacti of given parameters with respect to the difference
of zagreb indices},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {421--442},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00391-4},
doi = {10.1007/S10878-019-00391-4},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangLQY19,
author = {Jun Liang and
Dingjun Lou and
Zongrong Qin and
Qinglin Yu},
title = {A polynomial algorithm determining cyclic vertex connectivity of 4-regular
graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {589--607},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00400-6},
doi = {10.1007/S10878-019-00400-6},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiangLQY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangSK19,
author = {Zuosong Liang and
Erfang Shan and
Liying Kang},
title = {The clique-perfectness and clique-coloring of outer-planar graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {794--807},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00412-2},
doi = {10.1007/S10878-019-00412-2},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangSK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuDT19,
author = {Hechao Liu and
Hanyuan Deng and
Zikai Tang},
title = {Minimum Szeged index among unicyclic graphs with perfect matchings},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {443--455},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00390-5},
doi = {10.1007/S10878-019-00390-5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuDT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuYFDWW19,
author = {Bin Liu and
Yuxia Yan and
Qizhi Fang and
Junyu Dong and
Weili Wu and
Huijuan Wang},
title = {Maximizing profit of multiple adoptions in social networks with a
martingale approach},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {1--20},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0361-z},
doi = {10.1007/S10878-018-0361-Z},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuYFDWW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuWZ19,
author = {Yong Lu and
Ligong Wang and
Qiannan Zhou},
title = {The rank of a complex unit gain graph in terms of the rank of its
underlying graph},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {570--588},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00397-y},
doi = {10.1007/S10878-019-00397-Y},
timestamp = {Mon, 04 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuoMMS19,
author = {Song Luo and
Yuji Matsuura and
Ying Miao and
Maiko Shigeno},
title = {Non-adaptive group testing on graphs with connectivity},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {278--291},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00379-0},
doi = {10.1007/S10878-019-00379-0},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuoMMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuoWHCDZL19,
author = {Chuanwen Luo and
Yongcai Wang and
Yi Hong and
Wenping Chen and
Xingjian Ding and
Yuqing Zhu and
Deying Li},
title = {Minimizing data collection latency with unmanned aerial vehicle in
wireless sensor networks},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1019--1042},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00434-w},
doi = {10.1007/S10878-019-00434-W},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuoWHCDZL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MiyazakiO19,
author = {Shuichi Miyazaki and
Kazuya Okamoto},
title = {Jointly stable matchings},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {646--665},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00402-4},
doi = {10.1007/S10878-019-00402-4},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MiyazakiO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MojdehS19,
author = {Doost Ali Mojdeh and
Babak Samadi},
title = {Packing parameters in graphs: new bounds and a solution to an open
problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {739--747},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00410-4},
doi = {10.1007/S10878-019-00410-4},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MojdehS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Mor19,
author = {Baruch Mor},
title = {Minmax scheduling problems with common due-date and completion time
penalty},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {50--71},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0365-8},
doi = {10.1007/S10878-018-0365-8},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Mor19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NipW19,
author = {Kameng Nip and
Zhenbo Wang},
title = {On the approximability of the two-phase knapsack problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1155--1179},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00442-w},
doi = {10.1007/S10878-019-00442-W},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NipW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OuldrabahBB19,
author = {Lyes Ouldrabah and
Mostafa Blidia and
Ahmed Bouchou},
title = {Extremal digraphs for an upper bound on the Roman domination number},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {667--679},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00401-5},
doi = {10.1007/S10878-019-00401-5},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/OuldrabahBB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OuldrabahBB19a,
author = {Lyes Ouldrabah and
Mostafa Blidia and
Ahmed Bouchou},
title = {On the k-domination number of digraphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {680--688},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00405-1},
doi = {10.1007/S10878-019-00405-1},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/OuldrabahBB19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PeterinY19,
author = {Iztok Peterin and
Ismael Gonz{\'{a}}lez Yero},
title = {Efficient closed domination in digraph products},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {130--149},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0370-y},
doi = {10.1007/S10878-018-0370-Y},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PeterinY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PhamPHPT19,
author = {Canh V. Pham and
Quat V. Phu and
Huan X. Hoang and
Jun Pei and
My T. Thai},
title = {Minimum budget for misinformation blocking in online social networks},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1101--1127},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00439-5},
doi = {10.1007/S10878-019-00439-5},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PhamPHPT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PinsonS19,
author = {Nicolas Pinson and
Frits C. R. Spieksma},
title = {Online interval scheduling on two related machines: the power of lookahead},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {224--253},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00381-6},
doi = {10.1007/S10878-019-00381-6},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PinsonS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/QianPLZP19,
author = {Xiaofei Qian and
Jun Pei and
Xinbao Liu and
Mi Zhou and
Panos M. Pardalos},
title = {Information security decisions for two firms in a market with different
types of customers},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1263--1285},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00446-6},
doi = {10.1007/S10878-019-00446-6},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/QianPLZP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiriS19a,
author = {Davood Shiri and
F. Sibel Salman},
title = {On the randomized online strategies for the k-Canadian traveler problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {254--267},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00378-1},
doi = {10.1007/S10878-019-00378-1},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShiriS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SongH19,
author = {Chen Song and
Rong{-}Xia Hao},
title = {Antimagic orientations for the complete k-ary trees},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1077--1085},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00437-7},
doi = {10.1007/S10878-019-00437-7},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SongH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/StefanelloABR19,
author = {Fernando Stefanello and
Vaneet Aggarwal and
Luciana S. Buriol and
Mauricio G. C. Resende},
title = {Hybrid algorithms for placement of virtual machines across geo-separated
data centers},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {748--793},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00411-3},
doi = {10.1007/S10878-019-00411-3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/StefanelloABR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Szeszler19,
author = {D{\'{a}}vid Szeszl{\'{e}}r},
title = {Hitting a path: a generalization of weighted connectivity via game
theory},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {72--85},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0366-7},
doi = {10.1007/S10878-018-0366-7},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Szeszler19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Takazawa19,
author = {Kenjiro Takazawa},
title = {Generalizations of weighted matroid congestion games: pure Nash equilibrium,
sensitivity analysis, and discrete convex function},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1043--1065},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00435-9},
doi = {10.1007/S10878-019-00435-9},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Takazawa19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TianZSMC19,
author = {Wenwen Tian and
Fei Zhao and
Zheng Sun and
Xuesong Mei and
Guangde Chen},
title = {Orderings of a class of trees with respect to the Merrifield-Simmons
index and the Hosoya index},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1286--1295},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00447-5},
doi = {10.1007/S10878-019-00447-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TianZSMC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangKSL19,
author = {Qiannan Wang and
Liying Kang and
Erfang Shan and
Zuosong Liang},
title = {The {\(\alpha\)}-spectral radius of uniform hypergraphs concerning
degrees and domination number},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1128--1142},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00440-y},
doi = {10.1007/S10878-019-00440-Y},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangKSL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangPL19,
author = {Huijuan Wang and
Panos M. Pardalos and
Bin Liu},
title = {Optimal channel assignment with list-edge coloring},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {197--207},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-00376-9},
doi = {10.1007/S10878-018-00376-9},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangPL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangTZDD19,
author = {Kai Yang and
Cong Tian and
Nan Zhang and
Zhenhua Duan and
Hongwei Du},
title = {A temporal logic programming approach to planning},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {402--420},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00389-y},
doi = {10.1007/S10878-019-00389-Y},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YangTZDD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YiZFWY19,
author = {Dan Yi and
Junlei Zhu and
Lixia Feng and
Jiaxin Wang and
Mengyini Yang},
title = {Optimal r-dynamic coloring of sparse graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {545--555},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00387-0},
doi = {10.1007/S10878-019-00387-0},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YiZFWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zhang19,
author = {Huajun Zhang},
title = {On the maximum size of subfamilies of labeled set with given matching
number},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1296--1304},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00451-9},
doi = {10.1007/S10878-019-00451-9},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Zhang19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangLLH19,
author = {Shunzhe Zhang and
Huiqing Liu and
Dong Li and
Xiaolan Hu},
title = {Fractional matching preclusion of the restricted HL-graphs},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {1143--1154},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00441-x},
doi = {10.1007/S10878-019-00441-X},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangLLH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangLWWX19,
author = {Jin Zhang and
Min Li and
Yishui Wang and
Chenchen Wu and
Dachuan Xu},
title = {Approximation algorithm for squared metric two-stage stochastic facility
location problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {618--634},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00404-2},
doi = {10.1007/S10878-019-00404-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangLWWX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuLG19,
author = {Jianming Zhu and
Shuyue Liu and
Smita Ghosh},
title = {Model and algorithm of routes planning for emergency relief distribution
in disaster management with disaster information update},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {208--223},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-00377-8},
doi = {10.1007/S10878-018-00377-8},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuLG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuYL19,
author = {Yuqing Zhu and
Ruidong Yan and
Deying Li},
title = {Minimum cost stability in exchange networks},
journal = {J. Comb. Optim.},
volume = {38},
number = {4},
pages = {987--1004},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00431-z},
doi = {10.1007/S10878-019-00431-Z},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhuYL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-05-31 23:15 CEST from data curated 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:
