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/jco35.bht:"
download as .bib file
@article{DBLP:journals/jco/AmjadiSS18,
author = {Jafar Amjadi and
Seyed Mahmoud Sheikholeslami and
Marzieh Soroudi},
title = {Nordhaus-Gaddum bounds for total Roman domination},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {126--133},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0158-5},
doi = {10.1007/S10878-017-0158-5},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AmjadiSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ArtachoCKT18,
author = {Francisco J. Arag{\'{o}}n Artacho and
Rub{\'{e}}n Campoy and
Ilias S. Kotsireas and
Matthew K. Tam},
title = {A feasibility approach for constructing combinatorial designs of circulant
type},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1061--1085},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0250-5},
doi = {10.1007/S10878-018-0250-5},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ArtachoCKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BayonAGOR18,
author = {L. Bay{\'{o}}n and
Pedro Fortuny Ayuso and
J. M. Grau and
Antonio M. Oller{-}Marc{\'{e}}n and
M. M. Ruiz},
title = {The Best-or-Worst and the Postdoc problems},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {703--723},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0203-4},
doi = {10.1007/S10878-017-0203-4},
timestamp = {Tue, 13 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BayonAGOR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BealKS18,
author = {Sylvain B{\'{e}}al and
Anna B. Khmelnitskaya and
Philippe Solal},
title = {Two-step values for games with two-level communication structure},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {563--587},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0194-1},
doi = {10.1007/S10878-017-0194-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BealKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BekesiG18,
author = {J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos},
title = {Tight bounds for NF-based bounded-space online bin packing algorithms},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {350--364},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0175-4},
doi = {10.1007/S10878-017-0175-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BekesiG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BelikJ18,
author = {Ivan Belik and
Kurt J{\"{o}}rnsten},
title = {Critical objective function values in linear sum assignment problems},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {842--852},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0240-z},
doi = {10.1007/S10878-017-0240-Z},
timestamp = {Thu, 22 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BelikJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Borowiecki18,
author = {Piotr Borowiecki},
title = {Computational aspects of greedy partitioning of graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {641--665},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0185-2},
doi = {10.1007/S10878-017-0185-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Borowiecki18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BoyaciES18,
author = {Arman Boyaci and
T{\'{\i}}naz Ekim and
Mordechai Shalom},
title = {The maximum cardinality cut problem in co-bipartite chain graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {250--265},
year = {2018},
url = {https://doi.org/10.1007/s10878-015-9963-x},
doi = {10.1007/S10878-015-9963-X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BoyaciES18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiLW18,
author = {Qingqiong Cai and
Xueliang Li and
Di Wu},
title = {Some extremal results on the colorful monochromatic vertex-connectivity
of a graph},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1300--1311},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0258-x},
doi = {10.1007/S10878-018-0258-X},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiWS18,
author = {Hua Cai and
Jianliang Wu and
Lin Sun},
title = {Vertex arboricity of planar graphs without intersecting 5-cycles},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {365--372},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0168-3},
doi = {10.1007/S10878-017-0168-3},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CaiWS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenF18,
author = {Jing Chen and
Genghua Fan},
title = {Large even factors of graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {162--169},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0161-x},
doi = {10.1007/S10878-017-0161-X},
timestamp = {Fri, 12 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenHGW18,
author = {Zhi{-}Zhong Chen and
Youta Harada and
Fei Guo and
Lusheng Wang},
title = {An approximation algorithm for maximum internal spanning tree},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {955--979},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0245-7},
doi = {10.1007/S10878-017-0245-7},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenHGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenZ18,
author = {Ming{-}Zhu Chen and
Xiao{-}Dong Zhang},
title = {The number of edges, spectral radius and Hamilton-connectedness of
graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1104--1127},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0260-3},
doi = {10.1007/S10878-018-0260-3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengW18,
author = {Xiaohan Cheng and
Jianliang Wu},
title = {The adjacent vertex distinguishing total choosability of planar graphs
with maximum degree at least eleven},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {1--13},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0149-6},
doi = {10.1007/S10878-017-0149-6},
timestamp = {Thu, 11 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChengW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChristmanFP18,
author = {Ananya Christman and
William Forcier and
Aayam Poudel},
title = {From theory to practice: maximizing revenues for on-line dial-a-ride},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {512--529},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0188-z},
doi = {10.1007/S10878-017-0188-Z},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChristmanFP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ConstantinouE18,
author = {Costas K. Constantinou and
Georgios Ellinas},
title = {Minimal path decomposition of complete bipartite graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {684--702},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0200-7},
doi = {10.1007/S10878-017-0200-7},
timestamp = {Thu, 22 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ConstantinouE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CusticP18,
author = {Ante Custic and
Abraham P. Punnen},
title = {A characterization of linearizable instances of the quadratic minimum
spanning tree problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {436--453},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0184-3},
doi = {10.1007/S10878-017-0184-3},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CusticP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DagaevS18,
author = {Dmitry Dagaev and
Alex Suzdaltsev},
title = {Competitive intensity and quality maximizing seedings in knock-out
tournaments},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {170--188},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0164-7},
doi = {10.1007/S10878-017-0164-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DagaevS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DingWW18,
author = {Laihao Ding and
Guanghui Wang and
Jianliang Wu},
title = {Generalized acyclic edge colorings via entropy compression},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {906--920},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0244-8},
doi = {10.1007/S10878-017-0244-8},
timestamp = {Mon, 14 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DingWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DossK18,
author = {Srinath Doss and
Roselyn Kaondera{-}Shava},
title = {An optimal Tate pairing computation using Jacobi quartic elliptic
curves},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1086--1103},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0257-y},
doi = {10.1007/S10878-018-0257-Y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DossK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FengZZ18,
author = {Xing Feng and
Lianzhu Zhang and
Mingzu Zhang},
title = {An O({\(\vert\)}E(G){\(\vert\)}\({}^{\mbox{2}}\)) algorithm for recognizing
Pfaffian graphs of a type of bipartite graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {740--753},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0207-0},
doi = {10.1007/S10878-017-0207-0},
timestamp = {Thu, 22 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FengZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FuCLX18,
author = {Chenchen Fu and
Vincent Chau and
Minming Li and
Chun Jason Xue},
title = {Race to idle or not: balancing the memory sleep time with {DVS} for
energy minimization},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {860--894},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0229-7},
doi = {10.1007/S10878-017-0229-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FuCLX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaiZ18,
author = {Ling Gai and
Guochuan Zhang},
title = {Online lazy bureaucrat scheduling with a machine deadline},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {530--537},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0180-7},
doi = {10.1007/S10878-017-0180-7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GaiZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GerbnerV18,
author = {D{\'{a}}niel Gerbner and
M{\'{a}}t{\'{e}} Vizer},
title = {Smart elements in combinatorial group testing problems},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1042--1060},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0248-z},
doi = {10.1007/S10878-018-0248-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GerbnerV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GoddardH18,
author = {Wayne Goddard and
Michael A. Henning},
title = {A note on domination and total domination in prisms},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {14--20},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0150-0},
doi = {10.1007/S10878-017-0150-0},
timestamp = {Thu, 11 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GoddardH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GoddardM18,
author = {Wayne Goddard and
Robert Melville},
title = {Properly colored trails, paths, and bridges},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {463--472},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0191-4},
doi = {10.1007/S10878-017-0191-4},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GoddardM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GribanovMPV18,
author = {Dmitry V. Gribanov and
Dmitriy S. Malyshev and
Panos M. Pardalos and
Sergey I. Veselov},
title = {FPT-algorithms for some problems related to integer programming},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1128--1146},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0264-z},
doi = {10.1007/S10878-018-0264-Z},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GribanovMPV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuoL18,
author = {Jun Guo and
Jun Liu},
title = {Deterministic construction of compressed sensing matrices based on
semilattices},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {148--161},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0162-9},
doi = {10.1007/S10878-017-0162-9},
timestamp = {Thu, 11 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuoL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HackfeldK18,
author = {Jan Hackfeld and
Arie M. C. A. Koster},
title = {The matching extension problem in general graphs is co-NP-complete},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {853--859},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0226-x},
doi = {10.1007/S10878-017-0226-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HackfeldK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanS18,
author = {Yijie Han and
Sanjeev Saxena},
title = {Algorithms for testing occurrences of length 4 patterns in permutations},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {189--208},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0163-8},
doi = {10.1007/S10878-017-0163-8},
timestamp = {Thu, 11 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HanS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanXDZ18,
author = {Lu Han and
Dachuan Xu and
Donglei Du and
Dongmei Zhang},
title = {A local search approximation algorithm for the uniform capacitated
k-facility location problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {409--423},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0179-0},
doi = {10.1007/S10878-017-0179-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanXDZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HaoQ18,
author = {Guoliang Hao and
Jianguo Qian},
title = {Bounds on the domination number of a digraph},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {64--74},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0154-9},
doi = {10.1007/S10878-017-0154-9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HaoQ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeX18,
author = {Xiaozhou He and
Yinfeng Xu},
title = {The longest commonly positioned increasing subsequences problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {331--340},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0170-9},
doi = {10.1007/S10878-017-0170-9},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HeX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuS18,
author = {Hao Hu and
Renata Sotirov},
title = {Special cases of the quadratic shortest path problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {754--777},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0219-9},
doi = {10.1007/S10878-017-0219-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangZXL18,
author = {Jidan Huang and
Feifeng Zheng and
Yinfeng Xu and
Ming Liu},
title = {Online MapReduce processing on two identical parallel machines},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {216--223},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0167-4},
doi = {10.1007/S10878-017-0167-4},
timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuangZXL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangXDWZ18,
author = {Yanjun Jiang and
Dachuan Xu and
Donglei Du and
Chenchen Wu and
Dongmei Zhang},
title = {An approximation algorithm for soft capacitated k-facility location
problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {493--511},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0192-3},
doi = {10.1007/S10878-017-0192-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiangXDWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JohnS18,
author = {J. John and
K. Uma Samundesvari},
title = {Total and forcing total edge-to-vertex monophonic number of a graph},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {134--147},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0160-y},
doi = {10.1007/S10878-017-0160-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JohnS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JovanovicBV18,
author = {Raka Jovanovic and
Abdelkader Bousselham and
Stefan Vo{\ss}},
title = {Partitioning of supply/demand graphs with capacity limitations: an
ant colony approach},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {224--249},
year = {2018},
url = {https://doi.org/10.1007/s10878-015-9945-z},
doi = {10.1007/S10878-015-9945-Z},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JovanovicBV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KukalM18,
author = {Jarom{\'{\i}}r Kukal and
Matej Mojzes},
title = {Quantile and mean value measures of search process complexity},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1261--1285},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0251-4},
doi = {10.1007/S10878-018-0251-4},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KukalM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LeiLLS18,
author = {Hui Lei and
Shasha Li and
Henry Liu and
Yongtang Shi},
title = {Rainbow vertex connection of digraphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {86--107},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0156-7},
doi = {10.1007/S10878-017-0156-7},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LeiLLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LevinV18,
author = {Asaf Levin and
Aleksander Vainer},
title = {Lower bounds on the adaptivity gaps in variants of the stochastic
knapsack problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {794--813},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0234-x},
doi = {10.1007/S10878-017-0234-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LevinV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiSX18,
author = {Zepeng Li and
Zehui Shao and
Jin Xu},
title = {Weak \{2\}-domination number of Cartesian products of cycles},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {75--85},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0157-6},
doi = {10.1007/S10878-017-0157-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiSX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinL18,
author = {Qizhong Lin and
Yusheng Li},
title = {Sparse multipartite graphs as partition universal for graphs with
bounded degree},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {724--739},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0214-1},
doi = {10.1007/S10878-017-0214-1},
timestamp = {Wed, 05 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinS18,
author = {Wensong Lin and
Chenli Shen},
title = {Channel assignment problem and n-fold t-separated L(j\({}_{\mbox{1}}\),
j\({}_{\mbox{2}}\), ... , j\({}_{\mbox{m}}\)) -labeling of graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1147--1167},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0255-0},
doi = {10.1007/S10878-018-0255-0},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuWW18,
author = {Changhong Lu and
Bing Wang and
Kan Wang},
title = {Algorithm complexity of neighborhood total domination and ({\(\rho\)},
{\(\gamma\)}\({}_{\mbox{nt}}\))-graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {424--435},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0181-6},
doi = {10.1007/S10878-017-0181-6},
timestamp = {Wed, 21 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuXM18,
author = {You Lu and
Chuandong Xu and
Zhengke Miao},
title = {Neighbor sum distinguishing list total coloring of subcubic graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {778--793},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0239-5},
doi = {10.1007/S10878-017-0239-5},
timestamp = {Mon, 14 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuXM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuoZZ18,
author = {Chunmei Luo and
Liancui Zuo and
Philip B. Zhang},
title = {The Wiener index of Sierpi{\'{n}}ski-like graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {814--841},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0235-9},
doi = {10.1007/S10878-017-0235-9},
timestamp = {Thu, 22 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuoZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuzarPS18,
author = {Borut Luzar and
Mirko Petrusevski and
Riste Skrekovski},
title = {On vertex-parity edge-colorings},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {373--388},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0178-1},
doi = {10.1007/S10878-017-0178-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuzarPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LvXZ18,
author = {Xinzhong Lv and
Rongxing Xu and
Xuding Zhu},
title = {Greedy Nim\({}_{\mbox{k}}\) Game},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1241--1249},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0265-y},
doi = {10.1007/S10878-018-0265-Y},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LvXZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaSJ18,
author = {Weimin Ma and
Wei Shao and
Xiaodong Ji},
title = {Dynamic work hour optimization for casual workers},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1185--1201},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0263-0},
doi = {10.1007/S10878-018-0263-0},
timestamp = {Fri, 06 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaSJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaWJ18,
author = {Xiaoling Ma and
Baoyindureng Wu and
Xian'an Jin},
title = {Edge-disjoint spanning trees and the number of maximum state circles
of a graph},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {997--1008},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0249-y},
doi = {10.1007/S10878-018-0249-Y},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaWJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MkrtchyanS18,
author = {Vahan Mkrtchyan and
Hovhannes Sargsyan},
title = {A tight lower bound for the hardness of clutters},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {21--25},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0151-z},
doi = {10.1007/S10878-017-0151-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MkrtchyanS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MoazzezS18,
author = {Babak Moazzez and
Hossein Soltani},
title = {Integer programming approach to static monopolies in graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1009--1041},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0256-z},
doi = {10.1007/S10878-018-0256-Z},
timestamp = {Fri, 06 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MoazzezS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NayakB18,
author = {Rupaj Kumar Nayak and
Mahendra Prasad Biswal},
title = {A low complexity semidefinite relaxation for large-scale {MIMO} detection},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {473--492},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0186-1},
doi = {10.1007/S10878-017-0186-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NayakB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NongSCF18,
author = {Qingqin Nong and
Tao Sun and
T. C. E. Cheng and
Qizhi Fang},
title = {Bin packing game with a price of anarchy of 3/2},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {632--640},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0201-6},
doi = {10.1007/S10878-017-0201-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NongSCF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PhamTDBH18,
author = {Canh V. Pham and
My T. Thai and
Hieu V. Duong and
Bao Q. Bui and
Huan X. Hoang},
title = {Maximizing misinformation restriction within time and budget constraints},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1202--1240},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0252-3},
doi = {10.1007/S10878-018-0252-3},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PhamTDBH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PradhanJ18,
author = {Dinabandhu Pradhan and
Anupriya Jha},
title = {On computing a minimum secure dominating set in block graphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {613--631},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0197-y},
doi = {10.1007/S10878-017-0197-Y},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PradhanJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RaayatpanahP18,
author = {Mohammad A. Raayatpanah and
Panos M. Pardalos},
title = {Reliability evaluation of a multicast over coded packet networks},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {921--940},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0242-x},
doi = {10.1007/S10878-017-0242-X},
timestamp = {Fri, 06 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RaayatpanahP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShaluVYS18,
author = {M. A. Shalu and
S. Vijayakumar and
S. Devi Yamini and
T. P. Sandhya},
title = {On the algorithmic aspects of strong subcoloring},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1312--1329},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0272-z},
doi = {10.1007/S10878-018-0272-Z},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShaluVYS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/StepienS18,
author = {Zofia Stepien and
Lucjan Szymaszkiewicz},
title = {Arcs in {\(\mathbb{Z}\)}\({}_{\mbox{2p}}\)\({}^{\mbox{2}}\)},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {341--349},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0171-8},
doi = {10.1007/S10878-017-0171-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/StepienS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SubramaniW18,
author = {K. Subramani and
Piotr Wojciechowski},
title = {A certifying algorithm for lattice point feasibility in a system of
{UTVPI} constraints},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {389--408},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0176-3},
doi = {10.1007/S10878-017-0176-3},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SubramaniW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TangZWZ18,
author = {Qingsong Tang and
Xiangde Zhang and
Guoren Wang and
Cheng Zhao},
title = {A continuous characterization of the maximum vertex-weighted clique
in hypergraphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1250--1260},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0259-9},
doi = {10.1007/S10878-018-0259-9},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TangZWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ToubalineDLPSS18,
author = {Sonia Toubaline and
Claudia D'Ambrosio and
Leo Liberti and
Pierre{-}Louis Poirion and
Baruch Schieber and
Hadas Shachnai},
title = {Complexity and inapproximability results for the Power Edge Set problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {895--905},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0241-y},
doi = {10.1007/S10878-017-0241-Y},
timestamp = {Thu, 22 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ToubalineDLPSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangW18,
author = {Haiying Wang and
Jianliang Wu},
title = {List-edge-coloring of planar graphs without 6-cycles with three chords},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {555--562},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0193-2},
doi = {10.1007/S10878-017-0193-2},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWHW18,
author = {Weifan Wang and
Tingting Wu and
Xiaoxue Hu and
Yiqiao Wang},
title = {Planar graphs without chordal 5-cycles are 2-good},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {980--996},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0243-9},
doi = {10.1007/S10878-017-0243-9},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangWHW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuDWWDT18,
author = {Weili Wu and
Hongwei Du and
Huijuan Wang and
Lidong Wu and
Zhenhua Duan and
Cong Tian},
title = {On general threshold and general cascade models of social influence},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {209--215},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0165-6},
doi = {10.1007/S10878-017-0165-6},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuDWWDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuH18,
author = {Shufei Wu and
Jianfeng Hou},
title = {Partitioning dense uniform hypergraphs},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {48--63},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0153-x},
doi = {10.1007/S10878-017-0153-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuP18,
author = {Biao Wu and
Yuejian Peng},
title = {Two extremal problems related to orders},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {588--612},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0196-z},
doi = {10.1007/S10878-017-0196-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuPWZ18,
author = {Yi Xu and
Jigen Peng and
Wencheng Wang and
Binhai Zhu},
title = {The connected disk covering problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {538--554},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0195-0},
doi = {10.1007/S10878-017-0195-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuPWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangFLPLP18,
author = {Tianji Yang and
Chao Fu and
Xinbao Liu and
Jun Pei and
Lin Liu and
Panos M. Pardalos},
title = {Closed-loop supply chain inventory management with recovery information
of reusable containers},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {266--292},
year = {2018},
url = {https://doi.org/10.1007/s10878-015-9987-2},
doi = {10.1007/S10878-015-9987-2},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangFLPLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangCX18,
author = {Guiqing Zhang and
Yongxi Cheng and
Yinfeng Xu},
title = {A randomized competitive group testing procedure},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {667--683},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0190-5},
doi = {10.1007/S10878-017-0190-5},
timestamp = {Fri, 06 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangCX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangX18,
author = {Huili Zhang and
Yinfeng Xu},
title = {Online covering salesman problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {3},
pages = {941--954},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0227-9},
doi = {10.1007/S10878-017-0227-9},
timestamp = {Thu, 22 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangXDW18,
author = {Xianzhao Zhang and
Dachuan Xu and
Donglei Du and
Chenchen Wu},
title = {Approximation algorithms for precedence-constrained identical machine
scheduling with rejection},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {318--330},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0044-6},
doi = {10.1007/S10878-016-0044-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangXDW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangXWZZ18,
author = {Dongmei Zhang and
Dachuan Xu and
Yishui Wang and
Peng Zhang and
Zhenning Zhang},
title = {A local search approximation algorithm for a squared metric k-facility
location problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1168--1184},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0261-2},
doi = {10.1007/S10878-018-0261-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangXWZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoCXZD18,
author = {Yan Zhao and
Liping Chen and
Gang Xie and
Jianjun Zhao and
Jianwan Ding},
title = {{GPU} implementation of a cellular genetic algorithm for scheduling
dependent tasks of physical system simulation programs},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {293--317},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0007-y},
doi = {10.1007/S10878-016-0007-Y},
timestamp = {Thu, 11 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhaoCXZD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhongS18,
author = {Weiya Zhong and
Yun Shi},
title = {Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {108--125},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0155-8},
doi = {10.1007/S10878-017-0155-8},
timestamp = {Fri, 12 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhongS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhouG18,
author = {Guangyan Zhou and
Zongsheng Gao},
title = {On the lower bounds of random Max 3 and 4-SAT},
journal = {J. Comb. Optim.},
volume = {35},
number = {4},
pages = {1286--1299},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0267-9},
doi = {10.1007/S10878-018-0267-9},
timestamp = {Tue, 03 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhouG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuBD18,
author = {Junlei Zhu and
Yuehua Bu and
Yun Dai},
title = {Upper bounds for adjacent vertex-distinguishing edge coloring},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {454--462},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0187-0},
doi = {10.1007/S10878-017-0187-0},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhuBD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZouZ18,
author = {Zhengxing Zou and
Qiang Zhang},
title = {Harsanyi power solution for games with restricted cooperation},
journal = {J. Comb. Optim.},
volume = {35},
number = {1},
pages = {26--47},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0152-y},
doi = {10.1007/S10878-017-0152-Y},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZouZ18.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-25 00:27 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:
