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/jco29.bht:"
download as .bib file
@article{DBLP:journals/jco/AngelTR15,
author = {Eric Angel and
Kim Thang Nguyen and
Damien Regnault},
title = {Improved local search for universal facility location},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {237--246},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9711-7},
doi = {10.1007/S10878-014-9711-7},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AngelTR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AngelucciBFM15,
author = {Anna Angelucci and
Vittorio Bil{\`{o}} and
Michele Flammini and
Luca Moscardelli},
title = {On the sequential price of anarchy of isolation games},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {165--181},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9694-9},
doi = {10.1007/S10878-013-9694-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AngelucciBFM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AngluinAR15,
author = {Dana Angluin and
James Aspnes and
Lev Reyzin},
title = {Network construction with subgraph connectivity constraints},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {418--432},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9603-2},
doi = {10.1007/S10878-013-9603-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AngluinAR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BaumbachGI15,
author = {Jan Baumbach and
Jiong Guo and
Rashid Ibragimov},
title = {Covering tree with stars},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {141--152},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9692-y},
doi = {10.1007/S10878-013-9692-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BaumbachGI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BellW15,
author = {Paul C. Bell and
Prudence W. H. Wong},
title = {Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {739--749},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9618-8},
doi = {10.1007/S10878-013-9618-8},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BellW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ben-AmeurMN15,
author = {Walid Ben{-}Ameur and
Mohamed{-}Ahmed Mohamed{-}Sidi and
Jos{\'{e}} Neto},
title = {The {\textdollar}{\textdollar}k{\textdollar}{\textdollar} k -separator
problem: polyhedra, complexity and approximation results},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {276--307},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9753-x},
doi = {10.1007/S10878-014-9753-X},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BiloB15,
author = {Davide Bil{\`{o}} and
Vittorio Bil{\`{o}}},
title = {New bounds for the balloon popping problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {182--196},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9696-7},
doi = {10.1007/S10878-013-9696-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiloB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BuLY15,
author = {Yuehua Bu and
Kai Lu and
Sheng Yang},
title = {Two smaller upper bounds of list injective chromatic number},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {373--388},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9599-7},
doi = {10.1007/S10878-013-9599-7},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BuLY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiDB15,
author = {Zhipeng Cai and
Yueming Duan and
Anu G. Bourgeois},
title = {Delay efficient opportunistic routing in asynchronous multi-channel
cognitive radio networks},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {815--835},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9623-y},
doi = {10.1007/S10878-013-9623-Y},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiDB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenFW15,
author = {Zhi{-}Zhong Chen and
Ying Fan and
Lusheng Wang},
title = {Faster exact computation of rSPR distance},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {605--635},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9695-8},
doi = {10.1007/S10878-013-9695-8},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenFW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Damaschke15,
author = {Peter Damaschke},
title = {Parameterizations of hitting set of bundles and inverse scope},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {847--858},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9629-5},
doi = {10.1007/S10878-013-9629-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Damaschke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DereniowskiDTY15,
author = {Dariusz Dereniowski and
Danny Dyer and
Ryan M. Tifenbach and
Boting Yang},
title = {Zero-visibility cops and robber and the pathwidth of a graph},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {541--564},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9712-6},
doi = {10.1007/S10878-014-9712-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DereniowskiDTY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FengWLC15,
author = {Qilong Feng and
Jianxin Wang and
Shaohua Li and
Jianer Chen},
title = {Randomized parameterized algorithms for P\({}_{\mbox{2}}\)-Packing
and Co-Path Packing problems},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {125--140},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9691-z},
doi = {10.1007/S10878-013-9691-Z},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FengWLC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FujiwaraK15,
author = {Hiroshi Fujiwara and
Koji M. Kobayashi},
title = {Improved lower bounds for the online bin packing problem with cardinality
constraints},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {67--87},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9679-8},
doi = {10.1007/S10878-013-9679-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FujiwaraK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GevezesP15,
author = {Theodoros P. Gevezes and
Leonidas S. Pitsoulis},
title = {A greedy randomized adaptive search procedure with path relinking
for the shortest superstring problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {859--883},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9622-z},
doi = {10.1007/S10878-013-9622-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GevezesP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GoldengorinMPZ15,
author = {Boris I. Goldengorin and
Dmitriy S. Malyshev and
Panos M. Pardalos and
Victor Zamaraev},
title = {A tolerance-based heuristic approach for the weighted independent
set problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {433--450},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9606-z},
doi = {10.1007/S10878-013-9606-Z},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GoldengorinMPZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuoSL15,
author = {Longkun Guo and
Hong Shen and
Kewen Liao},
title = {Improved approximation algorithms for computing k disjoint paths subject
to two constraints},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {153--164},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9693-x},
doi = {10.1007/S10878-013-9693-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuoSL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuQ15,
author = {Sheng{-}Long Hu and
Liqun Qi},
title = {The Laplacian of a uniform hypergraph},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {331--366},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9596-x},
doi = {10.1007/S10878-013-9596-X},
timestamp = {Thu, 20 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuQ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KisielewiczKS15,
author = {Andrzej Kisielewicz and
Jakub Kowalski and
Marek Szykula},
title = {Computing the shortest reset words of synchronizing automata},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {88--124},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9682-0},
doi = {10.1007/S10878-013-9682-0},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KisielewiczKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiFLZZ15,
author = {Chao Li and
Chenglin Fan and
Jun Luo and
Farong Zhong and
Binhai Zhu},
title = {Expected computations on color spanning sets},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {589--604},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9764-7},
doi = {10.1007/S10878-014-9764-7},
timestamp = {Fri, 03 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiFLZZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangLTWY15,
author = {Hongyu Liang and
Tiancheng Lou and
Haisheng Tan and
Yuexuan Wang and
Dongxiao Yu},
title = {On the complexity of connectivity in cognitive radio networks through
spectrum assignment},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {472--487},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9605-0},
doi = {10.1007/S10878-013-9605-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangLTWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiaoH15,
author = {Chung{-}Shou Liao and
Yamming Huang},
title = {Generalized Canadian traveller problems},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {701--712},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9614-z},
doi = {10.1007/S10878-013-9614-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiaoH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinD15,
author = {Wensong Lin and
Benqiu Dai},
title = {On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {655--669},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9615-y},
doi = {10.1007/S10878-013-9615-Y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL15,
author = {Peihai Liu and
Xiwen Lu},
title = {Online unbounded batch scheduling on parallel machines with delivery
times},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {228--236},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9706-4},
doi = {10.1007/S10878-014-9706-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL15a,
author = {Xianmin Liu and
Jianzhong Li},
title = {Algorithms and complexity results for labeled correlation clustering
problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {488--501},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9607-y},
doi = {10.1007/S10878-013-9607-Y},
timestamp = {Sat, 29 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuL15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL15b,
author = {Xianmin Liu and
Jianzhong Li},
title = {On the hardness of learning queries from tree structured data},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {670--684},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9609-9},
doi = {10.1007/S10878-013-9609-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuL15b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuLX15,
author = {Tian Liu and
Zhao Lu and
Ke Xu},
title = {Tractable connected domination for restricted bipartite graphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {247--256},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9729-x},
doi = {10.1007/S10878-014-9729-X},
timestamp = {Wed, 29 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuLX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuWX15,
author = {Tian Liu and
Chaoyi Wang and
Ke Xu},
title = {Large hypertree width for sparse random hypergraphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {531--540},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9704-y},
doi = {10.1007/S10878-013-9704-Y},
timestamp = {Wed, 29 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuWX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuWXGC15,
author = {Yunlong Liu and
Jianxin Wang and
Chao Xu and
Jiong Guo and
Jianer Chen},
title = {An effective branching strategy based on structural relationship among
multiple forbidden induced subgraphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {257--275},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9733-1},
doi = {10.1007/S10878-014-9733-1},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuWXGC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuCC15,
author = {Yiping Lu and
Danny Z. Chen and
Jianzhong Cha},
title = {Packing cubes into a cube is NP-complete in the strong sense},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {197--215},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9701-1},
doi = {10.1007/S10878-013-9701-1},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuCC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuDLZY15,
author = {Damei L{\"{u}} and
Juan Du and
Nianfeng Lin and
Ke Zhang and
Dan Yi},
title = {Nordhaus-Gaddum-type results for path covering and L(2, 1)-labeling
numbers},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {502--510},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9610-3},
doi = {10.1007/S10878-013-9610-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuDLZY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuHX15,
author = {You Lu and
Fu{-}Tao Hu and
Jun{-}Ming Xu},
title = {On the p-reinforcement and the complexity},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {389--405},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9597-9},
doi = {10.1007/S10878-013-9597-9},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuHX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuoDTW15,
author = {Ling Luo and
Zhenhua Duan and
Cong Tian and
Xiaobing Wang},
title = {A structural transformation from p-{\(\pi\)} to {MSVL}},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {308--329},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9779-0},
doi = {10.1007/S10878-014-9779-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuoDTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaZLLW15,
author = {Huan Ma and
Yuqing Zhu and
Deying Li and
Songsong Li and
Weili Wu},
title = {Loyalty improvement beyond the seeds in social networks},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {685--700},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9616-x},
doi = {10.1007/S10878-013-9616-X},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MaZLLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MorishitaN15,
author = {Shiho Morishita and
Takao Nishizeki},
title = {Parametric power supply networks},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {1--15},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9661-5},
doi = {10.1007/S10878-013-9661-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MorishitaN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MuL15,
author = {Zongxu Mu and
Minming Li},
title = {{DVS} scheduling in a line or a star network of processors},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {16--35},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9668-y},
doi = {10.1007/S10878-013-9668-Y},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MuL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NipWNL15,
author = {Kameng Nip and
Zhenbo Wang and
Fabrice Talla Nobibon and
Roel Leus},
title = {A combination of flow shop scheduling and the shortest path problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {36--52},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9670-4},
doi = {10.1007/S10878-013-9670-4},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NipWNL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PardoST15,
author = {Eduardo G. Pardo and
Mauricio Soto and
Christopher Thraves},
title = {Embedding signed graphs in the line - Heuristics to solve MinSA problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {451--471},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9604-1},
doi = {10.1007/S10878-013-9604-1},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PardoST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PengZZZ15,
author = {Chao Peng and
Jie Zhou and
Binhai Zhu and
Hong Zhu},
title = {Complexity analysis and algorithms for the Program Download Problem},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {216--227},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9702-0},
doi = {10.1007/S10878-013-9702-0},
timestamp = {Wed, 12 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PengZZZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RaayatpanahFBP15,
author = {Mohammad A. Raayatpanah and
H. Salehi Fathabadi and
H. Bahramgiri and
Panos M. Pardalos},
title = {Optimal-constrained multicast sub-graph over coded packet networks},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {723--738},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9617-9},
doi = {10.1007/S10878-013-9617-9},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RaayatpanahFBP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RuokokoskiEP15,
author = {Mirko Ruokokoski and
Harri Ehtamo and
Panos M. Pardalos},
title = {Elevator dispatching problem: a mixed integer linear programming formulation
and polyhedral results},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {750--780},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9620-1},
doi = {10.1007/S10878-013-9620-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RuokokoskiEP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunMT15,
author = {Jinghao Sun and
Yakun Meng and
Guozhen Tan},
title = {An integer programming approach for the Chinese postman problem with
time-dependent travel time},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {565--588},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9755-8},
doi = {10.1007/S10878-014-9755-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SunMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TianDY15,
author = {Cong Tian and
Zhenhua Duan and
Mengfei Yang},
title = {Transformation from {PLTL} to automata via NFGs},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {406--417},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9601-4},
doi = {10.1007/S10878-013-9601-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TianDY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangYYZ15,
author = {Guanghui Wang and
Guiying Yan and
Jiguo Yu and
Xin Zhang},
title = {The r-acyclic chromatic number of planar graphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {713--722},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9619-7},
doi = {10.1007/S10878-013-9619-7},
timestamp = {Mon, 14 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangYYZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuDX15,
author = {Chenchen Wu and
Donglei Du and
Dachuan Xu},
title = {An improved semidefinite programming hierarchies rounding approximation
algorithm for maximum graph bisection problems},
journal = {J. Comb. Optim.},
volume = {29},
number = {1},
pages = {53--66},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9673-1},
doi = {10.1007/S10878-013-9673-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuDX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuLHL15,
author = {Yinfeng Xu and
Hongmei Li and
Changzheng He and
Li Luo},
title = {The online k-server problem with max-distance objective},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {836--846},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9621-0},
doi = {10.1007/S10878-013-9621-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuLHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuZC15,
author = {Shou{-}Jun Xu and
Heping Zhang and
Jinzhuan Cai},
title = {Complete forcing numbers of catacondensed hexagonal systems},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {803--814},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9624-x},
doi = {10.1007/S10878-013-9624-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuZC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YaghiniKR15,
author = {Masoud Yaghini and
Mohammad Karimi and
Mohadeseh Rahbar},
title = {A set covering approach for multi-depot train driver scheduling},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {636--654},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9612-1},
doi = {10.1007/S10878-013-9612-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YaghiniKR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zak15,
author = {Andrzej Zak},
title = {General lower bound on the size of (H;k)-stable graphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {2},
pages = {367--372},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9595-y},
doi = {10.1007/S10878-013-9595-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Zak15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangJFH15,
author = {An Zhang and
Yiwei Jiang and
Lidan Fan and
Jueliang Hu},
title = {Optimal online algorithms on two hierarchical machines with tightly-grouped
processing times},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {781--795},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9627-7},
doi = {10.1007/S10878-013-9627-7},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangJFH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangXW15,
author = {Huili Zhang and
Yin{-}Feng Xu and
Xingang Wen},
title = {Optimal shortest path set problem in undirected graphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {3},
pages = {511--530},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9766-5},
doi = {10.1007/S10878-014-9766-5},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangXW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangZDL15,
author = {Ruixue Zhang and
Ping Zhao and
Kefeng Diao and
Fuliang Lu},
title = {The minimum chromatic spectrum of 3-uniform C-hypergraphs},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {796--802},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9625-9},
doi = {10.1007/S10878-013-9625-9},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangZDL15.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-07-22 14:22 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:
