Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/journals/jco:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@article{DBLP:journals/jco/AdakAB20,
author = {Zeynep Adak and
Mahmure {\"{O}}v{\"{u}}l Arioglu Akan and
Serol Bulkan},
title = {Multiprocessor open shop problem: literature review and future directions},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {547--569},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00591-3},
doi = {10.1007/s10878-020-00591-3},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AdakAB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AmjadiKCS20,
author = {Jafar Amjadi and
R. Khoeilar and
Mustapha Chellali and
Zehui Shao},
title = {On the Roman domination subdivision number of a graph},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {501--511},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00597-x},
doi = {10.1007/s10878-020-00597-x},
timestamp = {Mon, 13 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AmjadiKCS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AndersenR20,
author = {Patrick J. Andersen and
Charl J. Ras},
title = {Degree bounded bottleneck spanning trees in three dimensions},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {457--491},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00490-2},
doi = {10.1007/s10878-019-00490-2},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AndersenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AngelopoulosDJ20,
author = {Spyros Angelopoulos and
Christoph D{\"{u}}rr and
Shendan Jin},
title = {Online maximum matching with recourse},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {974--1007},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00641-w},
doi = {10.1007/s10878-020-00641-w},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AngelopoulosDJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ArmstrongE20,
author = {Addie Armstrong and
Nancy Eaton},
title = {New restrictions on defective coloring with applications to steinberg-type
graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {181--204},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00573-5},
doi = {10.1007/s10878-020-00573-5},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ArmstrongE20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AshokRG20,
author = {Pradeesha Ashok and
Aniket Basu Roy and
Sathish Govindarajan},
title = {Local search strikes again: {PTAS} for variants of geometric covering
and packing},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {618--635},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00432-y},
doi = {10.1007/s10878-019-00432-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AshokRG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AuroraM20,
author = {Pawan Aurora and
Shashank K. Mehta},
title = {A completely positive formulation of the graph isomorphism problem
and its positive semidefinite relaxation},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {590--609},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00598-w},
doi = {10.1007/s10878-020-00598-w},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AuroraM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BaiCL20,
author = {Xuqing Bai and
Hong Chang and
Xueliang Li},
title = {More on limited packings in graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {412--430},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00606-z},
doi = {10.1007/s10878-020-00606-z},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BaiCL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BanerjeeHP20,
author = {S. Banerjee and
Michael A. Henning and
Dinabandhu Pradhan},
title = {Algorithmic results on double Roman domination in graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {90--114},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00457-3},
doi = {10.1007/s10878-019-00457-3},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BanerjeeHP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarthaK20,
author = {Mikl{\'{o}}s Bartha and
Mikl{\'{o}}s Kr{\'{e}}sz},
title = {On the K{\"{o}}nig deficiency of zero-reducible graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {273--292},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00466-2},
doi = {10.1007/s10878-019-00466-2},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarthaK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeregBCDL20,
author = {Sergey Bereg and
Andrew Brunner and
Luis Evaristo Caraballo and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Mario Alberto L{\'{o}}pez},
title = {On the robustness of a synchronized multi-robot system},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {988--1016},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00533-z},
doi = {10.1007/s10878-020-00533-z},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BeregBCDL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BessyDHKS20,
author = {St{\'{e}}phane Bessy and
Fran{\c{c}}ois Dross and
Katar{\'{\i}}na Hrin{\'{a}}kov{\'{a}} and
Martin Knor and
Riste Skrekovski},
title = {The structure of graphs with given number of blocks and the maximum
Wiener index},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {170--184},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00462-6},
doi = {10.1007/s10878-019-00462-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BessyDHKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BiloCMM20,
author = {Vittorio Bil{\`{o}} and
Francesco Cellinese and
Giovanna Melideo and
Gianpiero Monaco},
title = {Selfish colorful bin packing games},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {610--635},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00599-9},
doi = {10.1007/s10878-020-00599-9},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiloCMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BorosCR20,
author = {Endre Boros and
Yves Crama and
Elisabeth Rodr{\'{\i}}guez{-}Heck},
title = {Compact quadratizations for pseudo-Boolean functions},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {687--707},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00511-0},
doi = {10.1007/s10878-019-00511-0},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BorosCR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BoseGPV20,
author = {Prosenjit Bose and
Valentin Gledel and
Claire Pennarun and
Sander Verdonschot},
title = {Power domination on triangular grids with triangular and hexagonal
shape},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {482--500},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00587-z},
doi = {10.1007/s10878-020-00587-z},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BoseGPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BuyantogtokhHD20,
author = {Lkhagva Buyantogtokh and
Batmend Horoldagva and
Kinkar Chandra Das},
title = {On reduced second Zagreb index},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {776--791},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00518-7},
doi = {10.1007/s10878-019-00518-7},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BuyantogtokhHD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CastroGRV20,
author = {Natalia de Castro and
Maria Angeles Garrido and
Rafael Robles and
Mar{\'{\i}}a Trinidad Villar{-}Li{\~{n}}{\'{a}}n},
title = {Contrast in greyscales of graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {874--898},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00528-w},
doi = {10.1007/s10878-020-00528-w},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CastroGRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangJW20,
author = {Yulin Chang and
Fei Jing and
Guanghui Wang},
title = {Local antimagic orientation of graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1129--1152},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00551-x},
doi = {10.1007/s10878-020-00551-x},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangJW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Chaourar20,
author = {Brahim Chaourar},
title = {Connected max cut is polynomial for graphs without the excluded minor
{\textdollar}K{\_}5{\textbackslash}backslash e{\textdollar}},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {869--875},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00637-6},
doi = {10.1007/s10878-020-00637-6},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Chaourar20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChatterjeeDPAS20,
author = {Tanima Chatterjee and
Bhaskar DasGupta and
Laura Palmieri and
Zainab Al{-}Qurashi and
Anastasios Sidiropoulos},
title = {On theoretical and empirical algorithmic analysis of the efficiency
gap measure in partisan gerrymandering},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {512--546},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00589-x},
doi = {10.1007/s10878-020-00589-x},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChatterjeeDPAS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenCZZ20,
author = {Lily Chen and
Shumei Chen and
Ren Zhao and
Xiangqian Zhou},
title = {The strong chromatic index of graphs with edge weight eight},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {227--233},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00582-4},
doi = {10.1007/s10878-020-00582-4},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenCZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenL20,
author = {Ren{-}Xia Chen and
Shi{-}Sheng Li},
title = {Minimizing maximum delivery completion time for order scheduling with
rejection},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1044--1064},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00649-2},
doi = {10.1007/s10878-020-00649-2},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenLLLSXZ20,
author = {Yong Chen and
Guohui Lin and
Tian Liu and
Taibo Luo and
Bing Su and
Yao Xu and
Peng Zhang},
title = {A {(1.4} + {\(\epsilon\)} )-approximation algorithm for the 2-Max-Duo
problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {806--824},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00621-0},
doi = {10.1007/s10878-020-00621-0},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLLLSXZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenX20,
author = {Cong Chen and
Yinfeng Xu},
title = {Coordination mechanisms for scheduling selfish jobs with favorite
machines},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {333--365},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00592-2},
doi = {10.1007/s10878-020-00592-2},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChithraM20,
author = {M. R. Chithra and
Manju K. Menon},
title = {Secure domination of honeycomb networks},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {98--109},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00570-8},
doi = {10.1007/s10878-020-00570-8},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChithraM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChuLCLY20,
author = {Yi Chu and
Boxiao Liu and
Shaowei Cai and
Chuan Luo and
Haihang You},
title = {An efficient local search algorithm for solving maximum edge weight
clique problem in large graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {933--954},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00529-9},
doi = {10.1007/s10878-020-00529-9},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChuLCLY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DankelmannO20,
author = {Peter Dankelmann and
Fadekemi Janet Osaye},
title = {Average eccentricity, minimum degree and maximum degree in graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {697--712},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00616-x},
doi = {10.1007/s10878-020-00616-x},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DankelmannO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DharMPS20,
author = {Amit Kumar Dhar and
Raghunath Reddy Madireddy and
Supantha Pandit and
Jagpreet Singh},
title = {Maximum independent and disjoint coverage},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1017--1037},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00536-w},
doi = {10.1007/s10878-020-00536-w},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DharMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DingQ20,
author = {Wei Ding and
Ke Qiu},
title = {Approximating the asymmetric p-center problem in parameterized complete
digraphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {21--35},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00559-3},
doi = {10.1007/s10878-020-00559-3},
timestamp = {Tue, 04 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DingQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DongSL20,
author = {Yanxia Dong and
Moo Young Sohn and
Zuosong Liang},
title = {Domination and matching in power and generalized power hypergraphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {425--436},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00481-3},
doi = {10.1007/s10878-019-00481-3},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DongSL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DuGHL20,
author = {Shaojing Du and
Suogang Gao and
Bo Hou and
Wen Liu},
title = {An approximation algorithm for submodular hitting set problem with
linear penalties},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1065--1074},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00653-6},
doi = {10.1007/s10878-020-00653-6},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DuGHL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Duginov20,
author = {Oleg Duginov},
title = {Bottleneck subset-type restricted matching problems},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {796--805},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00627-8},
doi = {10.1007/s10878-020-00627-8},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Duginov20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FanWLT20,
author = {Wenjuan Fan and
Yi Wang and
Tongzhu Liu and
Guixian Tong},
title = {A patient flow scheduling problem in ophthalmology clinic solved by
the hybrid {EDA-VNS} algorithm},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {547--580},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00497-9},
doi = {10.1007/s10878-019-00497-9},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FanWLT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Florek20,
author = {Jan Florek},
title = {Remarks on Barnette's conjecture},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {149--155},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00460-8},
doi = {10.1007/s10878-019-00460-8},
timestamp = {Fri, 31 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Florek20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FulekT20,
author = {Radoslav Fulek and
Csaba D. T{\'{o}}th},
title = {Crossing minimization in perturbed drawings},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {279--302},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00586-0},
doi = {10.1007/s10878-020-00586-0},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FulekT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GengL20,
author = {Zhichao Geng and
Jiayu Liu},
title = {Single machine batch scheduling with two non-disjoint agents and splitable
jobs},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {774--795},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00626-9},
doi = {10.1007/s10878-020-00626-9},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GengL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GhoshGPSZ20,
author = {Debarun Ghosh and
Ervin Gy{\"{o}}ri and
Addisu Paulos and
Nika Salia and
Oscar Zamora},
title = {The maximum Wiener index of maximal planar graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1121--1135},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00655-4},
doi = {10.1007/s10878-020-00655-4},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GhoshGPSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GomezW20,
author = {Renzo G{\'{o}}mez and
Yoshiko Wakabayashi},
title = {Nontrivial path covers of graphs: existence, minimization and maximization},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {437--456},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00488-w},
doi = {10.1007/s10878-019-00488-w},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GomezW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuoBLZ20,
author = {Zhiwei Guo and
Hajo Broersma and
Ruonan Li and
Shenggui Zhang},
title = {Some algorithmic results for finding compatible spanning circuits
in edge-colored graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1008--1019},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00644-7},
doi = {10.1007/s10878-020-00644-7},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuoBLZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanXXZ20,
author = {Lu Han and
Dachuan Xu and
Yicheng Xu and
Dongmei Zhang},
title = {Approximating the {\(\tau\)}-relaxed soft capacitated facility location
problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {848--860},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00631-y},
doi = {10.1007/s10878-020-00631-y},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanXXZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HenningY20,
author = {Michael A. Henning and
Anders Yeo},
title = {Bounds on upper transversals in hypergraphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {77--89},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00456-4},
doi = {10.1007/s10878-019-00456-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HenningY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HocquardP20,
author = {Herv{\'{e}} Hocquard and
Jakub Przybylo},
title = {On the total neighbour sum distinguishing index of graphs with bounded
maximum average degree},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {412--424},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00480-4},
doi = {10.1007/s10878-019-00480-4},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HocquardP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HongWZLCL20,
author = {Yi Hong and
Yongcai Wang and
Yuqing Zhu and
Deying Li and
Zhibo Chen and
Jing Li},
title = {3D camera sensor scheduling algorithms for indoor multi-objective
tracking},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {899--914},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00532-0},
doi = {10.1007/s10878-020-00532-0},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HongWZLCL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuoWWX20,
author = {Jingjing Huo and
Yiqiao Wang and
Weifan Wang and
Wenjing Xia},
title = {Neighbor-distinguishing total coloring of planar graphs with maximum
degree twelve},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {246--272},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00465-3},
doi = {10.1007/s10878-019-00465-3},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuoWWX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KfouryS20,
author = {Assaf J. Kfoury and
Benjamin Sisson},
title = {Efficient reassembling of three-regular planar graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1153--1207},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00555-7},
doi = {10.1007/s10878-020-00555-7},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KfouryS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KhmelnitskayaST20,
author = {Anna B. Khmelnitskaya and
{\"{O}}zer Sel{\c{c}}uk and
Dolf Talman},
title = {The average covering tree value for directed graph games},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {315--333},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00471-5},
doi = {10.1007/s10878-019-00471-5},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KhmelnitskayaST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KongHW20,
author = {Jiangxu Kong and
Xiaoxue Hu and
Yiqiao Wang},
title = {Plane graphs with {\(\Delta\)} =7 are entirely 10-colorable},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {1--20},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00561-9},
doi = {10.1007/s10878-020-00561-9},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KongHW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KutucuGKN20,
author = {Hakan Kutucu and
Arif Gursoy and
Mehmet Kurt and
Urfat G. Nuriyev},
title = {The band collocation problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {454--481},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00576-2},
doi = {10.1007/s10878-020-00576-2},
timestamp = {Mon, 13 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KutucuGKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiD20,
author = {Xiang Li and
Hongbin George Du},
title = {A short proof for stronger version of {DS} decomposition in set function
optimization},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {901--906},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00639-4},
doi = {10.1007/s10878-020-00639-4},
timestamp = {Wed, 06 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiDP20,
author = {Xiang Li and
Hongbin George Du and
Panos M. Pardalos},
title = {A variation of {DS} decomposition in set function optimization},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {36--44},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00560-w},
doi = {10.1007/s10878-020-00560-w},
timestamp = {Wed, 06 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiDP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiHHTZ20,
author = {Pan Li and
Qiang Hua and
Zhijun Hu and
Hing{-}Fung Ting and
Yong Zhang},
title = {Approximation algorithms for the selling with preference},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {366--378},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00602-3},
doi = {10.1007/s10878-020-00602-3},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiHHTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiL20,
author = {Dawei Li and
Xiwen Lu},
title = {Two-machine flow shop scheduling with an operator non-availability
period to minimize makespan},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1060--1078},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00548-6},
doi = {10.1007/s10878-020-00548-6},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLLWZ20,
author = {Jianping Li and
Suding Liu and
Junran Lichen and
Wencheng Wang and
Yujie Zheng},
title = {Approximation algorithms for solving the 1-line Euclidean minimum
Steiner tree problem},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {492--508},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00492-0},
doi = {10.1007/s10878-019-00492-0},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiLLWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiS20,
author = {Shuchao Li and
Wanting Sun},
title = {On the zero forcing number of a graph involving some classical parameters},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {365--384},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00475-1},
doi = {10.1007/s10878-019-00475-1},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiS20a,
author = {Daniel Li Li and
Erfang Shan},
title = {Marginal contributions and derivatives for set functions in cooperative
games},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {849--858},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00526-y},
doi = {10.1007/s10878-020-00526-y},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiS20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiXYZZ20,
author = {Min Li and
Dachuan Xu and
Jun Yue and
Dongmei Zhang and
Peng Zhang},
title = {The seeding algorithm for k-means problem with penalties},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {15--32},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00450-w},
doi = {10.1007/s10878-019-00450-w},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiXYZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZ20,
author = {Bi Li and
Xin Zhang},
title = {Tree-coloring problems of bounded treewidth graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {156--169},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00461-7},
doi = {10.1007/s10878-019-00461-7},
timestamp = {Mon, 07 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiaoWZYP20,
author = {Baoyu Liao and
Xingming Wang and
Xing Zhu and
Shanlin Yang and
Panos M. Pardalos},
title = {Less is more approach for competing groups scheduling with different
learning effects},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {33--54},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00452-8},
doi = {10.1007/s10878-019-00452-8},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiaoWZYP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinZ20,
author = {Ruizhi Lin and
Heping Zhang},
title = {Fractional matching preclusion number of graphs and the perfect matching
polytope},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {915--932},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00530-2},
doi = {10.1007/s10878-020-00530-2},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LingasMTZ20,
author = {Andrzej Lingas and
Mateusz Miotk and
Jerzy Topp and
Pawel Zylinski},
title = {Graphs with equal domination and covering numbers},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {55--71},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00454-6},
doi = {10.1007/s10878-019-00454-6},
timestamp = {Fri, 31 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LingasMTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL20,
author = {Peihai Liu and
Xiwen Lu},
title = {New approximation algorithms for machine scheduling with rejection
on single and parallel machine},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {929--952},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00642-9},
doi = {10.1007/s10878-020-00642-9},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuLS20,
author = {Yan Liu and
Mengxia Lei and
Xueli Su},
title = {Fractional Gallai-Edmonds decomposition and maximal graphs on fractional
matching number},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {59--68},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00566-4},
doi = {10.1007/s10878-020-00566-4},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuWL20,
author = {Xiangxiang Liu and
Ligong Wang and
Xihe Li},
title = {The Wiener index of hypergraphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {351--364},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00473-3},
doi = {10.1007/s10878-019-00473-3},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuWL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuizCDS20,
author = {At{\'{\i}}lio G. Luiz and
C. N. Campos and
Simone Dantas and
Diana Sasaki},
title = {Neighbour-distinguishing labellings of powers of paths and powers
of cycles},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1038--1059},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00540-0},
doi = {10.1007/s10878-020-00540-0},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuizCDS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaH20,
author = {Chunmei Ma and
Dan Huang},
title = {Research on the impact of green innovation alliance mode on decision-making
of two-cycle closed-loop supply chain},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {519--546},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00496-w},
doi = {10.1007/s10878-019-00496-w},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MaH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MalekN20,
author = {Sabrine Malek and
Wady Naanaa},
title = {A new approximate cluster deletion algorithm for diamond-free graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {385--411},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00477-z},
doi = {10.1007/s10878-019-00477-z},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MalekN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MeijerS20,
author = {Frank de Meijer and
Renata Sotirov},
title = {The quadratic cycle cover problem: special cases and efficient bounds},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1096--1128},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00547-7},
doi = {10.1007/s10878-020-00547-7},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MeijerS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MillaniMNS20,
author = {Marcelo Garlet Millani and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Efficient algorithms for measuring the funnel-likeness of DAGs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {216--245},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00464-4},
doi = {10.1007/s10878-019-00464-4},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MillaniMNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MoralesM20,
author = {Fernando A. Morales and
Jairo A. Mart{\'{\i}}nez},
title = {Analysis of Divide-and-Conquer strategies for the 0-1 minimization
knapsack problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {234--278},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00584-2},
doi = {10.1007/s10878-020-00584-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MoralesM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NaifarGL20,
author = {Fraj Naifar and
Mariem Gzara and
Ta{\"{\i}}cir Moalla Loukil},
title = {A new leader guided optimization for the flexible job shop problem},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {602--617},
year = {2020},
url = {https://doi.org/10.1007/s10878-018-00373-y},
doi = {10.1007/s10878-018-00373-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NaifarGL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NayakM20,
author = {Rupaj Kumar Nayak and
Nirmalya Kumar Mohanty},
title = {Solution of boolean quadratic programming problems by two augmented
Lagrangian algorithms based on a continuous relaxation},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {792--825},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00517-8},
doi = {10.1007/s10878-019-00517-8},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NayakM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NguyenD20,
author = {Thi Thanh Sang Nguyen and
Pham Minh Thu Do},
title = {Classification optimization for training a large dataset with Na{\"{\i}}ve
Bayes},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {141--169},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00578-0},
doi = {10.1007/s10878-020-00578-0},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NguyenD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NguyenHN20,
author = {Kien Trung Nguyen and
Nguyen Thanh Hung and
Huong Nguyen{-}Thu},
title = {A linear time algorithm for the p-maxian problem on trees with distance
constraint},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1030--1043},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00650-9},
doi = {10.1007/s10878-020-00650-9},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NguyenHN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NodehASKP20,
author = {Zohreh Hosseini Nodeh and
Ali Babapour Azar and
Rashed Khanjani Shiraz and
Salman Khodayifar and
Panos M. Pardalos},
title = {Joint chance constrained shortest path problem with Copula theory},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {110--140},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00562-8},
doi = {10.1007/s10878-020-00562-8},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NodehASKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NongFGDFQ20,
author = {Qingqin Nong and
Jiazhu Fang and
Suning Gong and
Ding{-}Zhu Du and
Yan Feng and
Xiaoying Qu},
title = {A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular
function on a bounded integer lattice},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1208--1220},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00558-4},
doi = {10.1007/s10878-020-00558-4},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NongFGDFQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PanLX20,
author = {Zhuo Pan and
Xianyue Li and
Shou{-}Jun Xu},
title = {Complexity and characterization aspects of edge-related domination
for graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {757--773},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00622-z},
doi = {10.1007/s10878-020-00622-z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PanLX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PanYLX20,
author = {Zhuo Pan and
Yu Yang and
Xianyue Li and
Shou{-}Jun Xu},
title = {The complexity of total edge domination and some related results on
trees},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {571--589},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00596-y},
doi = {10.1007/s10878-020-00596-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PanYLX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PandaPCDK20,
author = {B. S. Panda and
Arti Pandey and
Juhi Chaudhary and
Piyush Dane and
Manav Kashyap},
title = {Maximum weight induced matching in some subclasses of bipartite graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {713--732},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00611-2},
doi = {10.1007/s10878-020-00611-2},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PandaPCDK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PoureidiR20,
author = {Abolfazl Poureidi and
Nader Jafari Rad},
title = {Algorithmic and complexity aspects of problems related to total Roman
domination for graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {747--763},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00514-x},
doi = {10.1007/s10878-019-00514-x},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PoureidiR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RahmaniO20,
author = {Hazhar Rahmani and
Jason M. O'Kane},
title = {Integer linear programming formulations of the filter partitioning
minimization problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {431--453},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00609-w},
doi = {10.1007/s10878-020-00609-w},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RahmaniO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RanSTZ20,
author = {Yingli Ran and
Yishuo Shi and
Changbing Tang and
Zhao Zhang},
title = {A primal-dual algorithm for the minimum partial set multi-cover problem},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {725--746},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00513-y},
doi = {10.1007/s10878-019-00513-y},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/RanSTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RaniB20,
author = {Sonu Rani and
Sasmita Barik},
title = {On alternating paths and the smallest positive eigenvalue of trees},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {589--601},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00503-0},
doi = {10.1007/s10878-019-00503-0},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/RaniB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RawatS20,
author = {Anuj Rawat and
Mark A. Shayman},
title = {A {\textdollar}{\textbackslash}frac\{5\}\{2\}{\textdollar}-approximation
algorithm for coloring rooted subtrees of a degree 3 tree},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {69--97},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00564-6},
doi = {10.1007/s10878-020-00564-6},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RawatS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RubertASSM20,
author = {Diego P. Rubert and
Eloi Araujo and
Marco Aurelio Stefanes and
Jens Stoye and
F{\'{a}}bio Viduani Martinez},
title = {Searching and inferring colorful topological motifs in vertex-colored
graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {379--411},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00590-4},
doi = {10.1007/s10878-020-00590-4},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RubertASSM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SalehiM20,
author = {Abbas Salehi and
Behrooz Masoumi},
title = {{KATZ} centrality with biogeography-based optimization for influence
maximization problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {205--226},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00580-6},
doi = {10.1007/s10878-020-00580-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SalehiM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SalehiT20,
author = {Sajjad Salehi and
Fattaneh Taghiyareh},
title = {Stabilizing social structure via modifying local patterns},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1079--1095},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00546-8},
doi = {10.1007/s10878-020-00546-8},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SalehiT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SekkalB20,
author = {Norelhouda Sekkal and
Fay{\c{c}}al Belkaid},
title = {A multi-objective simulated annealing to solve an identical parallel
machine scheduling problem with deterioration effect and resources
consumption constraints},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {660--696},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00607-y},
doi = {10.1007/s10878-020-00607-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SekkalB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SongX20,
author = {Chao Song and
Changqing Xu},
title = {Neighbor sum distinguishing total colorings of IC-planar graphs with
maximum degree 13},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {293--303},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00467-1},
doi = {10.1007/s10878-019-00467-1},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SongX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TKindtSC20,
author = {Vincent T'Kindt and
Lei Shang and
Federico Della Croce},
title = {Exponential time algorithms for just-in-time scheduling problems with
common due date and symmetric weights},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {764--775},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00512-z},
doi = {10.1007/s10878-019-00512-z},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/TKindtSC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Tang20,
author = {Shaojie Tang},
title = {Price of dependence: stochastic submodular maximization with dependent
items},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {305--314},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00470-6},
doi = {10.1007/s10878-019-00470-6},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Tang20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TayyebiS20,
author = {Javad Tayyebi and
Ali Reza Sepasian},
title = {Partial inverse min-max spanning tree problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1075--1091},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00656-3},
doi = {10.1007/s10878-020-00656-3},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/TayyebiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TianZF20,
author = {Ji Tian and
Yan Zhou and
Ruyan Fu},
title = {An improved semi-online algorithm for scheduling on a single machine
with unexpected breakdown},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {170--180},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00572-6},
doi = {10.1007/s10878-020-00572-6},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TianZF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TranH20,
author = {Tien Tran and
Dung T. Huynh},
title = {The complexity of symmetric connectivity in directional wireless sensor
networks},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {662--686},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00509-8},
doi = {10.1007/s10878-019-00509-8},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/TranH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/VetrikB20,
author = {Tom{\'{a}}s Vetr{\'{\i}}k and
Selvaraj Balachandran},
title = {General multiplicative Zagreb indices of trees and unicyclic graphs
with given matching number},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {953--973},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00643-8},
doi = {10.1007/s10878-020-00643-8},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/VetrikB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WalterL20,
author = {Rico Walter and
Alexander Lawrinenko},
title = {A characterization of optimal multiprocessor schedules and new dominance
rules},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {876--900},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00634-9},
doi = {10.1007/s10878-020-00634-9},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WalterL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangRMZLG20,
author = {A'na Wang and
Meirui Ren and
Hailong Ma and
Lichen Zhang and
Peng Li and
Longjiang Guo},
title = {Maximizing user type diversity for task assignment in crowdsourcing},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1092--1120},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00645-6},
doi = {10.1007/s10878-020-00645-6},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangRMZLG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangSZZZ20,
author = {Limin Wang and
Yalin Shi and
Zhao Zhang and
Zan{-}Bo Zhang and
Xiaoyan Zhang},
title = {Approximation algorithm for a generalized Roman domination problem
in unit ball graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {138--148},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00459-1},
doi = {10.1007/s10878-019-00459-1},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangSZZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangW20,
author = {Shuo{-}I Wang and
Fu{-}Hsing Wang},
title = {Linear time algorithms for finding independent spanning trees on pyramid
networks},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {826--848},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00521-3},
doi = {10.1007/s10878-020-00521-3},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangZ20,
author = {Jun Wang and
Huajun Zhang},
title = {Intersecting families in {\textdollar}{\textbackslash}left( \{{\textbackslash}begin\{array\}\{c\}\{[m]\}{\textbackslash}{\textbackslash}
{\textbackslash}ell {\textbackslash}end\{array\}\}{\textbackslash}right)
{\textbackslash}cup {\textbackslash}left( \{{\textbackslash}begin\{array\}\{c\}\{[n]\}{\textbackslash}{\textbackslash}
k{\textbackslash}end\{array\}\}{\textbackslash}right) {\textdollar}},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1020--1029},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00648-3},
doi = {10.1007/s10878-020-00648-3},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WoodsP20,
author = {Brad D. Woods and
Abraham P. Punnen},
title = {A class of exponential neighbourhoods for the quadratic travelling
salesman problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {303--332},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00588-y},
doi = {10.1007/s10878-020-00588-y},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WoodsP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuCH20,
author = {Haitao Wu and
Yaojun Chen and
Xiaolan Hu},
title = {Planar graphs without 4- and 6-cycles are {(7} : 2)-colorable},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {45--58},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00571-7},
doi = {10.1007/s10878-020-00571-7},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuCH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuTL20,
author = {Liqiong Xu and
Yingzhi Tian and
Hong{-}Jian Lai},
title = {On the sizes of bi-k-maximal graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {859--873},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00522-2},
doi = {10.1007/s10878-020-00522-2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XuTL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangCGY20,
author = {Wenguo Yang and
Shengminjie Chen and
Suixiang Gao and
Ruidong Yan},
title = {Boosting node activity by recommendations in social networks},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {825--847},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00629-6},
doi = {10.1007/s10878-020-00629-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YangCGY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangZD20,
author = {Wenguo Yang and
Yapu Zhang and
Ding{-}Zhu Du},
title = {Influence maximization problem: properties and algorithms},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {907--928},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00638-5},
doi = {10.1007/s10878-020-00638-5},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YangZD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangC20,
author = {Wenming Zhang and
Yongxi Cheng},
title = {A new upper bound on the work function algorithm for the k-server
problem},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {509--518},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00493-z},
doi = {10.1007/s10878-019-00493-z},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangG20,
author = {Yuezhong Zhang and
Suogang Gao},
title = {On the edge metric dimension of convex polytopes and its related graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {334--350},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00472-4},
doi = {10.1007/s10878-019-00472-4},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangLH20,
author = {Minghui Zhang and
Yan Lan and
Xin Han},
title = {Approximation algorithms for two-stage flexible flow shop scheduling},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {1--14},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00449-3},
doi = {10.1007/s10878-019-00449-3},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangLH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangN20,
author = {Xin Zhang and
Bei Niu},
title = {Equitable partition of graphs into induced linear forests},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {581--588},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00498-8},
doi = {10.1007/s10878-019-00498-8},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoCS20,
author = {Qiulan Zhao and
Zhibin Chen and
Jiajun Sang},
title = {Co-density and fractional edge cover packing},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {955--987},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00535-x},
doi = {10.1007/s10878-020-00535-x},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoCS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoLG20,
author = {Lifang Zhao and
Hongshuai Li and
Yuping Gao},
title = {On the extremal graphs with respect to the total reciprocal edge-eccentricity},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {115--137},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00458-2},
doi = {10.1007/s10878-019-00458-2},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhaoLG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoY20,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {Bicriteria scheduling of equal length jobs on uniform parallel machines},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {637--661},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00507-w},
doi = {10.1007/s10878-019-00507-w},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoZPL20,
author = {Shuangyao Zhao and
Qiang Zhang and
Zhanglin Peng and
Xiaonong Lu},
title = {Personalized manufacturing service composition recommendation: combining
combinatorial optimization and collaborative filtering},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {733--756},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00613-0},
doi = {10.1007/s10878-020-00613-0},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoZPL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhengPLX20,
author = {Feifeng Zheng and
Yaxin Pang and
Ming Liu and
Yinfeng Xu},
title = {Dynamic programming algorithms for the general quay crane double-cycling
problem with internal-reshuffles},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {708--724},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00508-9},
doi = {10.1007/s10878-019-00508-9},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhengPLX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuFLYP20,
author = {Shuwan Zhu and
Wenjuan Fan and
Tongzhu Liu and
Shanlin Yang and
Panos M. Pardalos},
title = {Dynamic three-stage operating room scheduling considering patient
waiting time and surgical overtime costs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {185--215},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00463-5},
doi = {10.1007/s10878-019-00463-5},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhuFLYP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuLY20,
author = {Enqiang Zhu and
Chanjuan Liu and
Jiguo Yu},
title = {Neighbor product distinguishing total colorings of 2-degenerate graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {72--76},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00455-5},
doi = {10.1007/s10878-019-00455-5},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhuLY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZojajiMM20,
author = {Masoumeh Zojaji and
Mohammad Reza Mollakhalili Meybodi and
Kamal Mirzaie},
title = {A rapid learning automata-based approach for generalized minimum spanning
tree problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {636--659},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00605-0},
doi = {10.1007/s10878-020-00605-0},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZojajiMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZouJL20,
author = {Dexin Zou and
Chong Jiang and
Weiwei Liu},
title = {Note on the time complexity of resource constrained scheduling with
general truncated job-dependent learning effect},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {861--868},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00628-7},
doi = {10.1007/s10878-020-00628-7},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZouJL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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/AngelBKL19,
author = {Eric Angel and
Evripidis Bampis and
Fadi Kacem and
Dimitrios Letsios},
title = {Speed scaling on parallel processors with migration},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1266--1282},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0352-0},
doi = {10.1007/s10878-018-0352-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AngelBKL19.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, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ArockiarajAS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ArsenevaP19,
author = {Elena Arseneva and
Evanthia Papadopoulou},
title = {Randomized incremental construction for the Hausdorff Voronoi diagram
revisited and extended},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {579--600},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0347-x},
doi = {10.1007/s10878-018-0347-x},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ArsenevaP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarequetSZ19,
author = {Gill Barequet and
Mira Shalah and
Yufei Zheng},
title = {An improved lower bound on the growth constant of polyiamonds},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {424--438},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0336-0},
doi = {10.1007/s10878-018-0336-0},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarequetSZ19.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
P. 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 = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BayonFGOR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeheshtiAslM19,
author = {N. Beheshti Asl and
S. A. MirHassani},
title = {Accelerating benders decomposition: multiple cuts via multiple solutions},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {806--826},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0320-8},
doi = {10.1007/s10878-018-0320-8},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BeheshtiAslM19.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/BiasiL19,
author = {Marzio De Biasi and
Juho Lauri},
title = {On the complexity of restoring corrupted colorings},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1150--1169},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0342-2},
doi = {10.1007/s10878-018-0342-2},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiasiL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BozemanBEFFH19,
author = {Chassidy Bozeman and
Boris Brimkov and
Craig Erickson and
Daniela Ferrero and
Mary Flagg and
Leslie Hogben},
title = {Restricted power domination and zero forcing problems},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {935--956},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0330-6},
doi = {10.1007/s10878-018-0330-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BozemanBEFFH19.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/CalinescuW19,
author = {Gruia C{\u{a}}linescu and
Xiaolang Wang},
title = {Client assignment problems for latency minimization},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {889--900},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0326-2},
doi = {10.1007/s10878-018-0326-2},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CalinescuW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaoC19,
author = {Yixin Cao and
Jianer Chen},
title = {Preface to the special issue on computing and combinatorics},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {423},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00392-3},
doi = {10.1007/s10878-019-00392-3},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaoC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CarneiroPS19,
author = {Alan Di{\^{e}}go Aur{\'{e}}lio Carneiro and
F{\'{a}}bio Protti and
U{\'{e}}verton S. Souza},
title = {Deadlock resolution in wait-for graphs by vertex/arc deletion},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {546--562},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0279-5},
doi = {10.1007/s10878-018-0279-5},
timestamp = {Tue, 05 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CarneiroPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChakrabortyS19,
author = {Sankardeep Chakraborty and
Srinivasa Rao Satti},
title = {Space-efficient algorithms for maximum cardinality search, its applications,
and variants of {BFS}},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {465--481},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0270-1},
doi = {10.1007/s10878-018-0270-1},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChakrabortyS19.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 = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangOW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangZ19,
author = {Jian Chang and
Lingjuan Zhang},
title = {Case Mix Index weighted multi-objective optimization of inpatient
bed allocation in general hospital},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {1--19},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0204-3},
doi = {10.1007/s10878-017-0204-3},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChangZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Charalampopoulos19,
author = {Panagiotis Charalampopoulos and
Maxime Crochemore and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Solon P. Pissis and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {Efficient enumeration of non-equivalent squares in partial words with
few holes},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {501--522},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0300-z},
doi = {10.1007/s10878-018-0300-z},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Charalampopoulos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenCQY19,
author = {Zhou Chen and
Yukun Cheng and
Qi Qi and
Xiang Yan},
title = {Agent incentives of a proportional sharing mechanism in resource sharing},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {639--667},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0315-5},
doi = {10.1007/s10878-018-0315-5},
timestamp = {Tue, 05 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenCQY19.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 = {Fri, 05 Jul 2019 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/ChenLY19,
author = {Ming Chen and
Yusheng Li and
Yiting Yang},
title = {Independence and matching number of some graphs},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1342--1350},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0356-9},
doi = {10.1007/s10878-018-0356-9},
timestamp = {Tue, 18 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLY19.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/ChenZLL19,
author = {Xi Chen and
Liu Zhao and
Haiming Liang and
Kin Keung Lai},
title = {Matching patients and healthcare service providers: a novel two-stage
method based on knowledge rules and {OWA-NSGA-II} algorithm},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {221--247},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0221-2},
doi = {10.1007/s10878-017-0221-2},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenZLL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengHYZ19,
author = {Yukun Cheng and
Qiaoming Han and
Wei Yu and
Guochuan Zhang},
title = {Strategy-proof mechanisms for obnoxious facility game with bounded
service range},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {737--755},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0344-0},
doi = {10.1007/s10878-018-0344-0},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChengHYZ19.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/ChoiKK19,
author = {Ilkyoo Choi and
Jinha Kim and
Minki Kim},
title = {On operations preserving semi-transitive orientability of graphs},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1351--1366},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0358-7},
doi = {10.1007/s10878-018-0358-7},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChoiKK19.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, 05 Jul 2019 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/CuiTZDD19,
author = {Jin Cui and
Cong Tian and
Nan Zhang and
Zhenhua Duan and
Hongwei Du},
title = {Verifying schedulability of tasks in ROS-based systems},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {901--920},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0328-0},
doi = {10.1007/s10878-018-0328-0},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CuiTZDD19.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 = {Wed, 25 Sep 2019 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/DaiY19,
author = {Wenkai Dai and
Yongjie Yang},
title = {Reoptimization of minimum latency problem revisited: don't panic when
asked to revisit the route after local modifications},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {601--619},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0317-3},
doi = {10.1007/s10878-018-0317-3},
timestamp = {Tue, 24 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DaiY19.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/DongGW19,
author = {Luobing Dong and
Qiumin Guo and
Weili Wu},
title = {Speech corpora subset selection based on time-continuous utterances
features},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1237--1248},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0350-2},
doi = {10.1007/s10878-018-0350-2},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DongGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DongJHL19,
author = {Jianming Dong and
Ruyan Jin and
Jueliang Hu and
Guohui Lin},
title = {A fully polynomial time approximation scheme for scheduling on parallel
identical two-stage openshops},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {668--684},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0314-6},
doi = {10.1007/s10878-018-0314-6},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DongJHL19.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 = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DonovanGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DosaE19,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein},
title = {Pareto optimal equilibria for selfish bin packing with uniform cost
sharing},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {827--847},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0323-5},
doi = {10.1007/s10878-018-0323-5},
timestamp = {Fri, 29 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DosaE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DreesFRS19,
author = {Maximilian Drees and
Matthias Feldotto and
S{\"{o}}ren Riechers and
Alexander Skopalik},
title = {Pure Nash equilibria in restricted budget games},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {620--638},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0269-7},
doi = {10.1007/s10878-018-0269-7},
timestamp = {Tue, 05 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DreesFRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Drugan19,
author = {Madalina M. Drugan},
title = {Estimating the number of basins of attraction of multi-objective combinatorial
problems},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1367--1407},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0357-8},
doi = {10.1007/s10878-018-0357-8},
timestamp = {Fri, 03 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Drugan19.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/DuZO19,
author = {Gang Du and
Luyao Zheng and
Xiaoling Ouyang},
title = {Real-time scheduling optimization considering the unexpected events
in home health care},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {196--220},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0220-3},
doi = {10.1007/s10878-017-0220-3},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DuZO19.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/FengHHW19,
author = {Qilong Feng and
Jiaxin Hu and
Neng Huang and
Jianxin Wang},
title = {Improved {PTAS} for the constrained k-means problem},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1091--1110},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0340-4},
doi = {10.1007/s10878-018-0340-4},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FengHHW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FerreroGKRS19,
author = {Daniela Ferrero and
Cyriac Grigorious and
Thomas Kalinowski and
Joe Ryan and
Sudeep Stephen},
title = {Minimum rank and zero forcing number for butterfly networks},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {970--988},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0335-1},
doi = {10.1007/s10878-018-0335-1},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FerreroGKRS19.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/FujishigeMR19,
author = {Satoru Fujishige and
Ali Ridha Mahjoub and
Franz Rendl},
title = {Preface: The fourth International Symposium on Combinatorial Optimization
{(ISCO)} 2016},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {418--422},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0360-0},
doi = {10.1007/s10878-018-0360-0},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FujishigeMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FujitaJPS19,
author = {Shinya Fujita and
Tommy Jensen and
Boram Park and
Tadashi Sakuma},
title = {On the weighted safe set problem on paths and cycles},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {685--701},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0316-4},
doi = {10.1007/s10878-018-0316-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FujitaJPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Fukunaga19,
author = {Takuro Fukunaga},
title = {LP-based pivoting algorithm for higher-order correlation clustering},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1312--1326},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0354-y},
doi = {10.1007/s10878-018-0354-y},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Fukunaga19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaiJ19,
author = {Ling Gai and
Jiandong Ji},
title = {An integrated method to solve the healthcare facility layout problem
under area constraints},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {95--113},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0212-3},
doi = {10.1007/s10878-017-0212-3},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GaiJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaoBZ19,
author = {Wei Gao and
Wuping Bao and
Xin Zhou},
title = {Analysis of cough detection index based on decision tree and support
vector machine},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {375--384},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0236-8},
doi = {10.1007/s10878-017-0236-8},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GaoBZ19.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/Ghiyasvand19,
author = {Mehdi Ghiyasvand},
title = {An {\textdollar}{\textdollar}O(n(m+n{\textbackslash}log n){\textbackslash}log
n){\textdollar}{\textdollar} {O} {(} n {(} m + n log n {)} log n {)}
time algorithm to solve the minimum cost tension problem},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {957--969},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0331-5},
doi = {10.1007/s10878-018-0331-5},
timestamp = {Fri, 29 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Ghiyasvand19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Gourves19,
author = {Laurent Gourv{\`{e}}s},
title = {Agreeable sets with matroidal constraints},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {866--888},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0327-1},
doi = {10.1007/s10878-018-0327-1},
timestamp = {Fri, 29 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Gourves19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GrzegorekJ19,
author = {Paulina Grzegorek and
Janusz Januszewski},
title = {Drawer algorithms for 1-space bounded multidimensional hyperbox packing},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {1011--1044},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0338-y},
doi = {10.1007/s10878-018-0338-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GrzegorekJ19.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/HeLSXZZ19,
author = {Xiaozhou He and
Zhihui Liu and
Bing Su and
Yinfeng Xu and
Feifeng Zheng and
Binhai Zhu},
title = {Efficient algorithms for computing one or two discrete centers hitting
a set of line segments},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1408--1423},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0359-6},
doi = {10.1007/s10878-018-0359-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeLSXZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeWC19,
author = {Cheng He and
Yang Wu and
Tong Chen},
title = {Prognostics and health management of life-supporting medical instruments},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {183--195},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0218-x},
doi = {10.1007/s10878-017-0218-x},
timestamp = {Thu, 21 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HeWC19.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/HoCY19,
author = {Kuan{-}Yi Ho and
Yi{-}Jun Chang and
Hsu{-}Chun Yen},
title = {Unfolding some classes of orthogonal polyhedra of arbitrary genus},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {482--500},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0299-1},
doi = {10.1007/s10878-018-0299-1},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HoCY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuPW19,
author = {Bin Hu and
Fang Pan and
Lei Wang},
title = {A scheduling algorithm for medical emergency rescue aircraft trajectory
based on hybrid estimation and intent inference},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {40--61},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0209-y},
doi = {10.1007/s10878-017-0209-y},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ItoKKKO19,
author = {Takehiro Ito and
Naonori Kakimura and
Naoyuki Kamiyama and
Yusuke Kobayashi and
Yoshio Okamoto},
title = {Reconfiguration of maximum-weight b-matchings in a graph},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {454--464},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0289-3},
doi = {10.1007/s10878-018-0289-3},
timestamp = {Tue, 05 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ItoKKKO19.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/JainDSV19,
author = {Ekta Jain and
Kalpana Dahiya and
Anuj Sharma and
Vanita Verma},
title = {An improved algorithm for two stage time minimization assignment problem},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {713--736},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0318-2},
doi = {10.1007/s10878-018-0318-2},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JainDSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangL19,
author = {Shanxiu Jiang and
Li Luo},
title = {Online in-time service problem with minimal server assignment},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {114--122},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0215-0},
doi = {10.1007/s10878-017-0215-0},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JiangL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangTY19,
author = {Bowen Jiang and
Jiafu Tang and
Chongjun Yan},
title = {A comparison of fixed and variable capacity-addition policies for
outpatient capacity allocation},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {150--182},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0217-y},
doi = {10.1007/s10878-017-0217-y},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JiangTY19.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, 23 Sep 2019 01:00:00 +0200},
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/LiC19,
author = {Wenhua Li and
Xing Chai},
title = {The medical laboratory scheduling for weighted flow-time},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {83--94},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0211-4},
doi = {10.1007/s10878-017-0211-4},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiC19.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/LiSWZ19,
author = {Zepeng Li and
Zehui Shao and
Pu Wu and
Taiyin Zhao},
title = {On the 2-rainbow domination stable graphs},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1327--1341},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0355-x},
doi = {10.1007/s10878-018-0355-x},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiSWZ19.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 = {Fri, 05 Jul 2019 01:00:00 +0200},
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/LiangHZ19,
author = {Jian Liang and
Xiaohui Huang and
Zhao Zhang},
title = {Approximation algorithms for distance constraint sweep coverage with
base stations},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1111--1125},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0341-3},
doi = {10.1007/s10878-018-0341-3},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangHZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangL19,
author = {Jun Liang and
Dingjun Lou},
title = {A polynomial algorithm determining cyclic vertex connectivity of k-regular
graphs with fixed k},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {1000--1010},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0332-4},
doi = {10.1007/s10878-018-0332-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiangL19.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/LinLXL19,
author = {Huidan Lin and
Qun Li and
Xueguo Xu and
Ping Li},
title = {Optimal arrangement of the pulmonary interventional surgeries considering
timely distribution of medical consumables},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {271--285},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0223-0},
doi = {10.1007/s10878-017-0223-0},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LinLXL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuCP19,
author = {Yajing Liu and
Edwin K. P. Chong and
Ali Pezeshki},
title = {Improved bounds for the greedy strategy in optimization problems with
curvature},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1126--1149},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0345-z},
doi = {10.1007/s10878-018-0345-z},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuCP19.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/LiuLLLZD19,
author = {Zhenyuan Liu and
Jiongbing Lu and
Zaisheng Liu and
Guangrui Liao and
Hao Howard Zhang and
Junwu Dong},
title = {Patient scheduling in hemodialysis service},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {337--362},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0232-z},
doi = {10.1007/s10878-017-0232-z},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuLLLZD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuWW19,
author = {Lu Liu and
Chun Wang and
Jian{-}Jun Wang},
title = {A combinatorial auction mechanism for surgical scheduling considering
surgeon's private availability information},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {405--417},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0247-5},
doi = {10.1007/s10878-017-0247-5},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuWW19.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 = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuYFDWW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuZZW19,
author = {Xiaohui Liu and
Ni Zou and
Dan Zhu and
Dan Wang},
title = {Influencing factors analysis and modeling of hospital-acquired infection
in elderly patients},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {248--270},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0222-1},
doi = {10.1007/s10878-017-0222-1},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuZZW19.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 = {Fri, 05 Jul 2019 01:00:00 +0200},
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 = {Fri, 03 Jan 2020 00:00:00 +0100},
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 = {Mon, 15 Jun 2020 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/NimbhorkarV19,
author = {Prajakta Nimbhorkar and
Arvind Rameshwar V},
title = {Dynamic rank-maximal and popular matchings},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {523--545},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0348-9},
doi = {10.1007/s10878-018-0348-9},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NimbhorkarV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NingLJ19,
author = {Baoling Ning and
Jianzhong Li and
Shouxu Jiang},
title = {Balanced tree partition problems with virtual nodes},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1249--1265},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0351-1},
doi = {10.1007/s10878-018-0351-1},
timestamp = {Fri, 03 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NingLJ19.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/PageS19,
author = {Daniel R. Page and
Roberto Solis{-}Oba},
title = {Approximation algorithms for the graph balancing problem with two
speeds and two job lengths},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {1045--1070},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0339-x},
doi = {10.1007/s10878-018-0339-x},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PageS19.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 = {Sat, 05 Sep 2020 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/PriddyWW19,
author = {Bruce Priddy and
Haiying Wang and
Bing Wei},
title = {Independent bondage number of a graph},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {702--712},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0319-1},
doi = {10.1007/s10878-018-0319-1},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PriddyWW19.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/QiuWWY19,
author = {Huaxin Qiu and
Dujuan Wang and
Yanzhang Wang and
Yunqiang Yin},
title = {{MRI} appointment scheduling with uncertain examination time},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {62--82},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0210-5},
doi = {10.1007/s10878-017-0210-5},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/QiuWWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ribas19,
author = {J. M. Grau Ribas},
title = {A new look at the returning secretary problem},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1216--1236},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0349-8},
doi = {10.1007/s10878-018-0349-8},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ribas19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiriS19,
author = {Davood Shiri and
F. Sibel Salman},
title = {Competitive analysis of randomized online strategies for the multi-agent
k-Canadian Traveler Problem},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {848--865},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0324-4},
doi = {10.1007/s10878-018-0324-4},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShiriS19.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/SuWW19,
author = {Huiqiao Su and
Guohua Wan and
Shan Wang},
title = {Online scheduling for outpatient services with heterogeneous patients
and physicians},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {123--149},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0216-z},
doi = {10.1007/s10878-017-0216-z},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SuWW19.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/Tamaki19,
author = {Hisao Tamaki},
title = {Positive-instance driven dynamic programming for treewidth},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1283--1311},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0353-z},
doi = {10.1007/s10878-018-0353-z},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Tamaki19.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 = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/TianZSMC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangFZX19,
author = {Yadong Wang and
Baoqiang Fan and
Jingang Zhai and
Wei Xiong},
title = {Two-machine flowshop scheduling in a physical examination center},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {363--374},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0233-y},
doi = {10.1007/s10878-017-0233-y},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangFZX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangHHW19,
author = {Weifan Wang and
Jingjing Huo and
Danjun Huang and
Yiqiao Wang},
title = {Planar graphs with {\textdollar}{\textdollar}{\textbackslash}Delta
=9{\textdollar}{\textdollar} {\(\Delta\)} = 9 are neighbor-distinguishing
totally 12-colorable},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {1071--1089},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0334-2},
doi = {10.1007/s10878-018-0334-2},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangHHW19.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/WangTZDD19,
author = {Meng Wang and
Cong Tian and
Nan Zhang and
Zhenhua Duan and
Hongwei Du},
title = {Verifying a scheduling protocol of safety-critical systems},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1191--1215},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0343-1},
doi = {10.1007/s10878-018-0343-1},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangTZDD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WenCLZ19,
author = {Yanyan Wen and
Guorong Chai and
Qiuli Li and
Zhe George Zhang},
title = {A possible optimal design of one-way Hamming network H(n, 3) based
on the minimum transmission latency},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {921--934},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0329-z},
doi = {10.1007/s10878-018-0329-z},
timestamp = {Fri, 29 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WenCLZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YanXLGZ19,
author = {Jihong Yan and
Chen Xu and
Na Li and
Ming Gao and
Aoying Zhou},
title = {Optimizing model parameter for entity summarization across knowledge
graphs},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {293--318},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0225-y},
doi = {10.1007/s10878-017-0225-y},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YanXLGZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangLFZFT19,
author = {Ying Yang and
Shoucheng Luo and
Jing Fan and
Xinye Zhou and
Chunyu Fu and
Guochun Tang},
title = {Study on specialist outpatient matching appointment and the balance
matching model},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {20--39},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0208-z},
doi = {10.1007/s10878-017-0208-z},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YangLFZFT19.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/YuL19,
author = {Wei Yu and
Zhaohui Liu},
title = {Better approximability results for min-max tree/cycle/path cover problems},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {563--578},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0268-8},
doi = {10.1007/s10878-018-0268-8},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YuL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaiZZTXL19,
author = {Shanshan Zhai and
Peng Zhang and
Daming Zhu and
Weitian Tong and
Yao Xu and
Guohui Lin},
title = {An approximation algorithm for genome sorting by reversals to recover
all adjacencies},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1170--1190},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0346-y},
doi = {10.1007/s10878-018-0346-y},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaiZZTXL19.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/ZhangHWXZ19,
author = {Dongmei Zhang and
Chunlin Hao and
Chenchen Wu and
Dachuan Xu and
Zhenning Zhang},
title = {Local search approximation algorithms for the k-means problem with
penalties},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {439--453},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0278-6},
doi = {10.1007/s10878-018-0278-6},
timestamp = {Tue, 05 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangHWXZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangLFSSY19,
author = {Feng Zhang and
Jing Li and
Junxiang Fan and
Huili Shen and
Jian Shen and
Hua Yu},
title = {Three-dimensional stable matching with hybrid preferences},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {330--336},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0231-0},
doi = {10.1007/s10878-017-0231-0},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangLFSSY19.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 = {Wed, 26 Jun 2019 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/ZhangWX19,
author = {Jiawei Zhang and
Ling Wang and
Lining Xing},
title = {Large-scale medical examination scheduling technology based on intelligent
optimization},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {385--404},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0246-6},
doi = {10.1007/s10878-017-0246-6},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangWX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangY19,
author = {Yuan Zhang and
Jinjiang Yuan},
title = {A note on a two-agent scheduling problem related to the total weighted
late work},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {989--999},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0337-z},
doi = {10.1007/s10878-018-0337-z},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangZB19,
author = {Long Zhang and
Yuzhong Zhang and
Qingguo Bai},
title = {Two-stage medical supply chain scheduling with an assignable common
due window and shelf life},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {319--329},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0228-8},
doi = {10.1007/s10878-017-0228-8},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangZB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhongB19,
author = {Liwei Zhong and
Yanqin Bai},
title = {Three-sided stable matching problem with two of them as cooperative
partners},
journal = {J. Comb. Optim.},
volume = {37},
number = {1},
pages = {286--292},
year = {2019},
url = {https://doi.org/10.1007/s10878-017-0224-z},
doi = {10.1007/s10878-017-0224-z},
timestamp = {Fri, 25 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhongB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuFYPP19,
author = {Shuwan Zhu and
Wenjuan Fan and
Shanlin Yang and
Jun Pei and
Panos M. Pardalos},
title = {Operating room planning and surgical case scheduling: a review of
literature},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {757--805},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0322-6},
doi = {10.1007/s10878-018-0322-6},
timestamp = {Fri, 29 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhuFYPP19.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}
}
@article{DBLP:journals/jco/Abdel-JabbarKMO18,
author = {Mohammed{-}Albarra Hassan Abdel{-}Jabbar and
Imed Kacem and
S{\'{e}}bastien Martin and
Izzeldin M. Osman},
title = {On the m-clique free interval subgraphs polytope: polyhedral analysis
and applications},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {1074--1101},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0291-9},
doi = {10.1007/s10878-018-0291-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Abdel-JabbarKMO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AguedaCFLMMMNOO18,
author = {Raquel {\'{A}}gueda and
Nathann Cohen and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Leandro Montero and
Reza Naserasr and
Hirotaka Ono and
Yota Otachi and
Tadashi Sakuma and
Zsolt Tuza and
Renyu Xu},
title = {Safe sets in graphs: Graph classes and structural parameters},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1221--1242},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0205-2},
doi = {10.1007/s10878-017-0205-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AguedaCFLMMMNOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AmjadiNSV18,
author = {Jafar Amjadi and
Sakineh Nazari{-}Moghaddam and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {An upper bound on the double Roman domination number},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {81--89},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0286-6},
doi = {10.1007/s10878-018-0286-6},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AmjadiNSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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/AndoS18,
author = {Kazutoshi Ando and
Koki Sato},
title = {An algorithm for finding a representation of a subtree distance},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {742--762},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0145-x},
doi = {10.1007/s10878-017-0145-x},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AndoS18.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/AuroraJR18,
author = {Pawan Aurora and
Monalisa Jena and
Rajiv Raman},
title = {Constant factor approximation for the weighted partial degree bounded
edge packing problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1243--1261},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0206-1},
doi = {10.1007/s10878-017-0206-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AuroraJR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AuroraM18,
author = {Pawan Aurora and
Shashank K. Mehta},
title = {The QAP-polytope and the graph isomorphism problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {965--1006},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0266-x},
doi = {10.1007/s10878-018-0266-x},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AuroraM18.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 = {Fri, 30 Nov 2018 00:00:00 +0100},
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 = {Mon, 12 Feb 2018 00:00:00 +0100},
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/Ben-AmeurGN18,
author = {Walid Ben{-}Ameur and
Antoine Glorieux and
Jos{\'{e}} Neto},
title = {On the most imbalanced orientation of a graph},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {637--669},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0117-1},
doi = {10.1007/s10878-017-0117-1},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurGN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BendaliM18,
author = {Fatiha Bendali and
Jean Mailfert},
title = {The weakly connected independent set polytope in corona and join of
graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {1007--1023},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0275-9},
doi = {10.1007/s10878-018-0275-9},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BendaliM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BendottiFR18,
author = {Pascale Bendotti and
Pierre Fouilhoux and
C{\'{e}}cile Rottner},
title = {The min-up/min-down unit commitment polytope},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {1024--1058},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0273-y},
doi = {10.1007/s10878-018-0273-y},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BendottiFR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeregCDL18,
author = {Sergey Bereg and
Luis Evaristo Caraballo and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Mario Alberto L{\'{o}}pez},
title = {Computing the k-resilience of a synchronized multi-robot system},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {365--391},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0297-3},
doi = {10.1007/s10878-018-0297-3},
timestamp = {Wed, 06 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BeregCDL18.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/BougeretDG18,
author = {Marin Bougeret and
Guillerme Duvilli{\'{e}} and
Rodolphe Giroudeau},
title = {Approximability and exact resolution of the multidimensional binary
vector assignment problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {1059--1073},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0276-8},
doi = {10.1007/s10878-018-0276-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BougeretDG18.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 = {Fri, 17 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BoyaciES18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BruglieriPP18,
author = {Maurizio Bruglieri and
Ferdinando Pezzella and
Ornella Pisacane},
title = {A two-phase optimization method for a multiobjective vehicle relocation
problem in electric carsharing systems},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {162--193},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0295-5},
doi = {10.1007/s10878-018-0295-5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BruglieriPP18.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/CaskurluWSM18,
author = {Bugra Caskurlu and
Matthew D. Williamson and
K. Subramani and
Vahan Mkrtchyan},
title = {On approximating optimal weight "no"-certificates in weighted difference
constraint systems},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {329--345},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0292-8},
doi = {10.1007/s10878-018-0292-8},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaskurluWSM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChaiL18,
author = {Xing Chai and
Wenhua Li},
title = {Online scheduling with chain precedence constraints of equal-length
jobs on parallel machines to minimize makespan},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {472--492},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0309-3},
doi = {10.1007/s10878-018-0309-3},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChaiL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangLMQ18,
author = {Hong Chang and
Xueliang Li and
Colton Magnant and
Zhongmei Qin},
title = {The (k , {\(\mathscr{l}\)})-proper index of graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {458--471},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0307-5},
doi = {10.1007/s10878-018-0307-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangLMQ18.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 = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenHGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenHZ18,
author = {Lina Chen and
Xiaohui Huang and
Zhao Zhang},
title = {A simpler {PTAS} for connected k-path vertex cover in homogeneous
wireless sensor network},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {35--43},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0283-9},
doi = {10.1007/s10878-018-0283-9},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenHZ18.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 = {Tue, 03 Apr 2018 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/ConiglioKS18,
author = {Stefano Coniglio and
Arie M. C. A. Koster and
Nils Spiekermann},
title = {Lot sizing with storage losses under demand uncertainty},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {763--788},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0147-8},
doi = {10.1007/s10878-017-0147-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ConiglioKS18.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/CzibulaGZ18,
author = {Oliver G. Czibula and
Hanyu Gu and
Yakov Zinder},
title = {Planning personnel retraining: column generation heuristics},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {896--915},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0253-2},
doi = {10.1007/s10878-018-0253-2},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CzibulaGZ18.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/DingQ18,
author = {Wei Ding and
Ke Qiu},
title = {A quadratic time exact algorithm for continuous connected 2-facility
location problem in trees},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1262--1298},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0213-2},
doi = {10.1007/s10878-017-0213-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DingQ18.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 = {Thu, 22 Mar 2018 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/DondiS18,
author = {Riccardo Dondi and
Florian Sikora},
title = {Finding disjoint paths on edge-colored graphs: more tractability results},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1315--1332},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0238-6},
doi = {10.1007/s10878-017-0238-6},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DondiS18.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/EpsteinJL18,
author = {Leah Epstein and
David S. Johnson and
Asaf Levin},
title = {Min-Sum Bin Packing},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {508--531},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0310-x},
doi = {10.1007/s10878-018-0310-x},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EpsteinJL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FangLSS18,
author = {Qizhi Fang and
Bo Li and
Xiaohan Shan and
Xiaoming Sun},
title = {Path cooperative games},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {211--229},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0296-4},
doi = {10.1007/s10878-018-0296-4},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FangLSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FeldottoLS18,
author = {Matthias Feldotto and
Lennart Leder and
Alexander Skopalik},
title = {Congestion games with mixed objectives},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1145--1167},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0189-y},
doi = {10.1007/s10878-017-0189-y},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FeldottoLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FengXND18,
author = {Xin Feng and
Yinfeng Xu and
Guanqun Ni and
Yongwu Dai},
title = {Online leasing problem with price fluctuations under the consumer
price index},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {493--507},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0305-7},
doi = {10.1007/s10878-018-0305-7},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FengXND18.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/FongCN18,
author = {Wai Lam Fong and
Wai Hong Chan and
Ge Nong},
title = {The game chromatic index of some trees with maximum degree four and
adjacent degree-four vertices},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {1--12},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0277-7},
doi = {10.1007/s10878-018-0277-7},
timestamp = {Wed, 06 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FongCN18.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 = {Sat, 05 Sep 2020 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/GaiDWZB18,
author = {Ling Gai and
Hongwei Du and
Lidong Wu and
Junlei Zhu and
Yuehua Bu},
title = {Blocking Rumor by Cut},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {392--399},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0304-8},
doi = {10.1007/s10878-018-0304-8},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GaiDWZB18.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 = {Mon, 12 Feb 2018 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/GottschalkLPW18,
author = {Corinna Gottschalk and
Hendrik L{\"{u}}then and
Britta Peis and
Andreas Wierz},
title = {Optimization problems with color-induced budget constraints},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {861--870},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0182-5},
doi = {10.1007/s10878-017-0182-5},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GottschalkLPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GourvesMT18,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
title = {Subset sum problems with digraph constraints},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {937--964},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0262-1},
doi = {10.1007/s10878-018-0262-1},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GourvesMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GregorSV18,
author = {Petr Gregor and
Riste Skrekovski and
Vida Vukasinovic},
title = {Broadcasting multiple messages in the 1-in port model in optimal time},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1333--1355},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0274-x},
doi = {10.1007/s10878-018-0274-x},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GregorSV18.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/GuGLZ18,
author = {Jinwei Gu and
Manzhan Gu and
Xiwen Lu and
Ying Zhang},
title = {Asymptotically optimal policy for stochastic job shop scheduling problem
to minimize makespan},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {142--161},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0294-6},
doi = {10.1007/s10878-018-0294-6},
timestamp = {Wed, 06 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuGLZ18.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 = {Fri, 06 Apr 2018 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/HanLLM18,
author = {Miaomiao Han and
You Lu and
Rong Luo and
Zhengke Miao},
title = {Neighbor sum distinguishing total coloring of graphs with bounded
treewidth},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {23--34},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0271-0},
doi = {10.1007/s10878-018-0271-0},
timestamp = {Fri, 04 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanLLM18.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 = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HanXDZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanawaHKKT18,
author = {Yosuke Hanawa and
Yuya Higashikawa and
Naoyuki Kamiyama and
Naoki Katoh and
Atsushi Takizawa},
title = {The mixed evacuation problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1299--1314},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0237-7},
doi = {10.1007/s10878-017-0237-7},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanawaHKKT18.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/HarksT18,
author = {Tobias Harks and
Veerle Timmermans},
title = {Uniqueness of equilibria in atomic splittable polymatroid congestion
games},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {812--830},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0166-5},
doi = {10.1007/s10878-017-0166-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HarksT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HaynesH18,
author = {Teresa W. Haynes and
Michael A. Henning},
title = {Perfect graphs involving semitotal and semipaired domination},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {416--433},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0303-9},
doi = {10.1007/s10878-018-0303-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HaynesH18.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/HellmuthW18,
author = {Marc Hellmuth and
Nicolas Wieseke},
title = {On tree representations of relations and graphs: symbolic ultrametrics
and cograph edge decompositions},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {591--616},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0111-7},
doi = {10.1007/s10878-017-0111-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HellmuthW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HiraiO18,
author = {Hiroshi Hirai and
Taihei Oki},
title = {A compact representation for minimizers of k-submodular functions},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {709--741},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0142-0},
doi = {10.1007/s10878-017-0142-0},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HiraiO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HoskinsLVY18,
author = {Heather Hoskins and
Runrun Liu and
Jennifer Vandenbussche and
Gexin Yu},
title = {Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {346--364},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0298-2},
doi = {10.1007/s10878-018-0298-2},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HoskinsLVY18.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/HuangLW18,
author = {Jing Huang and
Shuchao Li and
Hua Wang},
title = {Relation between the skew-rank of an oriented graph and the independence
number of its underlying graph},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {65--80},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0282-x},
doi = {10.1007/s10878-018-0282-x},
timestamp = {Wed, 18 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuangLW18.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/Iwamasa18,
author = {Yuni Iwamasa},
title = {On a general framework for network representability in discrete optimization},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {678--708},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0136-y},
doi = {10.1007/s10878-017-0136-y},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Iwamasa18.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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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 = {Fri, 30 Nov 2018 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/KamgaWWC18,
author = {Victor Loumngam Kamga and
Weifan Wang and
Ying Wang and
Min Chen},
title = {2-Distance vertex-distinguishing index of subcubic graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {108--120},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0288-4},
doi = {10.1007/s10878-018-0288-4},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KamgaWWC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KangZS18,
author = {Liying Kang and
Jianjie Zhou and
Erfang Shan},
title = {Algorithms for connected p-centdian problem on block graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {252--263},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0058-0},
doi = {10.1007/s10878-016-0058-0},
timestamp = {Wed, 06 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KangZS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kiraly18,
author = {Tam{\'{a}}s Kir{\'{a}}ly},
title = {Base polyhedra and the linking property},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {671--677},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0133-1},
doi = {10.1007/s10878-017-0133-1},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kiraly18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KonigMHR18,
author = {J{\"{u}}rgen K{\"{o}}nig and
Alexander M{\"{a}}cker and
Friedhelm Meyer auf der Heide and
S{\"{o}}ren Riechers},
title = {Scheduling with interjob communication on parallel processors},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1356--1379},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0325-3},
doi = {10.1007/s10878-018-0325-3},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KonigMHR18.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/KurpiszLM18,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {Sum-of-squares rank upper bounds for matching problems},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {831--844},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0169-2},
doi = {10.1007/s10878-017-0169-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KurpiszLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LeP18,
author = {Van Bang Le and
Sheng{-}Lung Peng},
title = {On the complete width and edge clique cover problems},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {532--548},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0106-9},
doi = {10.1007/s10878-016-0106-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LeP18.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 = {Thu, 22 Mar 2018 00:00:00 +0100},
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 = {Thu, 22 Mar 2018 00:00:00 +0100},
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/LuoXZZ18,
author = {Kelin Luo and
Yinfeng Xu and
Bowen Zhang and
Huili Zhang},
title = {Creating an acceptable consensus ranking for group decision making},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {307--328},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0086-9},
doi = {10.1007/s10878-016-0086-9},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuoXZZ18.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, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuzarPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuzarPS18a,
author = {Borut Luzar and
Jakub Przybylo and
Roman Sot{\'{a}}k},
title = {New bounds for locally irregular chromatic index of bipartite and
subcubic graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1425--1438},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0313-7},
doi = {10.1007/s10878-018-0313-7},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuzarPS18a.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 = {Tue, 03 Apr 2018 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/MackerMHR18,
author = {Alexander M{\"{a}}cker and
Manuel Malatyali and
Friedhelm Meyer auf der Heide and
S{\"{o}}ren Riechers},
title = {Cost-efficient scheduling on machines from the cloud},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1168--1194},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0198-x},
doi = {10.1007/s10878-017-0198-x},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MackerMHR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Mallach18,
author = {Sven Mallach},
title = {Improved mixed-integer programming models for the multiprocessor scheduling
problem with communication delays},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {871--895},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0199-9},
doi = {10.1007/s10878-017-0199-9},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Mallach18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Martinez-PerezR18,
author = {{\'{A}}lvaro Mart{\'{\i}}nez{-}P{\'{e}}rez and
Jos{\'{e}} M. Rodr{\'{\i}}guez},
title = {New lower bounds for the second variable Zagreb index},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {194--210},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0293-7},
doi = {10.1007/s10878-018-0293-7},
timestamp = {Sun, 02 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Martinez-PerezR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MeiYZ18,
author = {Lili Mei and
Deshi Ye and
Yong Zhang},
title = {Approximation strategy-proof mechanisms for obnoxious facility location
on a line},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {549--571},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0105-x},
doi = {10.1007/s10878-016-0105-x},
timestamp = {Wed, 03 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MeiYZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MerabetMD18,
author = {Massinissa Merabet and
Mikl{\'{o}}s Moln{\'{a}}r and
Sylvain Durand},
title = {{ILP} formulation of the degree-constrained minimum spanning hierarchy
problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {789--811},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0159-4},
doi = {10.1007/s10878-017-0159-4},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MerabetMD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MishraMP18,
author = {Gopinath Mishra and
Subhra Mazumdar and
Arindam Pal},
title = {Improved algorithms for the evacuation route planning problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {280--306},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0082-0},
doi = {10.1007/s10878-016-0082-0},
timestamp = {Tue, 19 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MishraMP18.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/Oboudi18,
author = {Mohammad Reza Oboudi},
title = {Majorization and the spectral radius of starlike trees},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {121--129},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0287-5},
doi = {10.1007/s10878-018-0287-5},
timestamp = {Wed, 06 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Oboudi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Oboudi18a,
author = {Mohammad Reza Oboudi},
title = {Correction to: Majorization and the spectral radius of starlike trees},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {130},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0301-y},
doi = {10.1007/s10878-018-0301-y},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Oboudi18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PanXZ18,
author = {Jiayin Pan and
Yinfeng Xu and
Guiqing Zhang},
title = {Online integrated allocation of berths and quay cranes in container
terminals with 1-lookahead},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {617--636},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0113-5},
doi = {10.1007/s10878-017-0113-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PanXZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PandaPP18,
author = {B. S. Panda and
Arti Pandey and
S. Paul},
title = {Algorithmic aspects of b-disjunctive domination in graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {572--590},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0112-6},
doi = {10.1007/s10878-017-0112-6},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PandaPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PedrosaS18,
author = {Lehilton L. C. Pedrosa and
Rafael Crivellari Saliba Schouery},
title = {Approximation algorithms for the bus evacuation problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {131--141},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0290-x},
doi = {10.1007/s10878-018-0290-x},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PedrosaS18.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/Pinar18,
author = {Mustafa {\c{C}}. Pinar},
title = {Robust trading mechanisms over 0/1 polytopes},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {845--860},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0177-2},
doi = {10.1007/s10878-017-0177-2},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Pinar18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PisantechakoolT18,
author = {Photchchara Pisantechakool and
Xuehou Tan},
title = {The capture time of a planar graph},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1103--1117},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0173-6},
doi = {10.1007/s10878-017-0173-6},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PisantechakoolT18.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/QueyranneW18,
author = {Maurice Queyranne and
Laurence A. Wolsey},
title = {Optimum turn-restricted paths, nested compatibility, and optimum convex
polygons},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {90--107},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0281-y},
doi = {10.1007/s10878-018-0281-y},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/QueyranneW18.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/RecaldeSTV18,
author = {Diego Recalde and
Daniel Sever{\'{\i}}n and
Ramiro Torres and
Polo Vaca},
title = {An exact approach for the balanced k-way partitioning problem with
weight constraints and its application to sports team realignment},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {916--936},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0254-1},
doi = {10.1007/s10878-018-0254-1},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RecaldeSTV18.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 = {Fri, 06 Apr 2018 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/ShanK18,
author = {Erfang Shan and
Liying Kang},
title = {The w-centroids and least w-central subtrees in weighted trees},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1118--1127},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0174-5},
doi = {10.1007/s10878-017-0174-5},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShanK18.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 J. 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 = {Mon, 12 Feb 2018 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/WangLGDW18,
author = {Huijuan Wang and
Bin Liu and
Ling Gai and
Hongwei Du and
Jianliang Wu},
title = {Minimum choosability of planar graphs},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {13--22},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0280-z},
doi = {10.1007/s10878-018-0280-z},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangLGDW18.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/WangXDW18,
author = {Yishui Wang and
Dachuan Xu and
Donglei Du and
Chenchen Wu},
title = {An approximation algorithm for k-facility location problem with linear
penalties using local search scheme},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {264--279},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0080-2},
doi = {10.1007/s10878-016-0080-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangXDW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WellerCGKP18,
author = {Mathias Weller and
Annie Chateau and
Rodolphe Giroudeau and
Jean{-}Claude K{\"{o}}nig and
Valentin Pollet},
title = {On residual approximation in solution extension problems},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1195--1220},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0202-5},
doi = {10.1007/s10878-017-0202-5},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WellerCGKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuC18,
author = {Yueshi Wu and
Mihaela Cardei},
title = {Distributed algorithms for barrier coverage via sensor rotation in
wireless sensor networks},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {230--251},
year = {2018},
url = {https://doi.org/10.1007/s10878-016-0055-3},
doi = {10.1007/s10878-016-0055-3},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuC18.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, 31 Oct 2019 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 = {Shu{-}Fei 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 = {Thu, 11 Jan 2018 00:00:00 +0100},
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 = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XieG18,
author = {Tian Xie and
Dongdong Ge},
title = {A tractable discrete fractional programming: application to constrained
assortment optimization},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {400--415},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0302-x},
doi = {10.1007/s10878-018-0302-x},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XieG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuLDK18,
author = {Kexiang Xu and
Haiqiong Liu and
Kinkar Chandra Das and
Sandi Klavzar},
title = {Embeddings into almost self-centered graphs of given radius},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1388--1410},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0311-9},
doi = {10.1007/s10878-018-0311-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XuLDK18.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 = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XuPWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuPX18,
author = {Yi Xu and
Jigen Peng and
Yinfeng Xu},
title = {The mixed center location problem},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1128--1144},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0183-4},
doi = {10.1007/s10878-017-0183-4},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuPX18.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/ZhangCQ18,
author = {Guiqing Zhang and
Yongxi Cheng and
Lan Qin},
title = {An improved online evacuation strategy from a convex region on grid
networks},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {44--54},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0284-8},
doi = {10.1007/s10878-018-0284-8},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangCQ18.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/ZhangFLLZL18,
author = {Xiao Zhang and
Haosheng Fan and
Victor C. S. Lee and
Minming Li and
Yingchao Zhao and
Chuang Liu},
title = {Minimizing the total cost of barrier coverage in a linear domain},
journal = {J. Comb. Optim.},
volume = {36},
number = {2},
pages = {434--457},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0306-6},
doi = {10.1007/s10878-018-0306-6},
timestamp = {Mon, 06 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangFLLZL18.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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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 = {Tue, 03 Apr 2018 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/ZhongB18,
author = {Liwei Zhong and
Yanqin Bai},
title = {Equivalence of two-sided stable matching},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1380--1387},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0308-4},
doi = {10.1007/s10878-018-0308-4},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhongB18.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/ZhuB18,
author = {Junlei Zhu and
Yuehua Bu},
title = {Minimum 2-distance coloring of planar graphs and channel assignment},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {55--64},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0285-7},
doi = {10.1007/s10878-018-0285-7},
timestamp = {Wed, 06 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuB18.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/ZhuGSL18,
author = {Haiyang Zhu and
Yu Gu and
Jingjun Sheng and
Xinzhong L{\"{u}}},
title = {List 2-distance {\textdollar}{\textdollar}{\textbackslash}varDelta
+3{\textdollar}{\textdollar} {\(\Delta\)} + 3 -coloring of planar
graphs without 4, 5-cycles},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1411--1424},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0312-8},
doi = {10.1007/s10878-018-0312-8},
timestamp = {Tue, 02 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuGSL18.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, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZouZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AdarE17,
author = {Ron Adar and
Leah Epstein},
title = {The k-metric dimension},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {1--30},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0073-1},
doi = {10.1007/s10878-016-0073-1},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AdarE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AhadiDS17,
author = {Arash Ahadi and
Ali Dehghan and
Morteza Saghafian},
title = {Is there any polynomial upper bound for the universal labeling of
graphs?},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {760--770},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0107-8},
doi = {10.1007/s10878-016-0107-8},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AhadiDS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AldridgeBG17,
author = {Matthew Aldridge and
Leonardo Baldassini and
Karen Gunderson},
title = {Almost separable matrices},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {215--236},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9951-1},
doi = {10.1007/s10878-015-9951-1},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AldridgeBG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BahremandpourSV17,
author = {A. Bahremandpour and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Roman game domination number of a graph},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {713--725},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0001-4},
doi = {10.1007/s10878-016-0001-4},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BahremandpourSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BaiLY17,
author = {Ying Bai and
Xiangwen Li and
Gexin Yu},
title = {Every planar graph without 3-cycles adjacent to 4-cycles and without
6-cycles is (1, 1, 0)-colorable},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1354--1364},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0039-3},
doi = {10.1007/s10878-016-0039-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BaiLY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BohmSSV17,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {A two-phase algorithm for bin stretching with stretching factor 1.5},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {810--828},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0114-4},
doi = {10.1007/s10878-017-0114-4},
timestamp = {Tue, 24 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BohmSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BohmSSV17a,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {Erratum to: {A} two-phase algorithm for bin stretching with stretching
factor 1.5},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {829},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0116-2},
doi = {10.1007/s10878-017-0116-2},
timestamp = {Tue, 24 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BohmSSV17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BraunerFS17,
author = {Nadia Brauner and
Gerd Finke and
Yakov M. Shafransky},
title = {Lawler's minmax cost problem under uncertainty},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {31--46},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0051-7},
doi = {10.1007/s10878-016-0051-7},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BraunerFS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BrownYZP17,
author = {Peter Brown and
Yuedong Yang and
Yaoqi Zhou and
Wayne Pullan},
title = {A heuristic for the time constrained asymmetric linear sum assignment
problem},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {551--566},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9979-2},
doi = {10.1007/s10878-015-9979-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BrownYZP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BurgyG17,
author = {Reinhard B{\"{u}}rgy and
Heinz Gr{\"{o}}flin},
title = {The no-wait job shop with regular objective: a method based on optimal
job insertion},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {977--1010},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0020-1},
doi = {10.1007/s10878-016-0020-1},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BurgyG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiH17,
author = {Kai Cai and
Guangyue Han},
title = {On the Langberg-M{\'{e}}dard multiple unicast conjecture},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1114--1132},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0132-2},
doi = {10.1007/s10878-017-0132-2},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiLW17,
author = {Qingqiong Cai and
Xueliang Li and
Di Wu},
title = {Erd{\H{o}}s-Gallai-type results for colorful monochromatic connectivity
of a graph},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {123--131},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9938-y},
doi = {10.1007/s10878-015-9938-y},
timestamp = {Thu, 16 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CaiLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiLY17,
author = {Jiansheng Cai and
Xueliang Li and
Guiying Yan},
title = {Improved upper bound for the degenerate and star chromatic numbers
of graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {441--452},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0076-y},
doi = {10.1007/s10878-016-0076-y},
timestamp = {Thu, 16 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CaiLY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaoCHW17,
author = {Zhigang Cao and
Xujin Chen and
Xiaodong Hu and
Changjun Wang},
title = {Approximation algorithms for pricing with negative network externalities},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {681--712},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9988-1},
doi = {10.1007/s10878-015-9988-1},
timestamp = {Thu, 12 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CaoCHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaraballoOPR17,
author = {Luis Evaristo Caraballo and
Carlos Ochoa and
Pablo P{\'{e}}rez{-}Lantero and
Javiel Rojas{-}Ledesma},
title = {Matching colored points with rectangles},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {403--421},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9971-x},
doi = {10.1007/s10878-015-9971-x},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaraballoOPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CarvalhoA17,
author = {Filipa D. Carvalho and
Maria Teresa Almeida},
title = {The triangle k-club problem},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {814--846},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0009-9},
doi = {10.1007/s10878-016-0009-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CarvalhoA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CevnikZ17,
author = {Maja Cevnik and
Janez Zerovnik},
title = {Broadcasting on cactus graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {292--316},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9957-8},
doi = {10.1007/s10878-015-9957-8},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CevnikZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangYHCW17,
author = {Yu{-}Huei Chang and
Jinn{-}Shyong Yang and
Sun{-}Yuan Hsieh and
Jou{-}Ming Chang and
Yue{-}Li Wang},
title = {Construction independent spanning trees on locally twisted cubes in
parallel},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {956--967},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0018-8},
doi = {10.1007/s10878-016-0018-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChangYHCW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CharpentierGL17,
author = {Cl{\'{e}}ment Charpentier and
Sylvain Gravier and
Thomas Lecorre},
title = {Trinque problem: covering complete graphs by plane degree-bounded
hypergraphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {543--550},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9978-3},
doi = {10.1007/s10878-015-9978-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CharpentierGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenFWW17,
author = {Min Chen and
Yingying Fan and
Yiqiao Wang and
Weifan Wang},
title = {A sufficient condition for planar graphs to be (3, 1)-choosable},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {987--1011},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0124-2},
doi = {10.1007/s10878-017-0124-2},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenFWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenGSWW17,
author = {Guantao Chen and
Yuping Gao and
Songling Shan and
Guanghui Wang and
Jianliang Wu},
title = {Equitable vertex arboricity of 5-degenerate graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {426--432},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9997-8},
doi = {10.1007/s10878-016-9997-8},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenGSWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenLLM17,
author = {Lily Chen and
Xueliang Li and
Mengmeng Liu and
Yaping Mao},
title = {A solution to a conjecture on the generalized connectivity of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {275--282},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9955-x},
doi = {10.1007/s10878-015-9955-x},
timestamp = {Sat, 11 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenLLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenLWQTW17,
author = {Wenbin Chen and
Fufang Li and
Jianxiong Wang and
Ke Qi and
Maobin Tang and
Xiuni Wang},
title = {A primal-dual online algorithm for the k-server problem on weighted
HSTs},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1133--1146},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0135-z},
doi = {10.1007/s10878-017-0135-z},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLWQTW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenNFCGFK17,
author = {Xin Chen and
Qingqin Nong and
Yan Feng and
Yongchang Cao and
Suning Gong and
Qizhi Fang and
Ker{-}I Ko},
title = {Centralized and decentralized rumor blocking problems},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {314--329},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0067-z},
doi = {10.1007/s10878-016-0067-z},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenNFCGFK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenW17,
author = {Li{-}Hsuan Chen and
Bang Ye Wu},
title = {Parameterized algorithms for min-max 2-cluster editing},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {47--63},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0059-z},
doi = {10.1007/s10878-016-0059-z},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenXZS17,
author = {Cong Chen and
Yinfeng Xu and
Yuqing Zhu and
Chengyu Sun},
title = {Online MapReduce scheduling problem of minimizing the makespan},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {590--608},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9982-7},
doi = {10.1007/s10878-015-9982-7},
timestamp = {Wed, 24 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenXZS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenY17,
author = {Yichao Chen and
Yan Yang},
title = {The thickness of the complete multipartite graphs and the join of
graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {194--202},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0057-1},
doi = {10.1007/s10878-016-0057-1},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengWW17,
author = {Xiaohan Cheng and
Guanghui Wang and
Jianliang Wu},
title = {The adjacent vertex distinguishing total chromatic numbers of planar
graphs {\(\Delta\)} = 10},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {383--397},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9995-x},
doi = {10.1007/s10878-016-9995-x},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChengWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengZZ17,
author = {Jian Cheng and
Cun{-}Quan Zhang and
Bao{-}Xuan Zhu},
title = {Even factors of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1343--1353},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0038-4},
doi = {10.1007/s10878-016-0038-4},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChengZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChimaniH17,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {A tighter insertion-based approximation of the crossing number},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1183--1225},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0030-z},
doi = {10.1007/s10878-016-0030-z},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChimaniH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CoelhoMW17,
author = {Rafael S. Coelho and
Phablo F. S. Moura and
Yoshiko Wakabayashi},
title = {The k-hop connected dominating set problem: approximation and hardness},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1060--1083},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0128-y},
doi = {10.1007/s10878-017-0128-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CoelhoMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CohenGLO17,
author = {Reuven Cohen and
Mira Gonen and
Asaf Levin and
Shmuel Onn},
title = {On nonlinear multi-covering problems},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {645--659},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9985-4},
doi = {10.1007/s10878-015-9985-4},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CohenGLO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CranstonPXY17,
author = {Daniel W. Cranston and
Luke Postle and
Chenxiao Xue and
Carl Yerger},
title = {Modified linear programming and class 0 bounds for graph pebbling},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {114--132},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0060-6},
doi = {10.1007/s10878-016-0060-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CranstonPXY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CroceKT17,
author = {Federico Della Croce and
Christos Koulamas and
Vincent T'Kindt},
title = {Minimizing the number of tardy jobs in two-machine settings with common
due date},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {133--140},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0054-4},
doi = {10.1007/s10878-016-0054-4},
timestamp = {Wed, 28 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CroceKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CuiZC17,
author = {Yi{-}Ping Cui and
Yongwu Zhou and
Yaodong Cui},
title = {Triple-solution approach for the strip packing problem with two-staged
patterns},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {588--604},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0088-7},
doi = {10.1007/s10878-016-0088-7},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CuiZC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DaneshgarM17,
author = {Amir Daneshgar and
Meysam Madani},
title = {On the odd girth and the circular chromatic number of generalized
Petersen graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {897--923},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0013-0},
doi = {10.1007/s10878-016-0013-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DaneshgarM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DasN17,
author = {Kinkar Chandra Das and
Mohammad J. Nadjafi{-}Arani},
title = {On maximum Wiener index of trees and graphs with given radius},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {574--587},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0092-y},
doi = {10.1007/s10878-016-0092-y},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DasN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DengZ17,
author = {Kai Deng and
Heping Zhang},
title = {Anti-forcing spectra of perfect matchings of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {660--680},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9986-3},
doi = {10.1007/s10878-015-9986-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DengZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DingQ17,
author = {Wei Ding and
Ke Qiu},
title = {An {FPTAS} for generalized absolute 1-center problem in vertex-weighted
graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1084--1095},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0130-4},
doi = {10.1007/s10878-017-0130-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DingQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DongX17,
author = {Wei Dong and
Baogang Xu},
title = {2-Distance coloring of planar graphs with girth 5},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1302--1322},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0148-7},
doi = {10.1007/s10878-017-0148-7},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DongX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DuartePRS17,
author = {M{\'{a}}rcio Ant{\^{o}}nio Duarte and
Lucia Draque Penso and
Dieter Rautenbach and
U{\'{e}}verton dos Santos Souza},
title = {Complexity properties of complementary prisms},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {365--372},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9968-5},
doi = {10.1007/s10878-015-9968-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DuartePRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EvrendilekTH17,
author = {Cem Evrendilek and
Ismail Hakki Toroslu and
Seyedsasan Hashemikhabir},
title = {Task assignment in tree-like hierarchical structures},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {631--655},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0097-6},
doi = {10.1007/s10878-016-0097-6},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EvrendilekTH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FarbsteinL17,
author = {Boaz Farbstein and
Asaf Levin},
title = {Maximum coverage problem with group budget constraints},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {725--735},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0102-0},
doi = {10.1007/s10878-016-0102-0},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FarbsteinL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FerreroHKY17,
author = {Daniela Ferrero and
Leslie Hogben and
Franklin H. J. Kenter and
Michael Young},
title = {Note on power propagation time and lower bounds for the power domination
number},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {736--741},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0103-z},
doi = {10.1007/s10878-016-0103-z},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FerreroHKY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FischerH17,
author = {Anja Fischer and
Philipp Hungerl{\"{a}}nder},
title = {The traveling salesman problem on grids with forbidden neighborhoods},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {891--915},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0119-z},
doi = {10.1007/s10878-017-0119-z},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FischerH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FuTLY17,
author = {Ruyan Fu and
Ji Tian and
Shisheng Li and
Jinjiang Yuan},
title = {An optimal online algorithm for the parallel-batch scheduling with
job processing time compatibilities},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1187--1197},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0139-8},
doi = {10.1007/s10878-017-0139-8},
timestamp = {Tue, 07 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FuTLY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GabarroGS17,
author = {Joaquim Gabarr{\'{o}} and
Sergio Leon Gaixas and
Maria J. Serna},
title = {The computational complexity of QoS measures for orchestrations -
The computational complexity of QoS measures},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1265--1301},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0146-9},
doi = {10.1007/s10878-017-0146-9},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GabarroGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GarraffaCS17,
author = {Michele Garraffa and
Federico Della Croce and
Fabio Salassa},
title = {An exact semidefinite programming approach for the max-mean dispersion
problem},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {71--93},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0065-1},
doi = {10.1007/s10878-016-0065-1},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GarraffaCS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GeorgesMW17,
author = {John P. Georges and
David W. Mauro and
Kirsti Wash},
title = {On zero-sum {\(\mathbb{Z}\)}\({}_{\mbox{2j}}\)\({}^{\mbox{k}}\) -magic
graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {94--113},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0069-x},
doi = {10.1007/s10878-016-0069-x},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GeorgesMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ghiyasvand17,
author = {Mehdi Ghiyasvand},
title = {A faster strongly polynomial time algorithm to solve the minimum cost
tension problem},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {203--217},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0070-4},
doi = {10.1007/s10878-016-0070-4},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ghiyasvand17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GoebbelsGRY17,
author = {Steffen Goebbels and
Frank Gurski and
Jochen Rethmann and
Eda Yilmaz},
title = {Change-making problems revisited: a parameterized point of view},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1218--1236},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0143-z},
doi = {10.1007/s10878-017-0143-z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GoebbelsGRY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GregorLS17,
author = {Petr Gregor and
Borut Luzar and
Roman Sot{\'{a}}k},
title = {Note on incidence chromatic number of subquartic graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {174--181},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0072-2},
doi = {10.1007/s10878-016-0072-2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GregorLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Gu17,
author = {Xiaofeng Gu},
title = {Packing spanning trees and spanning 2-connected k-edge-connected essentially
(2k-1)-edge-connected subgraphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {924--933},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0014-z},
doi = {10.1007/s10878-016-0014-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Gu17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuLG17,
author = {Manzhan Gu and
Xiwen Lu and
Jinwei Gu},
title = {An asymptotically optimal algorithm for large-scale mixed job shop
scheduling to minimize the makespan},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {473--495},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9974-7},
doi = {10.1007/s10878-015-9974-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuLG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Haddadi17,
author = {Salim Haddadi},
title = {Benders decomposition for set covering problems - Almost satisfying
the consecutive ones property},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {60--80},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9935-1},
doi = {10.1007/s10878-015-9935-1},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Haddadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HassinRS17,
author = {Refael Hassin and
R. Ravi and
F. Sibel Salman},
title = {Multiple facility location on a network with linear reliability order
of edges},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {931--955},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0121-5},
doi = {10.1007/s10878-017-0121-5},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HassinRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeL17,
author = {Dan He and
Wensong Lin},
title = {On (s, t)-relaxed strong edge-coloring of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {609--625},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9983-6},
doi = {10.1007/s10878-015-9983-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeL17a,
author = {Cheng He and
Joseph Y.{-}T. Leung},
title = {Two-agent scheduling of time-dependent jobs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {362--377},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9994-y},
doi = {10.1007/s10878-016-9994-y},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeLW17,
author = {Hongyu He and
Mengqi Liu and
Ji{-}Bo Wang},
title = {Resource constrained scheduling with general truncated job-dependent
learning effect},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {626--644},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9984-5},
doi = {10.1007/s10878-015-9984-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HenningL17,
author = {Michael A. Henning and
Nicolas Lichiardopol},
title = {Distance domination in graphs with given minimum and maximum degree},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {545--553},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0091-z},
doi = {10.1007/s10878-016-0091-z},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HenningL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HesslerD17,
author = {Corinna He{\ss}ler and
Kaouthar Deghdak},
title = {Discrete parallel machine makespan ScheLoc problem},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1159--1186},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0138-9},
doi = {10.1007/s10878-017-0138-9},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HesslerD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HolzhauserKT17,
author = {Michael Holzhauser and
Sven O. Krumke and
Clemens Thielen},
title = {Maximum flows in generalized processing networks},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1226--1256},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0031-y},
doi = {10.1007/s10878-016-0031-y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HolzhauserKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HongLKCYT17,
author = {Yi Hong and
Deying Li and
Donghyun Kim and
Wenping Chen and
Jiguo Yu and
Alade O. Tokuta},
title = {Maximizing target-temporal coverage of mission-driven camera sensor
networks},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {279--301},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0071-3},
doi = {10.1007/s10878-016-0071-3},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HongLKCYT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HradovichKZ17,
author = {Mikita Hradovich and
Adam Kasperski and
Pawel Zielinski},
title = {Recoverable robust spanning tree problem under interval uncertainty
representations},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {554--573},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0089-6},
doi = {10.1007/s10878-016-0089-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HradovichKZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuCLM17,
author = {Xiaolan Hu and
Yaojun Chen and
Rong Luo and
Zhengke Miao},
title = {Neighbor sum distinguishing index of 2-degenerate graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {798--809},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0110-8},
doi = {10.1007/s10878-017-0110-8},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuCLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuJZZZ17,
author = {Jueliang Hu and
Yiwei Jiang and
Ping Zhou and
An Zhang and
Qinghui Zhang},
title = {Total completion time minimization in online hierarchical scheduling
of unit-size jobs},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {866--881},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0011-2},
doi = {10.1007/s10878-016-0011-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuJZZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangLW17,
author = {Fei Huang and
Xueliang Li and
Shujing Wang},
title = {Upper bounds of proper connection number of graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {165--173},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0056-2},
doi = {10.1007/s10878-016-0056-2},
timestamp = {Mon, 04 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuangLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuoWW17,
author = {Jingjing Huo and
Yiqiao Wang and
Weifan Wang},
title = {Neighbor-sum-distinguishing edge choosability of subcubic graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {742--759},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0104-y},
doi = {10.1007/s10878-016-0104-y},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuoWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Hurlbert17,
author = {Glenn Hurlbert},
title = {The Weight Function Lemma for graph pebbling},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {343--361},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9993-z},
doi = {10.1007/s10878-016-9993-z},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Hurlbert17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JieGF17,
author = {Yingmo Jie and
Cheng Guo and
Zhangjie Fu},
title = {Newly deterministic construction of compressed sensing matrices via
singular linear spaces over finite fields},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {245--256},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0068-y},
doi = {10.1007/s10878-016-0068-y},
timestamp = {Tue, 10 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JieGF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JinSYZ17,
author = {Zemin Jin and
Yuefang Sun and
Sherry H. F. Yan and
Yuping Zang},
title = {Extremal coloring for the anti-Ramsey problem of matchings in complete
graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1012--1028},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0125-1},
doi = {10.1007/s10878-017-0125-1},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JinSYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JinZ17,
author = {Zemin Jin and
Yuping Zang},
title = {Anti-Ramsey coloring for matchings in complete bipartite graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {1--12},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9926-2},
doi = {10.1007/s10878-015-9926-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JinZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JohnsenKS17,
author = {Aleck C. Johnsen and
Ming{-}Yang Kao and
Shinnosuke Seki},
title = {A manually-checkable proof for the NP-hardness of 11-color pattern
self-assembly tileset synthesis},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {496--529},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9975-6},
doi = {10.1007/s10878-015-9975-6},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JohnsenKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KangKP17,
author = {Bumtle Kang and
Suh{-}Ryung Kim and
Ji Yeon Park},
title = {On consecutive edge magic total labelings of connected bipartite graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {13--27},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9928-0},
doi = {10.1007/s10878-015-9928-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KangKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KangLDS17,
author = {Liying Kang and
Shan Li and
Yanxia Dong and
Erfang Shan},
title = {Matching and domination numbers in r-uniform hypergraphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {656--659},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0098-5},
doi = {10.1007/s10878-016-0098-5},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KangLDS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Karthick17,
author = {T. Karthick},
title = {Independent sets in some classes of S\({}_{\mbox{i, j, k}}\)-free
graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {612--630},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0096-7},
doi = {10.1007/s10878-016-0096-7},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Karthick17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KfouryM17,
author = {Assaf J. Kfoury and
Saber Mirzaei},
title = {Efficient reassembling of graphs, part 1: the linear case},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1057--1089},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0024-x},
doi = {10.1007/s10878-016-0024-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KfouryM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KimRS17,
author = {Byeong Moon Kim and
Yoomi Rho and
Byung Chul Song},
title = {Lambda number for the direct product of some family of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1257--1265},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0032-x},
doi = {10.1007/s10878-016-0032-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KimRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KouiderZ17,
author = {Mekkia Kouider and
Mohamed Zamime},
title = {On the b-coloring of tight graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {202--214},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9946-y},
doi = {10.1007/s10878-015-9946-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KouiderZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kozik17,
author = {Andrzej Kozik},
title = {Handling precedence constraints in scheduling problems by the sequence
pair representation},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {445--472},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9973-8},
doi = {10.1007/s10878-015-9973-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kozik17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KuhnleLST17,
author = {Alan Kuhnle and
Xiang Li and
J. David Smith and
My T. Thai},
title = {Online set multicover algorithms for dynamic {D2D} communications},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1237--1264},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0144-y},
doi = {10.1007/s10878-017-0144-y},
timestamp = {Mon, 25 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KuhnleLST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLSS17,
author = {Shasha Li and
Wei Li and
Yongtang Shi and
Haina Sun},
title = {On minimally 2-connected graphs with generalized connectivity {\(\kappa\)}\({}_{\mbox{3}}\)
= 2},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {141--164},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0075-z},
doi = {10.1007/s10878-016-0075-z},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiLSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLW17,
author = {Shuchao Li and
Lin Liu and
Yueyu Wu},
title = {On the coefficients of the independence polynomial of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1324--1342},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0037-5},
doi = {10.1007/s10878-016-0037-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiQWY17,
author = {Tong Li and
Cunquan Qu and
Guanghui Wang and
Xiaowei Yu},
title = {Neighbor product distinguishing total colorings},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {237--253},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9952-0},
doi = {10.1007/s10878-015-9952-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiQWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiS17,
author = {Daniel Li Li and
Erfang Shan},
title = {Cost sharing on prices for games on graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {676--688},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0099-4},
doi = {10.1007/s10878-016-0099-4},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiW17,
author = {Xueliang Li and
Di Wu},
title = {The (vertex-)monochromatic index of a graph},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1443--1453},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0048-2},
doi = {10.1007/s10878-016-0048-2},
timestamp = {Thu, 16 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangSZ17,
author = {Zuosong Liang and
Erfang Shan and
Yuzhong Zhang},
title = {A linear-time algorithm for clique-coloring problem in circular-arc
graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {147--155},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9941-3},
doi = {10.1007/s10878-015-9941-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangWM17,
author = {Xiaodong Liang and
Rui Wang and
Jixiang Meng},
title = {Code for polyomino and computer search of isospectral polyominoes},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {254--264},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9953-z},
doi = {10.1007/s10878-015-9953-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangWM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinSW17,
author = {Huiqiu Lin and
Jinlong Shu and
Baoyindureng Wu},
title = {Nordhaus-Gaddum type result for the matching number of a graph},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {916--930},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0120-6},
doi = {10.1007/s10878-017-0120-6},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinW17,
author = {Chen{-}Wan Lin and
Bang Ye Wu},
title = {On the minimum routing cost clustered tree problem},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1106--1121},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0026-8},
doi = {10.1007/s10878-016-0026-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuHD17,
author = {Chunyan Liu and
Hejiao Huang and
Hongwei Du},
title = {Optimal RSUs deployment with delay bound along highways in {VANET}},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1168--1182},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0029-5},
doi = {10.1007/s10878-016-0029-5},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuHD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuHDJ17,
author = {Chunyan Liu and
Hejiao Huang and
Hongwei Du and
Xiaohua Jia},
title = {Optimal RSUs placement with delay bounded message dissemination in
vehicular networks},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1276--1299},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0034-8},
doi = {10.1007/s10878-016-0034-8},
timestamp = {Wed, 30 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuHDJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL17,
author = {Yan Liu and
Weiwei Liu},
title = {Fractional matching preclusion of graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {522--533},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0077-x},
doi = {10.1007/s10878-016-0077-x},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuZ17,
author = {Lingfa Lu and
Liqi Zhang},
title = {Single-machine scheduling with production and rejection costs to minimize
the maximum earliness},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {331--342},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9992-0},
doi = {10.1007/s10878-016-9992-0},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuZW17,
author = {Zaixin Lu and
Zhao Zhang and
Weili Wu},
title = {Solution of Bharathi-Kempe-Salek conjecture for influence maximization
on arborescence},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {803--808},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0006-z},
doi = {10.1007/s10878-016-0006-z},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuZW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LyleP17,
author = {Jeremy Lyle and
Sean Patterson},
title = {A note on the annihilation number and 2-domination number of a tree},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {968--976},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0019-7},
doi = {10.1007/s10878-016-0019-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LyleP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaL17,
author = {Yingbin Ma and
Zaiping Lu},
title = {Rainbow connection numbers of Cayley graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {182--193},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0052-6},
doi = {10.1007/s10878-016-0052-6},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaY17,
author = {Ran Ma and
Jinjiang Yuan},
title = {Online scheduling to minimize the total weighted completion time plus
the rejection cost},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {483--503},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0083-z},
doi = {10.1007/s10878-016-0083-z},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Mak-Hau17,
author = {Vicky H. Mak{-}Hau},
title = {On the kidney exchange problem: cardinality constrained cycle and
chain problems on directed graphs: a survey of integer programming
approaches},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {35--59},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9932-4},
doi = {10.1007/s10878-015-9932-4},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Mak-Hau17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Malyshev17,
author = {Dmitriy S. Malyshev},
title = {Polynomial-time approximation algorithms for the coloring problem
in some cases},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {809--813},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0008-x},
doi = {10.1007/s10878-016-0008-x},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Malyshev17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MandalP17,
author = {Nibedita Mandal and
Pratima Panigrahi},
title = {On irreducible no-hole L(2, 1)-coloring of subdivision of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1421--1442},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0047-3},
doi = {10.1007/s10878-016-0047-3},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MandalP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MeloMPS17,
author = {Lucas P. Melo and
Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa and
Rafael Crivellari Saliba Schouery},
title = {Approximation algorithms for k-level stochastic facility location
problems},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {266--278},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0064-2},
doi = {10.1007/s10878-016-0064-2},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MeloMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MiaoCTL17,
author = {Dongjing Miao and
Zhipeng Cai and
Weitian Tong and
Jianzhong Li},
title = {Approximation for vertex cover in {\(\beta\)}-conflict graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1052--1059},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0127-z},
doi = {10.1007/s10878-017-0127-z},
timestamp = {Sat, 29 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MiaoCTL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MorM17,
author = {Baruch Mor and
Gur Mosheiov},
title = {A two-agent single machine scheduling problem with due-window assignment
and a common flow-allowance},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1454--1468},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0049-1},
doi = {10.1007/s10878-016-0049-1},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MorM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NiuML17,
author = {Dongxiao Niu and
Tiannan Ma and
Bingyi Liu},
title = {Power load forecasting by wavelet least squares support vector machine
with improved fruit fly optimization algorithm},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1122--1143},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0027-7},
doi = {10.1007/s10878-016-0027-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NiuML17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NongFF17,
author = {Qingqin Nong and
G. Q. Fan and
Qizhi Fang},
title = {A coordination mechanism for a scheduling game with parallel-batching
machines},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {567--579},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9980-9},
doi = {10.1007/s10878-015-9980-9},
timestamp = {Wed, 28 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NongFF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Pausinger17,
author = {Florian Pausinger},
title = {Bounds for the traveling salesman paths of two-dimensional modular
lattices},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1378--1394},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0043-7},
doi = {10.1007/s10878-016-0043-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Pausinger17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PferschyS17,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {Approximation of knapsack problems with conflict and forcing graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1300--1323},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0035-7},
doi = {10.1007/s10878-016-0035-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PferschyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PravasV17,
author = {Karuvachery Pravas and
Ambat Vijayakumar},
title = {Convex median and anti-median at prescribed distance},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1021--1029},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0022-z},
doi = {10.1007/s10878-016-0022-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PravasV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/QinX17,
author = {Lan Qin and
Yinfeng Xu},
title = {Fibonacci helps to evacuate from a convex region in a grid network},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {398--413},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9998-7},
doi = {10.1007/s10878-016-9998-7},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/QinX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RanSZ17,
author = {Yingli Ran and
Yishuo Shi and
Zhao Zhang},
title = {Local ratio method on partial set multi-cover},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {302--313},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0066-0},
doi = {10.1007/s10878-016-0066-0},
timestamp = {Wed, 13 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RanSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RanZDZ17,
author = {Yingli Ran and
Zhao Zhang and
Hongwei Du and
Yuqing Zhu},
title = {Approximation algorithm for partial positive influence problem in
social network},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {791--802},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0005-0},
doi = {10.1007/s10878-016-0005-0},
timestamp = {Fri, 04 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RanZDZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RoayaeiR17,
author = {Mehdy Roayaei and
Mohammadreza Razzazi},
title = {Augmenting weighted graphs to establish directed point-to-point connectivity},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1030--1056},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0023-y},
doi = {10.1007/s10878-016-0023-y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RoayaeiR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SS17,
author = {Neethi K. S. and
Sanjeev Saxena},
title = {Maximal independent sets in a generalisation of caterpillar graph},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {326--332},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9960-0},
doi = {10.1007/s10878-015-9960-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SS17a,
author = {Neethi K. S. and
Sanjeev Saxena},
title = {Maximum cardinality neighbourly sets in quadrilateral free graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {422--444},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9972-9},
doi = {10.1007/s10878-015-9972-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SS17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SalmeronACGHG17,
author = {Jose M. G. Salmer{\'{o}}n and
Guillermo Aparicio and
Leocadio G. Casado and
Inmaculada Garc{\'{\i}}a and
Eligius M. T. Hendrix and
Bogl{\'{a}}rka G.{-}T{\'{o}}th},
title = {Generating a smallest binary tree by proper selection of the longest
edges to bisect in a unit simplex refinement},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {389--402},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9970-y},
doi = {10.1007/s10878-015-9970-y},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SalmeronACGHG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SantosADX17,
author = {Rafael F. Santos and
Alessandro Andrioni and
Andr{\'{e}} C. Drummond and
Eduardo C. Xavier},
title = {Multicolour paths in graphs: NP-hardness, algorithms, and applications
on routing in {WDM} networks},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {742--778},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0003-2},
doi = {10.1007/s10878-016-0003-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SantosADX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SarkarA17,
author = {Ushnish Sarkar and
Avishek Adhikari},
title = {A new graph parameter and a construction of larger graph without increasing
radio k-chromatic number},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1365--1377},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0041-9},
doi = {10.1007/s10878-016-0041-9},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SarkarA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Schmidt17,
author = {G{\"{u}}nter Schmidt},
title = {Competitive analysis of bi-directional non-preemptive conversion},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1096--1113},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0131-3},
doi = {10.1007/s10878-017-0131-3},
timestamp = {Tue, 07 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Schmidt17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShaoZJWH17,
author = {Zehui Shao and
Xiaosong Zhang and
Huiqin Jiang and
Bo Wang and
Juanjuan He},
title = {On the L(2, 1)-labeling conjecture for brick product graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {706--724},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0101-1},
doi = {10.1007/s10878-016-0101-1},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ShaoZJWH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiWYZ17,
author = {Yongtang Shi and
Meiqin Wei and
Jun Yue and
Yan Zhao},
title = {Coupon coloring of some special graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {156--164},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9942-2},
doi = {10.1007/s10878-015-9942-2},
timestamp = {Wed, 08 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShiWYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiriS17,
author = {Davood Shiri and
F. Sibel Salman},
title = {On the online multi-agent {O-D} k-Canadian Traveler Problem},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {453--461},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0079-8},
doi = {10.1007/s10878-016-0079-8},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShiriS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShuWW17,
author = {Qiaojun Shu and
Weifan Wang and
Yiqiao Wang},
title = {A new sufficient condition for a tree {T} to have the (2, 1)-total
number {\(\Delta\)} + 1},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1011--1020},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0021-0},
doi = {10.1007/s10878-016-0021-0},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShuWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SiddiquiAF17,
author = {Muhammad Kamran Siddiqui and
Deeba Afzal and
Muhammad Ramzan Faisal},
title = {Total edge irregularity strength of accordion graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {534--544},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0090-0},
doi = {10.1007/s10878-016-0090-0},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SiddiquiAF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Skowronek-Kaziow17,
author = {Joanna Skowronek{-}Kazi{\'{o}}w},
title = {Graphs with multiplicative vertex-coloring 2-edge-weightings},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {333--338},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9966-7},
doi = {10.1007/s10878-015-9966-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Skowronek-Kaziow17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Sohrabi-Haghighat17,
author = {Mehdi Sohrabi Haghighat and
Mohammadreza Rostami},
title = {The minimum value of geometric-arithmetic index of graphs with minimum
degree 2},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {218--232},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0062-4},
doi = {10.1007/s10878-016-0062-4},
timestamp = {Sun, 22 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Sohrabi-Haghighat17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SongGH17,
author = {Liang Song and
Hao Gu and
Hejiao Huang},
title = {A lower bound for the adaptive two-echelon capacitated vehicle routing
problem},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1145--1167},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0028-6},
doi = {10.1007/s10878-016-0028-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SongGH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SongX17,
author = {Hong Jie Song and
Chang Qing Xu},
title = {Neighbor sum distinguishing total coloring of planar graphs without
4-cycles},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1147--1158},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0137-x},
doi = {10.1007/s10878-017-0137-x},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SongX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunCW17,
author = {Lin Sun and
Xiaohan Cheng and
Jianliang Wu},
title = {The adjacent vertex distinguishing total coloring of planar graphs
without adjacent 4-cycles},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {779--790},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0004-1},
doi = {10.1007/s10878-016-0004-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SunCW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunL17,
author = {Yuefang Sun and
Xueliang Li},
title = {On the difference of two generalized connectivities of a graph},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {283--291},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9956-9},
doi = {10.1007/s10878-015-9956-9},
timestamp = {Sat, 11 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SunL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunW17,
author = {Lin Sun and
Jian{-}Liang Wu},
title = {On (p, 1)-total labelling of planar graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {317--325},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9958-7},
doi = {10.1007/s10878-015-9958-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SunW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunZZ17,
author = {Xiaoming Sun and
Jia Zhang and
Jialin Zhang},
title = {Near optimal algorithms for online weighted bipartite matching in
adversary model},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {689--705},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0100-2},
doi = {10.1007/s10878-016-0100-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SunZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TangPZZ17,
author = {Qingsong Tang and
Yuejian Peng and
Xiangde Zhang and
Cheng Zhao},
title = {On Motzkin-Straus type results for non-uniform hypergraphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {504--521},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0084-y},
doi = {10.1007/s10878-016-0084-y},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TangPZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TangWHZ17,
author = {Zixing Tang and
Baoyindureng Wu and
Lin Hu and
Manouchehr Zaker},
title = {More bounds for the Grundy number of graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {580--589},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9981-8},
doi = {10.1007/s10878-015-9981-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TangWHZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TangZ17,
author = {Yunfang Tang and
Xuding Zhu},
title = {Total weight choosability of Mycielski graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {165--182},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9943-1},
doi = {10.1007/s10878-015-9943-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TangZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TianLYL17,
author = {Ye Tian and
Ke Li and
Wei Yang and
Zhiyong Li},
title = {A new effective branch-and-bound algorithm to the high order {MIMO}
detection problem},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1395--1410},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0045-5},
doi = {10.1007/s10878-016-0045-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/TianLYL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TongY17,
author = {Li{-}Da Tong and
Hao{-}Yu Yang},
title = {Hamiltonian numbers in oriented graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1210--1217},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0141-1},
doi = {10.1007/s10878-017-0141-1},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TongY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TranAH17,
author = {Tien Tran and
Min Kyung An and
Dung T. Huynh},
title = {Establishing symmetric connectivity in directional wireless sensor
networks equipped with 2{\(\pi\)}/3 antennas},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1029--1051},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0126-0},
doi = {10.1007/s10878-017-0126-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TranAH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TuWYC17,
author = {Jianhua Tu and
Lidong Wu and
Jing Yuan and
Lei Cui},
title = {On the vertex cover P\({}_{\mbox{3}}\) problem parameterized by treewidth},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {414--425},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9999-6},
doi = {10.1007/s10878-016-9999-6},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TuWYC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wang17,
author = {Tao Wang},
title = {Total coloring of 1-toroidal graphs with maximum degree at least 11
and no adjacent triangles},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {1090--1105},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0025-9},
doi = {10.1007/s10878-016-0025-9},
timestamp = {Sun, 17 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wang17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangDZZ17,
author = {Limin Wang and
Wenxue Du and
Zhao Zhang and
Xiaoyan Zhang},
title = {A {PTAS} for minimum weighted connected vertex cover {\textdollar}{\textdollar}P{\_}3{\textdollar}{\textdollar}
{P} 3 problem in 3-dimensional wireless sensor networks},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {106--122},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9937-z},
doi = {10.1007/s10878-015-9937-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangDZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLGZWG17,
author = {Huijuan Wang and
Bin Liu and
Yan Gu and
Xin Zhang and
Weili Wu and
Hongwei Gao},
title = {Total coloring of planar graphs without adjacent short cycles},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {265--274},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9954-y},
doi = {10.1007/s10878-015-9954-y},
timestamp = {Thu, 26 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangLGZWG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLWTWG17,
author = {Huijuan Wang and
Bin Liu and
Xiaoli Wang and
Guangmo Tong and
Weili Wu and
Hongwei Gao},
title = {Total coloring of planar graphs without adjacent chordal 6-cycles},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {257--265},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0063-3},
doi = {10.1007/s10878-016-0063-3},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangLWTWG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangN17,
author = {Zhenbo Wang and
Kameng Nip},
title = {Bin packing under linear constraints},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1198--1209},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0140-2},
doi = {10.1007/s10878-017-0140-2},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangW17,
author = {Xiao Wang and
Baoyindureng Wu},
title = {Upper bounds on the chromatic number of triangle-free graphs with
a forbidden subtree},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {28--34},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9929-z},
doi = {10.1007/s10878-015-9929-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Woryna17,
author = {Adam Woryna},
title = {The solution of a generalized secretary problem via analytic expressions},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1469--1491},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0050-8},
doi = {10.1007/s10878-016-0050-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Woryna17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Worz17,
author = {Sascha W{\"{o}}rz},
title = {On global integer extrema of real-valued box-constrained multivariate
quadratic functions},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {964--986},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0123-3},
doi = {10.1007/s10878-017-0123-3},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Worz17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuC17,
author = {Bang Ye Wu and
Li{-}Hsuan Chen},
title = {An improved parameterized algorithm for the p-cluster vertex deletion
problem},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {373--388},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9969-4},
doi = {10.1007/s10878-015-9969-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XiaoN17,
author = {Mingyu Xiao and
Hiroshi Nagamochi},
title = {A refined algorithm for maximum independent set in degree-4 graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {830--873},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0115-3},
doi = {10.1007/s10878-017-0115-3},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XiaoN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XingongY17,
author = {Zhang Xingong and
Wang Yong},
title = {Two-agent scheduling problems on a single-machine to minimize the
total weighted late work},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {945--955},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0017-9},
doi = {10.1007/s10878-016-0017-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XingongY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XiongZC17,
author = {Xinsheng Xiong and
Yong Zhao and
Yang Chen},
title = {A computational approach to the multi-period many-to-one matching
with ties},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {183--201},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9944-0},
doi = {10.1007/s10878-015-9944-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XiongZC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Yang17,
author = {Boting Yang},
title = {Lower bounds for positive semidefinite zero forcing and their applications},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {81--105},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9936-0},
doi = {10.1007/s10878-015-9936-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Yang17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangAW17,
author = {Wei Yang and
Xinhui An and
Baoyindureng Wu},
title = {Paired-domination number of claw-free odd-regular graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1266--1275},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0033-9},
doi = {10.1007/s10878-016-0033-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangAW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangG17,
author = {Yongjie Yang and
Jiong Guo},
title = {Possible winner problems on partial tournaments: a parameterized study},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {882--896},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0012-1},
doi = {10.1007/s10878-016-0012-1},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YaoYWX17,
author = {Jingjing Yao and
Xiaowei Yu and
Guanghui Wang and
Changqing Xu},
title = {Neighbor sum distinguishing total coloring of 2-degenerate graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {64--70},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0053-5},
doi = {10.1007/s10878-016-0053-5},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YaoYWX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YinGZL17,
author = {Dan Yin and
Hong Gao and
Zhaonian Zou and
Jianzhong Li},
title = {Minimized-cost cube query on heterogeneous information networks},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {339--364},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9967-6},
doi = {10.1007/s10878-015-9967-6},
timestamp = {Mon, 31 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YinGZL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YuMX17,
author = {Guosong Yu and
Yanling Mao and
Jiaoliao Xiao},
title = {A new upper bound for the online square packing problem in a strip},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1411--1420},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0046-4},
doi = {10.1007/s10878-016-0046-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YuMX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Yuan17,
author = {Jinjiang Yuan},
title = {Multi-agent scheduling on a single machine with a fixed number of
competing agents to minimize the weighted sum of number of tardy jobs
and makespans},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {433--440},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0078-9},
doi = {10.1007/s10878-016-0078-9},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Yuan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zaker17,
author = {Manouchehr Zaker},
title = {A note on orientation and chromatic number of graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {605--611},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0094-9},
doi = {10.1007/s10878-016-0094-9},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Zaker17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZakouniLK17,
author = {Amiyne Zakouni and
Jiawei Luo and
Fouad Kharroubi},
title = {Genetic algorithm and tabu search algorithm for solving the static
manycast {RWA} problem in optical networks},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {726--741},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0002-3},
doi = {10.1007/s10878-016-0002-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZakouniLK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zhang17,
author = {Xin Zhang},
title = {Total coloring of outer-1-planar graphs with near-independent crossings},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {661--675},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0093-x},
doi = {10.1007/s10878-016-0093-x},
timestamp = {Mon, 10 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Zhang17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zhang17a,
author = {Xia Zhang},
title = {Disconnected g\({}_{\mbox{c}}\) -critical graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {771--780},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0108-7},
doi = {10.1007/s10878-016-0108-7},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Zhang17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangCW17,
author = {Miao Zhang and
Min Chen and
Yiqiao Wang},
title = {A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {847--865},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0010-3},
doi = {10.1007/s10878-016-0010-3},
timestamp = {Thu, 09 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangCW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangHLT17,
author = {Minghui Zhang and
Xin Han and
Yan Lan and
Hing{-}Fung Ting},
title = {Online bin packing problem with buffer and bounded size revisited},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {530--542},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9976-5},
doi = {10.1007/s10878-015-9976-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangHLT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangL17,
author = {Zhen{-}Kun Zhang and
Hong{-}Jian Lai},
title = {Characterizations of k-cutwidth critical trees},
journal = {J. Comb. Optim.},
volume = {34},
number = {1},
pages = {233--244},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0061-5},
doi = {10.1007/s10878-016-0061-5},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangRZ17,
author = {Yubai Zhang and
Yingli Ran and
Zhao Zhang},
title = {A simple approximation algorithm for minimum weight partial connected
set cover},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {956--963},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0122-4},
doi = {10.1007/s10878-017-0122-4},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangRZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangSKD17,
author = {Guang Zhang and
Erfang Shan and
Liying Kang and
Yanxia Dong},
title = {Two efficient values of cooperative games with graph structure based
on {\(\tau\)}-values},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {462--482},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0081-1},
doi = {10.1007/s10878-016-0081-1},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangSKD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangXWD17,
author = {Zhao Zhang and
Wen Xu and
Weili Wu and
Ding{-}Zhu Du},
title = {A novel approach for detecting multiple rumor sources in networks
with partial observations},
journal = {J. Comb. Optim.},
volume = {33},
number = {1},
pages = {132--146},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9939-x},
doi = {10.1007/s10878-015-9939-x},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangXWD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoH17,
author = {Taiyin Zhao and
Guangmin Hu},
title = {A note on (s, t)-relaxed L(2, 1)-labeling of graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {378--382},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-9996-9},
doi = {10.1007/s10878-016-9996-9},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhongPJ17,
author = {Xueling Zhong and
Zhangming Pan and
Dakui Jiang},
title = {Scheduling with release times and rejection on two parallel machines},
journal = {J. Comb. Optim.},
volume = {33},
number = {3},
pages = {934--944},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0016-x},
doi = {10.1007/s10878-016-0016-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhongPJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuCML17,
author = {Haiyang Zhu and
Sheng Chen and
Lianying Miao and
Xinzhong Lv},
title = {On list r-hued coloring of planar graphs},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {874--890},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0118-0},
doi = {10.1007/s10878-017-0118-0},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuCML17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZioutasCNP17,
author = {George Zioutas and
Christos Chatzinakos and
Tri{-}Dung Nguyen and
Leonidas S. Pitsoulis},
title = {Optimization techniques for multivariate least trimmed absolute deviation
estimation},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {781--797},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0109-1},
doi = {10.1007/s10878-017-0109-1},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZioutasCNP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AbshoffKMHP16,
author = {Sebastian Abshoff and
Peter Kling and
Christine Markarian and
Friedhelm Meyer auf der Heide and
Peter Pietrzyk},
title = {Towards the price of leasing online},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1197--1216},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9915-5},
doi = {10.1007/s10878-015-9915-5},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AbshoffKMHP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AgostonBM16,
author = {Kolos Csaba {\'{A}}goston and
P{\'{e}}ter Bir{\'{o}} and
Iain McBride},
title = {Integer programming methods for special college admissions problems},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1371--1399},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0085-x},
doi = {10.1007/s10878-016-0085-x},
timestamp = {Fri, 09 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AgostonBM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AgraRS16,
author = {Agostinho Agra and
Cristina Requejo and
Eul{\'{a}}lia Santos},
title = {Implicit cover inequalities},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1111--1129},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9812-3},
doi = {10.1007/s10878-014-9812-3},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AgraRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AhangarASV16,
author = {Hossein Abdollahzadeh Ahangar and
Leila Asgharsharghi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed mixed Roman domination numbers in graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {299--317},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9879-5},
doi = {10.1007/s10878-015-9879-5},
timestamp = {Wed, 20 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AhangarASV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AhangarASVZ16,
author = {Hossein Abdollahzadeh Ahangar and
Jafar Amjadi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann and
Yancai Zhao},
title = {Signed Roman edge domination numbers in graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {333--346},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9747-8},
doi = {10.1007/s10878-014-9747-8},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AhangarASVZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AnX16,
author = {Mingqiang An and
Liming Xiong},
title = {Extremal polyomino chains with respect to general Randi{\'{c}}
index},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {635--647},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9781-6},
doi = {10.1007/s10878-014-9781-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AnX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AnariFGS16,
author = {Nima Anari and
MohammadAmin Fazli and
Mohammad Ghodsi and
MohammadAli Safari},
title = {Euclidean movement minimization},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {354--367},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9842-5},
doi = {10.1007/s10878-015-9842-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AnariFGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AnthonyC16,
author = {Barbara M. Anthony and
Christine Chung},
title = {Serve or skip: the power of rejection in online bottleneck matching},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1232--1253},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9948-9},
doi = {10.1007/s10878-015-9948-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AnthonyC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AokiHHIKZ16,
author = {Yusuke Aoki and
Bjarni V. Halld{\'{o}}rsson and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Takehiro Ito and
Christian Konrad and
Xiao Zhou},
title = {The minimum vulnerability problem on specific graph classes},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1288--1304},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9950-2},
doi = {10.1007/s10878-015-9950-2},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AokiHHIKZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AuroraSM16,
author = {Pawan Aurora and
Sumit Singh and
Shashank K. Mehta},
title = {Partial degree bounded edge packing problem for graphs and k-uniform
hypergraphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {159--173},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9868-8},
doi = {10.1007/s10878-015-9868-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AuroraSM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AvisM16,
author = {David Avis and
Conor Meagher},
title = {On the directed cut cone and polytope},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1685--1708},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9863-0},
doi = {10.1007/s10878-015-9863-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AvisM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Azizi-Sultan16,
author = {Ahmad{-}Saher Azizi{-}Sultan},
title = {Pseudo-automatic beam orientations in multi-criteria intensity-modulated
radiation therapy},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1746--1759},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9867-9},
doi = {10.1007/s10878-015-9867-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Azizi-Sultan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarbosaS16,
author = {Rommel M. Barbosa and
Peter Slater},
title = {On the efficiency index of a graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1134--1141},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9814-1},
doi = {10.1007/s10878-014-9814-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarbosaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarketauPS16,
author = {Maksim Barketau and
Erwin Pesch and
Yakov M. Shafransky},
title = {Scheduling dedicated jobs with variative processing times},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {774--785},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9787-0},
doi = {10.1007/s10878-014-9787-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarketauPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BastosOPSMP16,
author = {Lucas de O. Bastos and
Luiz Satoru Ochi and
F{\'{a}}bio Protti and
Anand Subramanian and
Ivan C{\'{e}}sar Martins and
Rian Gabriel S. Pinheiro},
title = {Efficient algorithms for cluster editing},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {347--371},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9756-7},
doi = {10.1007/s10878-014-9756-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BastosOPSMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ben-AmeurB16,
author = {Walid Ben{-}Ameur and
Mohamed Didi Biha},
title = {Extended cuts},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1034--1044},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9808-z},
doi = {10.1007/s10878-014-9808-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeregDFLPU16,
author = {Sergey Bereg and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
David Flores{-}Pe{\~{n}}aloza and
Stefan Langerman and
Pablo P{\'{e}}rez{-}Lantero and
Jorge Urrutia},
title = {Optimizing some constructions with bars: new geometric knapsack problems},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1160--1173},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9816-z},
doi = {10.1007/s10878-014-9816-z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BeregDFLPU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BiLGL16,
author = {Ran Bi and
Jianzhong Li and
Hong Gao and
Yingshu Li},
title = {({\(\alpha\)}, {\(\tau\)}) -Monitoring for event detection in wireless
sensor networks},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {985--1001},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9837-2},
doi = {10.1007/s10878-015-9837-2},
timestamp = {Mon, 31 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiLGL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BiloP16,
author = {Vittorio Bil{\`{o}} and
Mauro Paladini},
title = {On the performance of mildly greedy players in cut games},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1036--1051},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9898-2},
doi = {10.1007/s10878-015-9898-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiloP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bluskov16,
author = {Iliya Bluskov},
title = {Problem dependent optimization {(PDO)}},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1335--1344},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9826-x},
doi = {10.1007/s10878-014-9826-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bluskov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BolandKK16,
author = {Natashia Boland and
Thomas Kalinowski and
Simranjit Kaur},
title = {Scheduling arc shut downs in a network to maximize flow over time
with a bounded number of jobs per time period},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {885--905},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9910-x},
doi = {10.1007/s10878-015-9910-x},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BolandKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bonis16,
author = {Annalisa De Bonis},
title = {Constraining the number of positive responses in adaptive, non-adaptive,
and two-stage group testing},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1254--1287},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9949-8},
doi = {10.1007/s10878-015-9949-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bonis16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BorradaileKWZ16,
author = {Glencora Borradaile and
W. Sean Kennedy and
Gordon T. Wilfong and
Lisa Zhang},
title = {Improving robustness of next-hop routing},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1206--1220},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9818-x},
doi = {10.1007/s10878-014-9818-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BorradaileKWZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BuL16,
author = {Yuehua Bu and
Xia Lv},
title = {2-Distance coloring of a planar graph without 3, 4, 7-cycles},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {244--259},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9873-y},
doi = {10.1007/s10878-015-9873-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BuL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BurgyG16,
author = {Reinhard B{\"{u}}rgy and
Heinz Gr{\"{o}}flin},
title = {The blocking job shop with rail-bound transportation},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {152--181},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9723-3},
doi = {10.1007/s10878-014-9723-3},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BurgyG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ButtnerK16,
author = {Sabine B{\"{u}}ttner and
Sven O. Krumke},
title = {The Canadian Tour Operator Problem on paths: tight bounds and resource
augmentation},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {842--854},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9905-7},
doi = {10.1007/s10878-015-9905-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ButtnerK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiFY16,
author = {Jiansheng Cai and
Binlu Feng and
Guiying Yan},
title = {Acyclic coloring of graphs with some girth restriction},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1399--1404},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9829-2},
doi = {10.1007/s10878-015-9829-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiFY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiLZ16,
author = {Qingqiong Cai and
Xueliang Li and
Yan Zhao},
title = {The 3-rainbow index and connected dominating sets},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1142--1159},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9815-0},
doi = {10.1007/s10878-014-9815-0},
timestamp = {Wed, 08 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiLZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiWB16,
author = {Zhipeng Cai and
Chaokun Wang and
Anu G. Bourgeois},
title = {Preface: Special issue on computing and combinatorics conference and
wireless algorithms, systems, and applications conference},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {983--984},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9989-0},
doi = {10.1007/s10878-015-9989-0},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiWB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiWS16,
author = {Hua Cai and
Jianliang Wu and
Lin Sun},
title = {Total coloring of planar graphs without short cycles},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1650--1664},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9859-9},
doi = {10.1007/s10878-015-9859-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiWS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Calinescu16,
author = {Gruia C{\u{a}}linescu},
title = {1.61-approximation for min-power strong connectivity with two power
levels},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {239--259},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9738-9},
doi = {10.1007/s10878-014-9738-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Calinescu16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CalinescuGMTXZ16,
author = {Gruia C{\u{a}}linescu and
Benjamin Grimmer and
Satyajayant Misra and
Sutep Tongngam and
Guoliang Xue and
Weiyi Zhang},
title = {Improved approximation algorithms for single-tiered relay placement},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1280--1297},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9823-0},
doi = {10.1007/s10878-014-9823-0},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CalinescuGMTXZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaoW16,
author = {Qian Cao and
Guohua Wan},
title = {Semi-online scheduling with combined information on two identical
machines in parallel},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {686--695},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9778-1},
doi = {10.1007/s10878-014-9778-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaoW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CardosoL16,
author = {Domingos M. Cardoso and
Carlos J. Luz},
title = {A simplex like approach based on star sets for recognizing convex-QP
adverse graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {311--326},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9745-x},
doi = {10.1007/s10878-014-9745-x},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CardosoL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CarlingM16,
author = {Kenneth Carling and
Xiangli Meng},
title = {On statistical bounds of heuristic solutions to location problems},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1518--1549},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9839-0},
doi = {10.1007/s10878-015-9839-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CarlingM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CelaDW16,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Linearizable special cases of the {QAP}},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1269--1279},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9821-2},
doi = {10.1007/s10878-014-9821-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CelaDW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangCH16,
author = {Maw{-}Shang Chang and
Li{-}Hsuan Chen and
Ling{-}Ju Hung},
title = {An O\({}^{\mbox{{\({_\ast}\)}}}\)(1.4366\({}^{\mbox{n}}\))-time exact
algorithm for maximum P\({}_{\mbox{2}}\)-packing in cubic graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {594--607},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9884-8},
doi = {10.1007/s10878-015-9884-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangCH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangPY16,
author = {Yanming Chang and
Yuejian Peng and
Yuping Yao},
title = {Connection between a class of polynomial optimization problems and
maximum cliques of non-uniform hypergraphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {881--892},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9798-x},
doi = {10.1007/s10878-014-9798-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangPY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChatzinakosPZ16,
author = {Christos Chatzinakos and
Leonidas S. Pitsoulis and
George Zioutas},
title = {Optimization techniques for robust multivariate location and scatter
estimation},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1443--1460},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9833-6},
doi = {10.1007/s10878-015-9833-6},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChatzinakosPZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Chen16,
author = {Shubo Chen},
title = {Cacti with the smallest, second smallest, and third smallest Gutman
index},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {327--332},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9743-z},
doi = {10.1007/s10878-014-9743-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Chen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenC16,
author = {Weidong Chen and
Zhixiang Chen},
title = {Introduction: Special issue dedicated to the memory of professor Wenqi
Huang},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {331--340},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0040-x},
doi = {10.1007/s10878-016-0040-x},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenDGZ16,
author = {Ning Chen and
Xiaotie Deng and
Paul W. Goldberg and
Jinshan Zhang},
title = {On revenue maximization with sharp multi-unit demands},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1174--1205},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9817-y},
doi = {10.1007/s10878-014-9817-y},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenDGZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenH16,
author = {Jianer Chen and
John E. Hopcroft},
title = {Special Issue for {FAW} 2014},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0042-8},
doi = {10.1007/s10878-016-0042-8},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenLLTWX16,
author = {Hao Chen and
Zihan Lei and
Tian Liu and
Ziyang Tang and
Chaoyi Wang and
Ke Xu},
title = {Complexity of domination, hamiltonicity and treewidth for tree convex
bipartite graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {95--110},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9917-3},
doi = {10.1007/s10878-015-9917-3},
timestamp = {Wed, 29 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLLTWX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenRW16,
author = {Min Chen and
Andr{\'{e}} Raspaud and
Weifan Wang},
title = {A (3, 1) {\({_\ast}\)}-choosable theorem on planar graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {927--940},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9913-7},
doi = {10.1007/s10878-015-9913-7},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChiangHY16,
author = {Chun{-}Ying Chiang and
Wei{-}Ting Huang and
Hong{-}Gwa Yeh},
title = {Dynamic monopolies and feedback vertex sets in cycle permutation graphs,
generalized Petersen graphs and torus cordalis},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {815--832},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9790-5},
doi = {10.1007/s10878-014-9790-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChiangHY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CohenCGGJ16,
author = {David A. Cohen and
Jason Crampton and
Andrei Gagarin and
Gregory Z. Gutin and
Mark Jones},
title = {Algorithms for the workflow satisfiability problem engineered for
counting constraints},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {3--24},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9877-7},
doi = {10.1007/s10878-015-9877-7},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CohenCGGJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CsehD16,
author = {{\'{A}}gnes Cseh and
Brian C. Dean},
title = {Improved algorithmic results for unsplittable stable allocation problems},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {657--671},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9889-3},
doi = {10.1007/s10878-015-9889-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CsehD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Dehghan16,
author = {Ali Dehghan},
title = {On strongly planar not-all-equal 3SAT},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {721--724},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9894-6},
doi = {10.1007/s10878-015-9894-6},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Dehghan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DesormeauxH16,
author = {Wyatt J. Desormeaux and
Michael A. Henning},
title = {Lower bounds on the total domination number of a graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {52--66},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9708-2},
doi = {10.1007/s10878-014-9708-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DesormeauxH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DingSCH0FSBX16,
author = {Hu Ding and
Branislav Stojkovic and
Zihe Chen and
Andrew Hughes and
Lei Xu and
Andrew J. Fritz and
Nitasha Sehgal and
Ronald Berezney and
Jinhui Xu},
title = {Chromatic kernel and its applications},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1298--1315},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9824-z},
doi = {10.1007/s10878-014-9824-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DingSCH0FSBX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DisserM16,
author = {Yann Disser and
Jannik Matuschke},
title = {Degree-constrained orientations of embedded graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {758--773},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9786-1},
doi = {10.1007/s10878-014-9786-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DisserM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DongL16,
author = {Wei Dong and
Wensong Lin},
title = {An improved bound on 2-distance coloring plane graphs with girth 5},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {645--655},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9888-4},
doi = {10.1007/s10878-015-9888-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DongL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DongWHL16,
author = {Jianming Dong and
Xueshi Wang and
Jueliang Hu and
Guohui Lin},
title = {An improved two-machine flowshop scheduling with intermediate transportation},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1316--1334},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9825-y},
doi = {10.1007/s10878-014-9825-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DongWHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EhsaniFGS16,
author = {Shayan Ehsani and
MohammadAmin Fazli and
Mohammad Ghodsi and
MohammadAli Safari},
title = {Optimal space coverage with white convex polygons},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {341--353},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9822-1},
doi = {10.1007/s10878-014-9822-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EhsaniFGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FarnoudYB16,
author = {Farzad Farnoud and
Eitan Yaakobi and
Jehoshua Bruck},
title = {Approximate sorting of data streams with limited storage},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1133--1164},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9930-6},
doi = {10.1007/s10878-015-9930-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FarnoudYB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FazliGHH16,
author = {MohammadAmin Fazli and
Azin Ghazimatin and
Jafar Habibi and
Hamid Haghshenas},
title = {Team selection for prediction tasks},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {743--757},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9784-3},
doi = {10.1007/s10878-014-9784-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FazliGHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FengCZX16,
author = {Xin Feng and
Yongxi Cheng and
Feifeng Zheng and
Yin{-}Feng Xu},
title = {Online integrated production-distribution scheduling problems without
preemption},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1569--1585},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9841-6},
doi = {10.1007/s10878-015-9841-6},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FengCZX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FengZW16,
author = {Qilong Feng and
Qian Zhou and
Jianxin Wang},
title = {Kernelization and randomized Parameterized algorithms for Co-path
Set problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {67--78},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9901-y},
doi = {10.1007/s10878-015-9901-y},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FengZW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Florek16,
author = {Jan Florek},
title = {On Barnette's conjecture and the H\({}^{\mbox{+-}}\) property},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {943--960},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9797-y},
doi = {10.1007/s10878-014-9797-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Florek16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FujiwaraKF16,
author = {Hiroshi Fujiwara and
Takuma Kitano and
Toshihiro Fujito},
title = {On the best possible competitive ratio for the multislope ski-rental
problem},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {463--490},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9762-9},
doi = {10.1007/s10878-014-9762-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FujiwaraKF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaoLL16,
author = {Jing Gao and
Jianzhong Li and
Yingshu Li},
title = {Approximate event detection over multi-modal sensing data},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1002--1016},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9847-0},
doi = {10.1007/s10878-015-9847-0},
timestamp = {Sat, 29 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GaoLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GhiyasvandK16,
author = {Mehdi Ghiyasvand and
Iman Keshtkar},
title = {Finding a contra-risk path between two nodes in undirected graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {917--926},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9912-8},
doi = {10.1007/s10878-015-9912-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GhiyasvandK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuLPS16,
author = {Ran Gu and
Xueliang Li and
Yuejian Peng and
Yongtang Shi},
title = {Some Motzkin-Straus type results for non-uniform hypergraphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {223--238},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9736-y},
doi = {10.1007/s10878-014-9736-y},
timestamp = {Sat, 11 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuLPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Guo16,
author = {Longkun Guo},
title = {Efficient approximation algorithms for computing k disjoint constrained
shortest paths},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {144--158},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9934-2},
doi = {10.1007/s10878-015-9934-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Guo16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuoLC16,
author = {Longjiang Guo and
Yingshu Li and
Zhipeng Cai},
title = {Minimum-latency aggregation scheduling in wireless sensor network},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {279--310},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9748-7},
doi = {10.1007/s10878-014-9748-7},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuoLC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HattinghJ16,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {Equality in a bound that relates the size and the restrained domination
number of a graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1586--1608},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9843-4},
doi = {10.1007/s10878-015-9843-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HattinghJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeZLLWG16,
author = {Yichao He and
Xinlu Zhang and
Wenbin Li and
Xiang Li and
Weili Wu and
Suogang Gao},
title = {Algorithms for randomized time-varying knapsack problems},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {95--117},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9717-1},
doi = {10.1007/s10878-014-9717-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeZLLWG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Hedetniemi16,
author = {Jason Hedetniemi},
title = {On identifying codes in the Cartesian product of a path and a complete
graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1405--1416},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9830-9},
doi = {10.1007/s10878-015-9830-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Hedetniemi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HenningN16,
author = {Michael A. Henning and
Viroshan Naicker},
title = {Disjunctive total domination in graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1090--1110},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9811-4},
doi = {10.1007/s10878-014-9811-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HenningN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HolzhauserKT16,
author = {Michael Holzhauser and
Sven Oliver Krumke and
Clemens Thielen},
title = {Budget-constrained minimum cost flows},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1720--1745},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9865-y},
doi = {10.1007/s10878-015-9865-y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HolzhauserKT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuSC16,
author = {Fu{-}Tao Hu and
Moo Young Sohn and
Xue{-}Gang Chen},
title = {Total and paired domination numbers of C\({}_{\mbox{m}}\) bundles
over a cycle C\({}_{\mbox{n}}\)},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {608--625},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9885-7},
doi = {10.1007/s10878-015-9885-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuSC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangKD16,
author = {Guihua Huang and
Meijun Kuang and
Hanyuan Deng},
title = {The expected values of Hosoya index and Merrifield-Simmons index in
a random polyphenylene chain},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {550--562},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9882-x},
doi = {10.1007/s10878-015-9882-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuangKD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangL16,
author = {Zejun Huang and
Huiqiu Lin},
title = {Sizes and transmissions of digraphs with a given clique number},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1642--1649},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9850-5},
doi = {10.1007/s10878-015-9850-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuangL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangZSL16,
author = {Can Huang and
Defu Zhang and
Yain{-}Whar Si and
Stephen C. H. Leung},
title = {Tabu search for the real-world carpooling problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {492--512},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0015-y},
doi = {10.1007/s10878-016-0015-y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuangZSL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JanczewskiT16,
author = {Robert Janczewski and
Krzysztof Turowski},
title = {An O(n log n) algorithm for finding edge span of cacti},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1373--1382},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9827-4},
doi = {10.1007/s10878-015-9827-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JanczewskiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangLZ16,
author = {Hui Jiang and
Xueliang Li and
Yingying Zhang},
title = {Upper bounds for the total rainbow connection of graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {260--266},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9874-x},
doi = {10.1007/s10878-015-9874-x},
timestamp = {Sat, 11 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JiangLZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JinYZ16,
author = {Ya{-}Lei Jin and
Yeong{-}Nan Yeh and
Xiao{-}Dong Zhang},
title = {Laplacian coefficient, matching polynomial and incidence energy of
trees with described maximum degree},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1345--1372},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9977-4},
doi = {10.1007/s10878-015-9977-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JinYZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Joubert16,
author = {Ernst J. Joubert},
title = {An inequality that relates the size of a bipartite graph with its
order and restrained domination number},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {44--51},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9709-1},
doi = {10.1007/s10878-014-9709-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Joubert16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KacemKS16,
author = {Imed Kacem and
Hans Kellerer and
Maryam Seifaddini},
title = {Efficient approximation schemes for the maximum lateness minimization
on a single machine with a fixed operator or machine non-availability
interval},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {970--981},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9924-4},
doi = {10.1007/s10878-015-9924-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KacemKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kamiyama16,
author = {Naoyuki Kamiyama},
title = {The popular matching and condensation problems under matroid constraints},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1305--1326},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9965-8},
doi = {10.1007/s10878-015-9965-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kamiyama16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kazmierczak16,
author = {Wojciech Kazmierczak},
title = {The best choice problem for posets; colored complete binary trees},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {13--28},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9705-5},
doi = {10.1007/s10878-014-9705-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kazmierczak16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KhaniS16,
author = {M. Reza Khani and
Mohammad R. Salavatipour},
title = {Improved approximations for buy-at-bulk and shallow-light k-Steiner
trees and (k, 2)-subgraph},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {669--685},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9774-5},
doi = {10.1007/s10878-014-9774-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KhaniS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KimWLLWT16,
author = {Donghyun Kim and
Wei Wang and
Deying Li and
Joonglyul Lee and
Weili Wu and
Alade O. Tokuta},
title = {A joint optimization of data ferry trajectories and communication
powers of ground sensors for long-term environmental monitoring},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1550--1568},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9840-7},
doi = {10.1007/s10878-015-9840-7},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KimWLLWT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KiviluotoOV16,
author = {Lasse Kiviluoto and
Patric R. J. {\"{O}}sterg{\aa}rd and
Vesa P. Vaskelainen},
title = {Algorithms for finding maximum transitive subtournaments},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {802--814},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9788-z},
doi = {10.1007/s10878-014-9788-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KiviluotoOV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kochol16,
author = {Martin Kochol},
title = {Polynomial algorithms for canonical forms of orientations},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {218--222},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9735-z},
doi = {10.1007/s10878-014-9735-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kochol16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KomoskoBSP16,
author = {Larisa Komosko and
Mikhail Batsyn and
Pablo San Segundo and
Panos M. Pardalos},
title = {A fast greedy sequential heuristic for the vertex colouring problem
based on bitwise operations},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1665--1677},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9862-1},
doi = {10.1007/s10878-015-9862-1},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KomoskoBSP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LamineKHC16,
author = {Amine Lamine and
Mahdi Khemakhem and
Brahim Hnich and
Habib Chabchoub},
title = {Solving constrained optimization problems by solution-based decomposition
search},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {672--695},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9892-8},
doi = {10.1007/s10878-015-9892-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LamineKHC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LevitM16,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Computing unique maximum matchings in O(m) time for K{\"{o}}nig-Egerv{\'{a}}ry
graphs and unicyclic graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {267--277},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9875-9},
doi = {10.1007/s10878-015-9875-9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LevitM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiCF16,
author = {Shi{-}Sheng Li and
Ren{-}Xia Chen and
Qi Feng},
title = {Scheduling two job families on a single machine with two competitive
agents},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {784--799},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9902-x},
doi = {10.1007/s10878-015-9902-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiCF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiL16,
author = {Mohan Li and
Jianzhong Li},
title = {A minimized-rule based approach for improving data currency},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {812--841},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9904-8},
doi = {10.1007/s10878-015-9904-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLG16,
author = {Lingli Li and
Jianzhong Li and
Hong Gao},
title = {Evaluating entity-description conflict on duplicated data},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {918--941},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9801-6},
doi = {10.1007/s10878-014-9801-6},
timestamp = {Mon, 31 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiLG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLP16,
author = {Jian Li and
Yang Li and
Panos M. Pardalos},
title = {Multi-depot vehicle routing problem with time windows under shared
depot resources},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {515--532},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9767-4},
doi = {10.1007/s10878-014-9767-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiSQ16,
author = {Honghai Li and
Jia{-}Yu Shao and
Liqun Qi},
title = {The extremal spectral radii of k -uniform supertrees},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {741--764},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9896-4},
doi = {10.1007/s10878-015-9896-4},
timestamp = {Thu, 20 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiSQ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiXN16,
author = {Hongmei Li and
Yin{-}Feng Xu and
Guanqun Ni},
title = {Minimax regret vertex 2-sink location problem in dynamic path networks},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {79--94},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9716-2},
doi = {10.1007/s10878-014-9716-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiXN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiY16,
author = {Xiangtao Li and
Minghao Yin},
title = {Modified differential evolution with self-adaptive parameters method},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {546--576},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9773-6},
doi = {10.1007/s10878-014-9773-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiYW16,
author = {Hengzhe Li and
Yuxing Yang and
Baoyindureng Wu},
title = {2-Edge connected dominating sets and 2-Connected dominating sets of
a graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {713--724},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9783-4},
doi = {10.1007/s10878-014-9783-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiYW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZ16,
author = {Shuchao Li and
Huihui Zhang},
title = {Some extremal properties of the multiplicatively weighted Harary index
of a graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {961--978},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9802-5},
doi = {10.1007/s10878-014-9802-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZZ16,
author = {Shuchao Li and
Huihui Zhang and
Minjie Zhang},
title = {Further results on the reciprocal degree distance of graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {648--668},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9780-7},
doi = {10.1007/s10878-014-9780-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiZZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangMW016,
author = {Dongyue Liang and
Liquan Mei and
James Willson and
Wei Wang},
title = {A simple greedy approximation algorithm for the minimum connected
k-Center problem},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1417--1429},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9831-8},
doi = {10.1007/s10878-015-9831-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangMW016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangZL0J16,
author = {Dongyue Liang and
Zhao Zhang and
Xianliang Liu and
Wei Wang and
Yaolin Jiang},
title = {Approximation algorithms for minimum weight partial connected set
cover problem},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {696--712},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9782-5},
doi = {10.1007/s10878-014-9782-5},
timestamp = {Wed, 13 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangZL0J16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Liao16,
author = {Chung{-}Shou Liao},
title = {Power domination with bounded time constraints},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {725--742},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9785-2},
doi = {10.1007/s10878-014-9785-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Liao16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lin16,
author = {Wensong Lin},
title = {On (s, t)-relaxed L(2, 1)-labeling of graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {405--426},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9746-9},
doi = {10.1007/s10878-014-9746-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Lin16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinSW16,
author = {Huiqiu Lin and
Jinlong Shu and
Baoyindureng Wu},
title = {Maximum size of digraphs with some parameters},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {941--950},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9916-4},
doi = {10.1007/s10878-015-9916-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinZA16,
author = {Geng Lin and
Wenxing Zhu and
M. Montaz Ali},
title = {An effective discrete dynamic convexized method for solving the winner
determination problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {563--593},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9883-9},
doi = {10.1007/s10878-015-9883-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LinZA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuX16,
author = {Muhuo Liu and
Baogang Xu},
title = {On judicious partitions of graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1383--1398},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9828-3},
doi = {10.1007/s10878-015-9828-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuY16,
author = {Qijia Liu and
Jinjiang Yuan},
title = {Online tradeoff scheduling on a single machine to minimize makespan
and maximum lateness},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {385--395},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9918-2},
doi = {10.1007/s10878-015-9918-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuYL16,
author = {Hailing Liu and
Jinjiang Yuan and
Wenjie Li},
title = {Online scheduling of equal length jobs on unbounded parallel batch
processing machines with limited restart},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1609--1622},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9844-3},
doi = {10.1007/s10878-015-9844-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuYL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuZ16,
author = {Daphne Der{-}Fen Liu and
Xuding Zhu},
title = {A combinatorial proof for the circular chromatic number of Kneser
graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {765--774},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9897-3},
doi = {10.1007/s10878-015-9897-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuS16,
author = {Damei L{\"{u}} and
Jianping Sun},
title = {L(2, 1)-labelings of the edge-multiplicity-paths-replacement of a
graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {396--404},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9761-x},
doi = {10.1007/s10878-014-9761-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuYZ16,
author = {Xiaonong Lu and
Baoqun Yin and
Haipeng Zhang},
title = {A reinforcement-learning approach for admission control in distributed
network service systems},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1241--1268},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9820-3},
doi = {10.1007/s10878-014-9820-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuYZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaZ16,
author = {Shasha Ma and
Liancui Zuo},
title = {Equitable colorings of Cartesian products of square of cycles and
paths with complete bipartite graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {725--740},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9895-5},
doi = {10.1007/s10878-015-9895-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Malyshev16,
author = {Dmitriy S. Malyshev},
title = {Two cases of polynomial-time solvability for the coloring problem},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {833--845},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9792-3},
doi = {10.1007/s10878-014-9792-3},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Malyshev16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Malyshev16a,
author = {Dmitriy S. Malyshev},
title = {A complexity dichotomy and a new boundary class for the dominating
set problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {226--243},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9872-z},
doi = {10.1007/s10878-015-9872-z},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Malyshev16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MarzbanGJ16,
author = {Marjan Marzban and
Qian{-}Ping Gu and
Xiaohua Jia},
title = {New analysis and computational study for the planar connected dominating
set problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {198--225},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9871-0},
doi = {10.1007/s10878-015-9871-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MarzbanGJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MiaoSWC16,
author = {Zhengke Miao and
Qiaojun Shu and
Weifan Wang and
Dong Chen},
title = {A sufficient condition for a tree to be ({\(\Delta\)}+1)-(2, 1)-totally
labelable},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {893--901},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9794-1},
doi = {10.1007/s10878-014-9794-1},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MiaoSWC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Mourtos16,
author = {Ioannis Mourtos},
title = {Cardinality constraints and systems of restricted representatives},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1061--1089},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9810-5},
doi = {10.1007/s10878-014-9810-5},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Mourtos16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Nadjafi-AraniSS16,
author = {Mohammad J. Nadjafi{-}Arani and
Mark H. Siggers and
Hossein Soltani},
title = {Characterisation of forests with trivial game domination numbers},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {800--811},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9903-9},
doi = {10.1007/s10878-015-9903-9},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Nadjafi-AraniSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NguyenS16,
author = {Kien Trung Nguyen and
Ali Reza Sepasian},
title = {The inverse 1-center problem on trees with variable edge lengths under
Chebyshev norm and Hamming distance},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {872--884},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9907-5},
doi = {10.1007/s10878-015-9907-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NguyenS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NicholsonW16,
author = {Emlee W. Nicholson and
Bing Wei},
title = {Degree conditions for weakly geodesic pancyclic graphs and their exceptions},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {912--917},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9800-7},
doi = {10.1007/s10878-014-9800-7},
timestamp = {Thu, 08 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NicholsonW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OualiFS16,
author = {Mourad El Ouali and
Helena Fohlin and
Anand Srivastav},
title = {An approximation algorithm for the partial vertex cover problem in
hypergraphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {846--864},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9793-2},
doi = {10.1007/s10878-014-9793-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/OualiFS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PandaS16,
author = {B. S. Panda and
D. Pushparaj Shetty},
title = {Strong minimum energy hierarchical topology in wireless sensor networks},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {174--187},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9869-7},
doi = {10.1007/s10878-015-9869-7},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PandaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Pinchasi16,
author = {Rom Pinchasi},
title = {Crossing edges and faces of line arrangements in the plane},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {533--545},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9769-2},
doi = {10.1007/s10878-014-9769-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Pinchasi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Pradhan16,
author = {Dinabandhu Pradhan},
title = {On the complexity of the minimum outer-connected dominating set problem
in graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {1--12},
year = {2016},
url = {https://doi.org/10.1007/s10878-013-9703-z},
doi = {10.1007/s10878-013-9703-z},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Pradhan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PullanWL16,
author = {Wayne Pullan and
Xin{-}Wen Wu and
Zihui Liu},
title = {Construction of optimal constant-dimension subspace codes},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1709--1719},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9864-z},
doi = {10.1007/s10878-015-9864-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PullanWL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/QuWYY16,
author = {Cunquan Qu and
Guanghui Wang and
Guiying Yan and
Xiaowei Yu},
title = {Neighbor sum distinguishing total choosability of planar graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {906--916},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9911-9},
doi = {10.1007/s10878-015-9911-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/QuWYY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RanZKL16,
author = {Yingli Ran and
Zhao Zhang and
Ker{-}I Ko and
Jun Liang},
title = {An approximation algorithm for maximum weight budgeted connected set
cover},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1505--1517},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9838-1},
doi = {10.1007/s10878-015-9838-1},
timestamp = {Wed, 13 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RanZKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Rey16,
author = {Mario Leston Rey},
title = {Integral packing of branchings in capacitaded digraphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {506--514},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9768-3},
doi = {10.1007/s10878-014-9768-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Rey16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Samadi16,
author = {Babak Samadi},
title = {A solution to an open problem on lower against number in graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1130--1133},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9813-2},
doi = {10.1007/s10878-014-9813-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Samadi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ScheidweilerT16,
author = {Robert Scheidweiler and
Eberhard Triesch},
title = {A note on the duality between matchings and vertex covers in balanced
hypergraphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {639--644},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9887-5},
doi = {10.1007/s10878-015-9887-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ScheidweilerT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShanginP16,
author = {Roman E. Shangin and
Panos M. Pardalos},
title = {Heuristics for the network design problem with connectivity requirements},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1461--1478},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9834-5},
doi = {10.1007/s10878-015-9834-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShanginP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShaoXY16,
author = {Zehui Shao and
Jin Xu and
Roger K. Yeh},
title = {L(2, 1)-labeling for brick product graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {447--462},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9763-8},
doi = {10.1007/s10878-014-9763-8},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShaoXY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShenR16,
author = {Jing Shen and
Yaofeng Ren},
title = {Bounding the scaling window of random constraint satisfaction problems},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {786--801},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9789-y},
doi = {10.1007/s10878-014-9789-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShenR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiFYW16,
author = {Feng Shi and
Qilong Feng and
Jie You and
Jianxin Wang},
title = {Improved approximation algorithm for maximum agreement forest of two
rooted binary phylogenetic trees},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {111--143},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9921-7},
doi = {10.1007/s10878-015-9921-7},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShiFYW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiZZW16,
author = {Yishuo Shi and
Yaping Zhang and
Zhao Zhang and
Weili Wu},
title = {A greedy algorithm for the minimum 2-connected m-fold dominating set
problem},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {136--151},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9720-6},
doi = {10.1007/s10878-014-9720-6},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShiZZW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SongHD16,
author = {Liang Song and
Hejiao Huang and
Hongwei Du},
title = {Approximation schemes for Euclidean vehicle routing problems with
time windows},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1217--1231},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9931-5},
doi = {10.1007/s10878-015-9931-5},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SongHD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SuXSL16,
author = {Guifu Su and
Liming Xiong and
Xiaofeng Su and
Guojun Li},
title = {Maximally edge-connected graphs and Zeroth-order general Randi{\'{c}}
index for {\(\alpha\)} {\(\leq\)} -1},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {182--195},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9728-y},
doi = {10.1007/s10878-014-9728-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SuXSL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SuzukiMN16,
author = {Akira Suzuki and
Amer E. Mouawad and
Naomi Nishimura},
title = {Reconfiguration of dominating sets},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1182--1195},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9947-x},
doi = {10.1007/s10878-015-9947-x},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SuzukiMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Tan16,
author = {Zihan Tan},
title = {On the computational complexity of bridgecard},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {196--217},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9725-1},
doi = {10.1007/s10878-014-9725-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Tan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Volkmann16,
author = {Lutz Volkmann},
title = {Signed total Roman domination in graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {855--871},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9906-6},
doi = {10.1007/s10878-015-9906-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Volkmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wang0L16,
author = {Chao Wang and
Lei Chen and
Changhong Lu},
title = {k-Power domination in block graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {865--873},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9795-0},
doi = {10.1007/s10878-014-9795-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wang0L16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangCLM16,
author = {Yi Wang and
Jian Cheng and
Rong Luo and
Gregory Mulley},
title = {Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {874--880},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9796-z},
doi = {10.1007/s10878-014-9796-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangCLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangHGLW16,
author = {Yang Wang and
Jin{-}Kao Hao and
Fred W. Glover and
Zhipeng L{\"{u}} and
Qinghua Wu},
title = {Solving the maximum vertex weight clique problem via binary quadratic
programming},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {531--549},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-9990-2},
doi = {10.1007/s10878-016-9990-2},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangHGLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangK16,
author = {Hongzhuan Wang and
Liying Kang},
title = {Further properties on the degree distance of graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {427--446},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9757-6},
doi = {10.1007/s10878-014-9757-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLJL16,
author = {Bin Wang and
Dong{-}Xu Li and
Jian{-}Ping Jiang and
Yi{-}Huan Liao},
title = {A modified firefly algorithm based on light intensity difference},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1045--1060},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9809-y},
doi = {10.1007/s10878-014-9809-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangLJL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLZWWG16,
author = {Huijuan Wang and
Bin Liu and
Xin Zhang and
Lidong Wu and
Weili Wu and
Hongwei Gao},
title = {List edge and list total coloring of planar graphs with maximum degree
8},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {188--197},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9870-1},
doi = {10.1007/s10878-015-9870-1},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangLZWWG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangMHW16,
author = {Jihui Wang and
Qiaoling Ma and
Xue Han and
Xiuyun Wang},
title = {A proper total coloring distinguishing adjacent vertices by sums of
planar graphs without intersecting triangles},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {626--638},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9886-6},
doi = {10.1007/s10878-015-9886-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangMHW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangMWP16,
author = {Zengfu Wang and
Bill Moran and
Xuezhi Wang and
Quan Pan},
title = {Approximation for maximizing monotone non-decreasing set functions
with a greedy method},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {29--43},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9707-3},
doi = {10.1007/s10878-014-9707-3},
timestamp = {Thu, 20 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangMWP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWC16,
author = {Ailian Wang and
Weili Wu and
Lei Cui},
title = {On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1678--1684},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-9991-1},
doi = {10.1007/s10878-016-9991-1},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangWC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWH016,
author = {Wei{-}Fan Wang and
Tingting Wu and
Xiaoxue Hu and
Yiqiao Wang},
title = {The entire choosability of plane graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1221--1240},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9819-9},
doi = {10.1007/s10878-014-9819-9},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangWH016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWYYL16,
author = {Yuepeng Wang and
Yuexuan Wang and
Dongxiao Yu and
Jiguo Yu and
Francis C. M. Lau},
title = {Information exchange with collision detection on multiple channels},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {118--135},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9713-5},
doi = {10.1007/s10878-014-9713-5},
timestamp = {Mon, 21 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangWYYL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWZWL16,
author = {Huijuan Wang and
Lidong Wu and
Xin Zhang and
Weili Wu and
Bin Liu},
title = {A note on the minimum number of choosability of planar graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1013--1022},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9805-2},
doi = {10.1007/s10878-014-9805-2},
timestamp = {Mon, 10 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangWZWL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangY16,
author = {Lei Wang and
Aihua Yin},
title = {A quasi-human algorithm for the two dimensional rectangular strip
packing problem: in memory of Prof. Wenqi Huang},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {416--444},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9961-z},
doi = {10.1007/s10878-015-9961-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangYYHY16,
author = {Cui Wang and
Jiguo Yu and
Dongxiao Yu and
Baogui Huang and
Shanshan Yu},
title = {An improved approximation algorithm for the shortest link scheduling
in wireless networks under {SINR} and hypergraph models},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1052--1067},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9908-4},
doi = {10.1007/s10878-015-9908-4},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangYYHY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WatelW16,
author = {Dimitri Watel and
Marc{-}Antoine Weisser},
title = {A practical greedy approximation for the directed Steiner tree problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1327--1370},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0074-0},
doi = {10.1007/s10878-016-0074-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WatelW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WatelWBB16,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
title = {Directed Steiner trees with diffusion costs},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1089--1106},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9925-3},
doi = {10.1007/s10878-015-9925-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WatelWBB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wimer16,
author = {Shmuel Wimer},
title = {Optimal weight allocation in rooted trees},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1023--1033},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9807-0},
doi = {10.1007/s10878-014-9807-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wimer16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wu16,
author = {Lidong Wu},
title = {On strongly planar 3SAT},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {293--298},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9878-6},
doi = {10.1007/s10878-015-9878-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wu16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuC16,
author = {Lidong Wu and
Cong{-}Dian Cheng},
title = {On single machine scheduling with resource constraint},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {491--505},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9721-5},
doi = {10.1007/s10878-014-9721-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuKW16,
author = {Tingting Wu and
Jiangxu Kong and
Wei{-}Fan Wang},
title = {The 2-surviving rate of planar graphs without 5-cycles},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1479--1492},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9835-4},
doi = {10.1007/s10878-015-9835-4},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuSS16,
author = {Qiong Wu and
Wai Chee Shiu and
Pak Kiu Sun},
title = {L(j, k)-labeling number of Cartesian product of path and cycle},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {604--634},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9775-4},
doi = {10.1007/s10878-014-9775-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuXDX16,
author = {Chenchen Wu and
Dachuan Xu and
Donglei Du and
Wen{-}qing Xu},
title = {An approximation algorithm for the balanced Max-3-Uncut problem using
complex semidefinite programming rounding},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1017--1035},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9880-z},
doi = {10.1007/s10878-015-9880-z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuXDX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuYWL16,
author = {Xinyun Wu and
Shengfeng Yan and
Xin Wan and
Zhipeng L{\"{u}}},
title = {Multi-neighborhood based iterated tabu search for routing and wavelength
assignment problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {445--468},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9962-y},
doi = {10.1007/s10878-015-9962-y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuYWL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WylieSA16,
author = {Tim Wylie and
Michael A. Schuh and
Rafal A. Angryk},
title = {Enabling high-dimensional range queries using kNN indexing techniques:
approaches and empirical results},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1107--1132},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9927-1},
doi = {10.1007/s10878-015-9927-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WylieSA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Xiao16,
author = {Han Xiao},
title = {Packing feedback arc sets in reducible flow graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {951--959},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9922-6},
doi = {10.1007/s10878-015-9922-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Xiao16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuG16,
author = {Wei Xu and
Fuzhou Gong},
title = {Performances of pure random walk algorithms on constraint satisfaction
problems with growing domains},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {51--66},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9891-9},
doi = {10.1007/s10878-015-9891-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuLCZ16,
author = {Shou{-}Jun Xu and
Xiu{-}Song Liu and
Wai Hong Chan and
Heping Zhang},
title = {Complete forcing numbers of primitive coronoids},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {318--330},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9881-y},
doi = {10.1007/s10878-015-9881-y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XuLCZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuWX16,
author = {Renyu Xu and
Jian{-}Liang Wu and
Jin Xu},
title = {Neighbor sum distinguishing total coloring of graphs embedded in surfaces
of nonnegative Euler characteristic},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1430--1442},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9832-7},
doi = {10.1007/s10878-015-9832-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuWX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YanYWYL16,
author = {Yu Yan and
Dongxiao Yu and
Yuexuan Wang and
Jiguo Yu and
Francis C. M. Lau},
title = {Bounded information dissemination in multi-channel wireless networks},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {996--1012},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9804-3},
doi = {10.1007/s10878-014-9804-3},
timestamp = {Mon, 21 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YanYWYL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangZZ16,
author = {Zhaoyang Yang and
Guojun Zhang and
Haiping Zhu},
title = {Multi-neighborhood based path relinking for two-sided assembly line
balancing problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {396--415},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9959-6},
doi = {10.1007/s10878-015-9959-6},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangZZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YinTSB16,
author = {Zhaoming Yin and
Jijun Tang and
Stephen W. Schaeffer and
David A. Bader},
title = {Exemplar or matching: modeling {DCJ} problems with unequal content
genome data},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1165--1181},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9940-4},
doi = {10.1007/s10878-015-9940-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YinTSB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YuWHYL16,
author = {Dongxiao Yu and
Yuexuan Wang and
Qiang{-}Sheng Hua and
Jiguo Yu and
Francis C. M. Lau},
title = {Distributed wireless link scheduling in the {SINR} model},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {278--292},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9876-8},
doi = {10.1007/s10878-015-9876-8},
timestamp = {Mon, 21 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YuWHYL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZakerS16,
author = {Manouchehr Zaker and
Hossein Soltani},
title = {First-Fit colorings of graphs with no cycles of a prescribed even
length},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {775--783},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9900-z},
doi = {10.1007/s10878-015-9900-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZakerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zhang16,
author = {Zhao Zhang},
title = {Editorial for Special Issue: {COCOA2014}},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1196},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0087-8},
doi = {10.1007/s10878-016-0087-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Zhang16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangCCTYZS16,
author = {Yong Zhang and
Joseph Wun{-}Tat Chan and
Francis Y. L. Chin and
Hing{-}Fung Ting and
Deshi Ye and
Feng Zhang and
Jianyu Shi},
title = {Constrained pairwise and center-star sequences alignment problems},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {79--94},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9914-6},
doi = {10.1007/s10878-015-9914-6},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangCCTYZS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangCYSL16,
author = {Defu Zhang and
Yuxin Che and
Furong Ye and
Yain{-}Whar Si and
Stephen C. H. Leung},
title = {A hybrid algorithm based on variable neighbourhood for the strip packing
problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {513--530},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0036-6},
doi = {10.1007/s10878-016-0036-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangCYSL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangHYP16,
author = {Kejia Zhang and
Qilong Han and
Guisheng Yin and
Haiwei Pan},
title = {{OFDP:} a distributed algorithm for finding disjoint paths with minimum
total length in wireless sensor networks},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1623--1641},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9845-2},
doi = {10.1007/s10878-015-9845-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangHYP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangLL16,
author = {Liqi Zhang and
Lingfa Lu and
Shisheng Li},
title = {New results on two-machine flow-shop scheduling with rejection},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1493--1504},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9836-3},
doi = {10.1007/s10878-015-9836-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangQ16,
author = {Xiaoling Zhang and
Jianguo Qian},
title = {L(p, q)-labeling and integer tension of a graph embedded on torus},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {67--77},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9714-4},
doi = {10.1007/s10878-014-9714-4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangQ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangQ16a,
author = {Xiaoling Zhang and
Jianguo Qian},
title = {Erratum to: L(p, q)-labeling and integer tension of a graph embedded
on torus},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {78},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9724-2},
doi = {10.1007/s10878-014-9724-2},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangQ16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangST16,
author = {Huiling Zhang and
Yilin Shen and
My T. Thai},
title = {Robustness of power-law networks: its assessment and optimization},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {696--720},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9893-7},
doi = {10.1007/s10878-015-9893-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangWGL16,
author = {Yan Zhang and
Hongzhi Wang and
Hong Gao and
Jianzhong Li},
title = {Efficient accuracy evaluation for multi-modal sensed data},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1068--1088},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9920-8},
doi = {10.1007/s10878-015-9920-8},
timestamp = {Wed, 06 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangWGL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangYGDT16,
author = {Nan Zhang and
Mengfei Yang and
Bin Gu and
Zhenhua Duan and
Cong Tian},
title = {Verifying safety critical task scheduling systems in {PPTL} axiom
system},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {577--603},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9776-3},
doi = {10.1007/s10878-014-9776-3},
timestamp = {Tue, 29 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangYGDT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangZL16,
author = {Huajun Zhang and
Jin Zhao and
Hui Luo},
title = {A method combining genetic algorithm with simultaneous perturbation
stochastic approximation for linearly constrained stochastic optimization
problems},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {979--995},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9803-4},
doi = {10.1007/s10878-014-9803-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangZL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoL16,
author = {Kejun Zhao and
Xiwen Lu},
title = {Two approximation algorithms for two-agent scheduling on parallel
machines to minimize makespan},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {260--278},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9744-y},
doi = {10.1007/s10878-014-9744-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoS16,
author = {Yancai Zhao and
Erfang Shan},
title = {An efficient algorithm for distance total domination in block graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {372--381},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9758-5},
doi = {10.1007/s10878-014-9758-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Zhou16,
author = {Jin{-}Xin Zhou},
title = {Atoms of cyclic edge connectivity in regular graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {382--395},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9759-4},
doi = {10.1007/s10878-014-9759-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Zhou16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhouHG16,
author = {Yi Zhou and
Jin{-}Kao Hao and
Adrien Go{\"{e}}ffon},
title = {A three-phased local search approach for the clique partitioning problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {469--491},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9964-9},
doi = {10.1007/s10878-015-9964-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhouHG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhouLWDP16,
author = {Taoqing Zhou and
Zhipeng L{\"{u}} and
Yang Wang and
Junwen Ding and
Bo Peng},
title = {Multi-start iterated tabu search for the minimum weight vertex cover
problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {368--384},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9909-3},
doi = {10.1007/s10878-015-9909-3},
timestamp = {Thu, 25 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhouLWDP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuGTZ16,
author = {Qiang Zhu and
Guodong Guo and
Wenliang Tang and
Cun{-}Quan Zhang},
title = {A diagnosis algorithm by using graph-coloring under the {PMC} model},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {960--969},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9923-5},
doi = {10.1007/s10878-015-9923-5},
timestamp = {Wed, 13 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuGTZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuLSXL16,
author = {Enqiang Zhu and
Zepeng Li and
Zehui Shao and
Jin Xu and
Chanjuan Liu},
title = {Acyclic 3-coloring of generalized Petersen graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {902--911},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9799-9},
doi = {10.1007/s10878-014-9799-9},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuLSXL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZuZY16,
author = {Quan Zu and
Miaomiao Zhang and
Bin Yu},
title = {Dynamic matchings in left vertex weighted convex bipartite graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {25--50},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9890-x},
doi = {10.1007/s10878-015-9890-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZuZY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AngelTR15,
author = {Eric Angel and
Nguyen Kim Thang 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 = {Thu, 18 May 2017 01:00:00 +0200},
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 = {Fri, 27 Dec 2019 00:00:00 +0100},
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/AnholcerCM15,
author = {Marcin Anholcer and
Sylwia Cichacz and
Martin Milanic},
title = {Group irregularity strength of connected graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {1--17},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9628-6},
doi = {10.1007/s10878-013-9628-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AnholcerCM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BaiHCY15,
author = {Yanqin Bai and
Xiao Han and
Tong Chen and
Hua Yu},
title = {Quadratic kernel-free least squares support vector machine for target
diseases classification},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {850--870},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9848-z},
doi = {10.1007/s10878-015-9848-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BaiHCY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BaiRL15,
author = {Mengzhuo Bai and
Chunyang Ren and
Yang Liu},
title = {A note of reduced dimension optimization algorithm of assignment problem},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {841--849},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9851-4},
doi = {10.1007/s10878-015-9851-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BaiRL15.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/BenderW15,
author = {Marco Bender and
Stephan Westphal},
title = {An optimal randomized online algorithm for the k-Canadian Traveller
Problem on node-disjoint paths},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {87--96},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9634-8},
doi = {10.1007/s10878-013-9634-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BenderW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bensmail15,
author = {Julien Bensmail},
title = {On the complexity of partitioning a graph into a few connected subgraphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {174--187},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9642-8},
doi = {10.1007/s10878-013-9642-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bensmail15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BieleckiKK15,
author = {Wlodzimierz Bielecki and
Krzysztof Kraska and
Tomasz Klimek},
title = {Using basis dependence distance vectors in the modified Floyd-Warshall
algorithm},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {253--275},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9740-2},
doi = {10.1007/s10878-014-9740-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BieleckiKK15.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 = {Tue, 06 Jun 2017 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 = {Thu, 18 May 2017 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/BuXW15,
author = {Yuehua Bu and
Jinghan Xu and
Yingqian Wang},
title = {(1, 0, 0)-Colorability of planar graphs without prescribed short cycles},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {627--646},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9653-5},
doi = {10.1007/s10878-013-9653-5},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BuXW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BuY15,
author = {Yuehua Bu and
Xiaoyan Yan},
title = {List 2-distance coloring of planar graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1180--1195},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9700-2},
doi = {10.1007/s10878-013-9700-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BuY15.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 = {Thu, 20 Aug 2020 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/CelaS15,
author = {Eranda {\c{C}}ela and
Rostislav Stanek},
title = {Heuristics for the data arrangement problem on regular trees},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {768--802},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9666-0},
doi = {10.1007/s10878-013-9666-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CelaS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangR15,
author = {Gerard Jennhwa Chang and
Nicolas Roussel},
title = {On the \emph{k}-power domination of hypergraphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1095--1106},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9688-7},
doi = {10.1007/s10878-013-9688-7},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenFLHZJ15,
author = {Xi Chen and
Zhi{-}Ping Fan and
Zhiwu Li and
Xueliang Han and
Xiao Zhang and
Haochen Jia},
title = {A two-stage method for member selection of emergency medical service},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {871--891},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9856-z},
doi = {10.1007/s10878-015-9856-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenFLHZJ15.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/ChenHIT15,
author = {Jing Chen and
Xin Han and
Kazuo Iwama and
Hing{-}Fung Ting},
title = {Online bin packing with (1, 1) and (2, {R)} bins},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {276--298},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9749-6},
doi = {10.1007/s10878-014-9749-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenHIT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenPWLTXW15,
author = {Wenbin Chen and
Lingxi Peng and
Jianxiong Wang and
Fufang Li and
Maobin Tang and
Wei Xiong and
Songtao Wang},
title = {An improved lower bound for approximating the Minimum Integral Solution
Problem with Preprocessing over {\(\mathscr{l}\)}\({}_{\mbox{{\(\infty\)}}}\)
norm},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {447--455},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9646-4},
doi = {10.1007/s10878-013-9646-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenPWLTXW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengGZ15,
author = {Yongxi Cheng and
Jue Guo and
Feifeng Zheng},
title = {A new randomized algorithm for group testing with unknown number of
defective items},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {150--159},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9640-x},
doi = {10.1007/s10878-013-9640-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChengGZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CohenN15,
author = {Nachshon Cohen and
Zeev Nutov},
title = {Approximating minimum power edge-multi-covers},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {563--578},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9652-6},
doi = {10.1007/s10878-013-9652-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CohenN15.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/DengHJ15,
author = {Hanyuan Deng and
Guihua Huang and
Xiaojuan Jiang},
title = {A unified linear-programming modeling of some topological indices},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {826--837},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9672-2},
doi = {10.1007/s10878-013-9672-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DengHJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DengKVB15,
author = {Hanyuan Deng and
B. Krishnakumari and
Yanamandram B. Venkatakrishnan and
Selvaraj Balachandran},
title = {Multiplicatively weighted Harary index of graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1125--1137},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9698-5},
doi = {10.1007/s10878-013-9698-5},
timestamp = {Thu, 14 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DengKVB15.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/DinhNAT15,
author = {Thang N. Dinh and
Nam P. Nguyen and
Md Abdul Alim and
My T. Thai},
title = {A near-optimal adaptive algorithm for maximizing modularity in dynamic
scale-free networks},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {747--767},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9665-1},
doi = {10.1007/s10878-013-9665-1},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DinhNAT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Drugan15,
author = {Madalina M. Drugan},
title = {Generating {QAP} instances with known optimum solution and additively
decomposable cost function},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1138--1172},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9689-6},
doi = {10.1007/s10878-013-9689-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Drugan15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DuD15,
author = {Yingfan L. Du and
Hongmin W. Du},
title = {A new bound on maximum independent set and minimum connected dominating
set in unit disk graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1173--1179},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9690-0},
doi = {10.1007/s10878-013-9690-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DuD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DuXZ15,
author = {Hai Du and
Yinfeng Xu and
Binhai Zhu},
title = {An incremental version of the k-center problem on boundary of a convex
polygon},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1219--1227},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9933-3},
doi = {10.1007/s10878-015-9933-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DuXZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FanL15,
author = {Jing Fan and
Xiwen Lu},
title = {Supply chain scheduling problem in the hospital with periodic working
time on a single machine},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {892--905},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9857-y},
doi = {10.1007/s10878-015-9857-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FanL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FavaronKS15,
author = {Odile Favaron and
Hossein Karami and
Seyed Mahmoud Sheikholeslami},
title = {Game domination subdivision number of a graph},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {109--119},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9636-6},
doi = {10.1007/s10878-013-9636-6},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FavaronKS15.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 = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FengWLC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FischerF15,
author = {Anja Fischer and
Frank Fischer},
title = {An extended approach for lifting clique tree inequalities},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {489--519},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9647-3},
doi = {10.1007/s10878-013-9647-3},
timestamp = {Tue, 09 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FischerF15.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/HaynesHMY15,
author = {Teresa W. Haynes and
Michael A. Henning and
Lucas C. van der Merwe and
Anders Yeo},
title = {Progress on the Murty-Simon Conjecture on diameter-2 critical graphs:
a survey},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {579--595},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9651-7},
doi = {10.1007/s10878-013-9651-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HaynesHMY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HoodRSW15,
author = {Simon Hood and
Daniel Recoskie and
Joe Sawada and
Dennis Wong},
title = {Snakes, coils, and single-track circuit codes with spread k},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {42--62},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9630-z},
doi = {10.1007/s10878-013-9630-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HoodRSW15.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/HuangSLD15,
author = {Hejiao Huang and
Feng Shang and
Jinling Liu and
Hongwei Du},
title = {Handling least privilege problem and role mining in {RBAC}},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {63--86},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9633-9},
doi = {10.1007/s10878-013-9633-9},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuangSLD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangTGLL15,
author = {Liqin Huang and
Weitian Tong and
Randy Goebel and
Tian Liu and
Guohui Lin},
title = {A 0.5358-approximation for Bandpass-2},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {612--626},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9656-2},
doi = {10.1007/s10878-013-9656-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuangTGLL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangZHDJ15,
author = {Yiwei Jiang and
Qinghui Zhang and
Jueliang Hu and
Jianming Dong and
Min Ji},
title = {Single-server parallel-machine scheduling with loading and unloading
times},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {201--213},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9727-z},
doi = {10.1007/s10878-014-9727-z},
timestamp = {Fri, 26 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiangZHDJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KacemKL15,
author = {Imed Kacem and
Hans Kellerer and
Yann Lanuel},
title = {Approximation algorithms for maximizing the weighted number of early
jobs on a single machine with non-availability intervals},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {403--412},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9643-7},
doi = {10.1007/s10878-013-9643-7},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KacemKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KarstOTZ15,
author = {Nathaniel J. Karst and
Jessica Oehrlein and
Denise Sakai Troxell and
Junjie Zhu},
title = {L(d, 1)-labelings of the edge-path-replacement by factorization of
graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {34--41},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9632-x},
doi = {10.1007/s10878-013-9632-x},
timestamp = {Sun, 24 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KarstOTZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KharroubiHTCC15,
author = {Fouad Kharroubi and
Jing He and
Jin Tang and
Ming Chen and
Lin Chen},
title = {Evaluation performance of genetic algorithm and tabu search algorithm
for solving the Max-RWA problem in all-optical networks},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1042--1061},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9676-y},
doi = {10.1007/s10878-013-9676-y},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KharroubiHTCC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KimHS15,
author = {Byeong Moon Kim and
Woonjae Hwang and
Byung Chul Song},
title = {Radio number for the product of a path and a complete graph},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {139--149},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9639-3},
doi = {10.1007/s10878-013-9639-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KimHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KimRS15,
author = {Byeong Moon Kim and
Yoomi Rho and
Byung Chul Song},
title = {L(1, 1)-labelling of the direct product of a complete graph and a
cycle},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {803--811},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9669-x},
doi = {10.1007/s10878-013-9669-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KimRS15.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, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KisielewiczKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LamNAH15,
author = {Nhat X. Lam and
Trac N. Nguyen and
Min Kyung An and
Dung T. Huynh},
title = {Dual power assignment optimization and fault tolerance in WSNs},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {120--138},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9637-5},
doi = {10.1007/s10878-013-9637-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LamNAH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiDLW15,
author = {Hualong Li and
Laihao Ding and
Bingqiang Liu and
Guanghui Wang},
title = {Neighbor sum distinguishing total colorings of planar graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {675--688},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9660-6},
doi = {10.1007/s10878-013-9660-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiDLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiDRY15,
author = {Jing Li and
Ming Dong and
Yijiong Ren and
Kaiqi Yin},
title = {How patient compliance impacts the recommendations for colorectal
cancer screening},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {920--937},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9849-y},
doi = {10.1007/s10878-015-9849-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiDRY15.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 = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiFLZZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiM15,
author = {Shuchao Li and
Xian Meng},
title = {Four edge-grafting theorems on the reciprocal degree distance of graphs
and their applications},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {468--488},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9649-1},
doi = {10.1007/s10878-013-9649-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZSXZ15,
author = {Beibei Li and
Zhihong Zhao and
Xuan Shen and
Cendi Xue and
Liwei Zhong},
title = {Fitting {\(\alpha\)} {\(\beta\)}-crystalline structure onto electron
microscopy based on {SO(3)} rotation group theory},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {906--919},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9858-x},
doi = {10.1007/s10878-015-9858-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiZSXZ15.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/LiuDTZ15,
author = {Jin Liu and
Zhenhua Duan and
Cong Tian and
Nan Zhang},
title = {An extended strange planet protocol},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {299--319},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9750-0},
doi = {10.1007/s10878-014-9750-0},
timestamp = {Tue, 29 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuDTZ15.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 = {Sat, 29 Aug 2020 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/LiuL15c,
author = {Peihai Liu and
Xiwen Lu},
title = {Online scheduling on two parallel machines with release dates and
delivery times},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {347--359},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9760-y},
doi = {10.1007/s10878-014-9760-y},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuL15c.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/LiuTFW15,
author = {Lili Liu and
Guochun Tang and
Baoqiang Fan and
Xingpeng Wang},
title = {Two-person cooperative games on scheduling problems in outpatient
pharmacy dispensing process},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {938--948},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9854-1},
doi = {10.1007/s10878-015-9854-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuTFW15.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, 21 Aug 2020 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 = {Thu, 18 May 2017 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 = {Fri, 03 Jan 2020 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/McCloskyAH15,
author = {Benjamin McClosky and
John D. Arellano and
Illya V. Hicks},
title = {Co-2-plex vertex partitions},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {729--746},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9664-2},
doi = {10.1007/s10878-013-9664-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/McCloskyAH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MerouaneC15,
author = {Houcine Boumediene Merouane and
Mustapha Chellali},
title = {An algorithm for the dominator chromatic number of a tree},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {27--33},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9631-y},
doi = {10.1007/s10878-013-9631-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MerouaneC15.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/PandaS15,
author = {B. S. Panda and
D. Pushparaj Shetty},
title = {Strong minimum energy 2-hop rooted topology for hierarchical wireless
sensor networks},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1077--1094},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9683-z},
doi = {10.1007/s10878-013-9683-z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PandaS15.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/PengTZ15,
author = {Yuejian Peng and
Qingsong Tang and
Cheng Zhao},
title = {On Lagrangians of r-uniform hypergraphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {812--825},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9671-3},
doi = {10.1007/s10878-013-9671-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PengTZ15.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 = {Mon, 04 May 2020 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/PooranianSAA15,
author = {Zahra Pooranian and
Mohammad Shojafar and
Jemal H. Abawajy and
Ajith Abraham},
title = {An efficient meta-heuristic algorithm for grid computing},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {413--434},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9644-6},
doi = {10.1007/s10878-013-9644-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PooranianSAA15.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 = {Tue, 06 Jun 2017 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/SheikholeslamiV15,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed Roman domination in digraphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {456--467},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9648-2},
doi = {10.1007/s10878-013-9648-2},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SheikholeslamiV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SilvaRP15,
author = {Ricardo M. A. Silva and
Mauricio G. C. Resende and
Panos M. Pardalos},
title = {A Python/C++ library for bound-constrained global optimization using
a biased random-key genetic algorithm},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {710--728},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9659-z},
doi = {10.1007/s10878-013-9659-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SilvaRP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/StepienSZ15,
author = {Zofia Stepien and
Lucjan Szymaszkiewicz and
Maciej Zwierzchowski},
title = {The Cartesian product of cycles with small 2-rainbow domination number},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {668--674},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9658-0},
doi = {10.1007/s10878-013-9658-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/StepienSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SuXSC15,
author = {Guifu Su and
Liming Xiong and
Xiaofeng Su and
Xianglian Chen},
title = {Some results on the reciprocal sum-degree distance of graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {435--446},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9645-5},
doi = {10.1007/s10878-013-9645-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SuXSC15.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/TabatabaeiG15,
author = {Azadeh Tabatabaei and
Mohammad Ghodsi},
title = {Walking in streets with minimal sensing},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {387--401},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9791-4},
doi = {10.1007/s10878-014-9791-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TabatabaeiG15.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/Wang0WP15,
author = {Zengfu Wang and
William Moran and
Xuezhi Wang and
Quan Pan},
title = {An accelerated continuous greedy algorithm for maximizing strong submodular
functions},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1107--1124},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9685-x},
doi = {10.1007/s10878-013-9685-x},
timestamp = {Mon, 02 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wang0WP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangHZZ15,
author = {Bing Wang and
Xingbao Han and
Xianxia Zhang and
Shaohua Zhang},
title = {Predictive-reactive scheduling for single surgical suite subject to
random emergency surgery},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {949--966},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9861-2},
doi = {10.1007/s10878-015-9861-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangHZZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLYWW15,
author = {Dujuan Wang and
Feng Liu and
Yunqiang Yin and
Jianjun Wang and
Yanzhang Wang},
title = {Prioritized surgery scheduling in face of surgeon tiredness and fixed
off-duty period},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {967--981},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9846-1},
doi = {10.1007/s10878-015-9846-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangLYWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangSW15,
author = {Shan Wang and
Huiqiao Su and
Guohua Wan},
title = {Resource-constrained machine scheduling with machine eligibility restriction
and its applications to surgical operations scheduling},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {982--995},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9860-3},
doi = {10.1007/s10878-015-9860-3},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangSW15.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, 10 Dec 2018 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/WenXZ15,
author = {Xingang Wen and
Yinfeng Xu and
Huili Zhang},
title = {Online traveling salesman problem with deadlines and service flexibility},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {545--562},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9654-4},
doi = {10.1007/s10878-013-9654-4},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WenXZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Worah15,
author = {Pratik Worah},
title = {Rank bounds for a hierarchy of Lov{\'{a}}sz and Schrijver},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {689--709},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9662-4},
doi = {10.1007/s10878-013-9662-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Worah15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuDWZWL15,
author = {Lidong Wu and
Hongwei Du and
Weili Wu and
Yuqing Zhu and
Ailian Wang and
Wonjun Lee},
title = {{PTAS} for routing-cost constrained minimum connected dominating set
in growth bounded graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {18--26},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9626-8},
doi = {10.1007/s10878-013-9626-8},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuDWZWL15.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 = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuDX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuL15,
author = {Bang Ye Wu and
Chen{-}Wan Lin},
title = {On the clustered Steiner tree problem},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {370--386},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9772-7},
doi = {10.1007/s10878-014-9772-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XavierPS15,
author = {Eduardo C. Xavier and
Robson R. S. Peixoto and
Jefferson L. M. da Silveira},
title = {Scheduling with task replication on desktop grids: theoretical and
experimental analysis},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {520--544},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9650-8},
doi = {10.1007/s10878-013-9650-8},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XavierPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XiaG15,
author = {Yong Xia and
Wajeb Gharibi},
title = {On improving convex quadratic programming relaxation for the quadratic
assignment problem},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {647--667},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9655-3},
doi = {10.1007/s10878-013-9655-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XiaG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Xiang15,
author = {Xiangzhong Xiang},
title = {Prompt mechanism for online auctions with multi-unit demands},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {335--346},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9754-9},
doi = {10.1007/s10878-014-9754-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Xiang15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XiaoN15,
author = {Mingyu Xiao and
Hiroshi Nagamochi},
title = {An improved exact algorithm for undirected feedback vertex set},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {214--241},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9737-x},
doi = {10.1007/s10878-014-9737-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XiaoN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XinLWZ15,
author = {Chunlin Xin and
Letu Qingge and
Jiamin Wang and
Binhai Zhu},
title = {Robust optimization for the hazardous materials transportation network
design problem},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {320--334},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9751-z},
doi = {10.1007/s10878-014-9751-z},
timestamp = {Tue, 02 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XinLWZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuH15,
author = {Easton Li Xu and
Guangyue Han},
title = {The minimum number of hubs in networks},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1196--1218},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9697-6},
doi = {10.1007/s10878-013-9697-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuH15.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/XuZ15,
author = {Yinfeng Xu and
Huili Zhang},
title = {How much the grid network and rescuers' communication can improve
the rescue efficiency in worst-case analysis},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1062--1076},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9681-1},
doi = {10.1007/s10878-013-9681-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuZ15.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 = {Tue, 06 Jun 2017 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 = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YaghiniKR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YanCWLGZ15,
author = {Jihong Yan and
Wenliang Cheng and
Chengyu Wang and
Jun Liu and
Ming Gao and
Aoying Zhou},
title = {Optimizing word set coverage for multi-event summarization},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {996--1015},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9855-0},
doi = {10.1007/s10878-015-9855-0},
timestamp = {Thu, 18 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YanCWLGZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangSGLZ15,
author = {Ying Yang and
Bing Shen and
Wei Gao and
Yong Liu and
Liwei Zhong},
title = {A surgical scheduling method considering surgeons' preferences},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1016--1026},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9853-2},
doi = {10.1007/s10878-015-9853-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangSGLZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Yu15,
author = {Sheng Yu},
title = {An optimal single-machine scheduling with linear deterioration rate
and rate-modifying activities},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {242--252},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9739-8},
doi = {10.1007/s10878-014-9739-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Yu15.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/ZhangHL15,
author = {Xin Zhang and
Jianfeng Hou and
Guizhen Liu},
title = {On total colorings of 1-planar graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {160--173},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9641-9},
doi = {10.1007/s10878-013-9641-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangHL15.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, 18 May 2017 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/ZhangWW15,
author = {Xingong Zhang and
Hui Wang and
Xingpeng Wang},
title = {Patients scheduling problems with deferred deteriorated functions},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {1027--1041},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9852-3},
doi = {10.1007/s10878-015-9852-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangWW15.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/ZhangZ15,
author = {Wenchao Zhang and
Xuding Zhu},
title = {The game Grundy indices of graphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {596--611},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9657-1},
doi = {10.1007/s10878-013-9657-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangZ15.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 = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangZDL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhengLZ15,
author = {Feifeng Zheng and
Li Luo and
E. Zhang},
title = {NF-based algorithms for online bin packing with buffer and bounded
item size},
journal = {J. Comb. Optim.},
volume = {30},
number = {2},
pages = {360--369},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9771-8},
doi = {10.1007/s10878-014-9771-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhengLZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhongT15,
author = {Liwei Zhong and
Guochun Tang},
title = {Preface},
journal = {J. Comb. Optim.},
volume = {30},
number = {4},
pages = {839--840},
year = {2015},
url = {https://doi.org/10.1007/s10878-015-9866-x},
doi = {10.1007/s10878-015-9866-x},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhongT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhouGL15,
author = {Guangyan Zhou and
Zongsheng Gao and
Jun Liu},
title = {On the constraint length of random k-CSP},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {188--200},
year = {2015},
url = {https://doi.org/10.1007/s10878-014-9731-3},
doi = {10.1007/s10878-014-9731-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhouGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuWBWJX15,
author = {Yuqing Zhu and
Weili Wu and
Yuanjun Bi and
Lidong Wu and
Yiwei Jiang and
Wen Xu},
title = {Better approximation algorithms for influence maximization in online
social networks},
journal = {J. Comb. Optim.},
volume = {30},
number = {1},
pages = {97--108},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9635-7},
doi = {10.1007/s10878-013-9635-7},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuWBWJX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/0002SWZ14,
author = {Yiqiao Wang and
Qiaojun Shu and
Jian{-}Liang Wu and
Wenwen Zhang},
title = {Acyclic edge coloring of planar graphs without a 3-cycle adjacent
to a 6-cycle},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {692--715},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9765-6},
doi = {10.1007/s10878-014-9765-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/0002SWZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AhangarHLZS14,
author = {Hossein Abdollahzadeh Ahangar and
Michael A. Henning and
Christian L{\"{o}}wenstein and
Yancai Zhao and
Vladimir Samodivkin},
title = {Signed Roman domination in graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {241--255},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9500-0},
doi = {10.1007/s10878-012-9500-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AhangarHLZS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AnnYT14,
author = {Hsing{-}Yen Ann and
Chang{-}Biau Yang and
Chiou{-}Ting Tseng},
title = {Efficient polynomial-time algorithms for the constrained {LCS} problem
with strings exclusion},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {800--813},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9588-2},
doi = {10.1007/s10878-012-9588-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AnnYT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AnthonyC14,
author = {Barbara M. Anthony and
Christine Chung},
title = {Online bottleneck matching},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {100--114},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9581-9},
doi = {10.1007/s10878-012-9581-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AnthonyC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ArmonGS14,
author = {Amitai Armon and
Iftah Gamzu and
Danny Segev},
title = {Mobile facility location: combinatorial filtering via weighted occupancy},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {358--375},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9558-8},
doi = {10.1007/s10878-012-9558-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ArmonGS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BaloghBGR14,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos and
Gerhard Reinelt},
title = {On-line bin packing with restricted repacking},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {115--131},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9489-4},
doi = {10.1007/s10878-012-9489-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BaloghBGR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BatsynGMP14,
author = {Mikhail Batsyn and
Boris Goldengorin and
Evgeny Maslov and
Panos M. Pardalos},
title = {Improvements to {MCS} algorithm for the maximum clique problem},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {397--416},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9592-6},
doi = {10.1007/s10878-012-9592-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BatsynGMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BiWZFW14,
author = {Yuanjun Bi and
Weili Wu and
Yuqing Zhu and
Lidan Fan and
Ailian Wang},
title = {A nature-inspired influence propagation model for the community expansion
problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {513--528},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9686-9},
doi = {10.1007/s10878-013-9686-9},
timestamp = {Tue, 23 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiWZFW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BillionnetEL14,
author = {Alain Billionnet and
Sourour Elloumi and
Am{\'{e}}lie Lambert},
title = {A Branch and Bound algorithm for general mixed-integer quadratic programs
based on quadratic convex relaxation},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {376--399},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9560-1},
doi = {10.1007/s10878-012-9560-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BillionnetEL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bonamy0LPP14,
author = {Marthe Bonamy and
Matthew Johnson and
Ioannis Lignos and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Reconfiguration graphs for vertex colourings of chordal and chordal
bipartite graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {132--143},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9490-y},
doi = {10.1007/s10878-012-9490-y},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bonamy0LPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ButenkoDR14,
author = {Sergiy Butenko and
Ding{-}Zhu Du and
Mauricio G. C. Resende},
title = {Preface},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {1--2},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9752-y},
doi = {10.1007/s10878-014-9752-y},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ButenkoDR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiYT14,
author = {Shuxin Cai and
Wenguo Yang and
Yaohua Tang},
title = {Approximating soft-capacitated facility location problem with uncertainty},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {496--504},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9573-9},
doi = {10.1007/s10878-012-9573-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiYT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChaluvarajuV14,
author = {B. Chaluvaraju and
K. A. Vidya},
title = {Generalized perfect domination in graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {292--301},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9510-y},
doi = {10.1007/s10878-012-9510-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChaluvarajuV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangCH14,
author = {Fei{-}Huang Chang and
Hong{-}Bin Chen and
Frank K. Hwang},
title = {Are there more almost separable partitions than separable partitions?},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {567--573},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9536-1},
doi = {10.1007/s10878-012-9536-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangCH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangCKLY14,
author = {Gerard Jennhwa Chang and
Ma{-}Lian Chia and
David Kuo and
Ji{-}Yin Lin and
Jing{-}Ho Yan},
title = {Bandwidth sums of block graphs and cacti},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {679--687},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9548-x},
doi = {10.1007/s10878-012-9548-x},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangCKLY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangKLY14,
author = {Chan{-}Wei Chang and
David Kuo and
Sheng{-}Chyang Liaw and
Jing{-}Ho Yan},
title = {F\({}_{\mbox{3}}\)-domination problem of graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {400--413},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9563-y},
doi = {10.1007/s10878-012-9563-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangKLY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenRW14,
author = {Min Chen and
Andr{\'{e}} Raspaud and
Weifan Wang},
title = {Star list chromatic number of planar subcubic graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {440--450},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9522-7},
doi = {10.1007/s10878-012-9522-7},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenZ14,
author = {Shihyen Chen and
Kaizhong Zhang},
title = {An improved algorithm for tree edit distance with applications for
{RNA} secondary structure comparison},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {778--797},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9552-1},
doi = {10.1007/s10878-012-9552-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenZZ14,
author = {Liangyu Chen and
Zhenbing Zeng and
Wei Zhou},
title = {An upper bound of Heilbronn number for eight points in triangles},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {854--874},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9585-5},
doi = {10.1007/s10878-012-9585-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenZZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengQS14,
author = {Eddie Cheng and
Ke Qiu and
Zhizhang Shen},
title = {The edge-centered surface area of the arrangement graph},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {49--64},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9590-8},
doi = {10.1007/s10878-012-9590-8},
timestamp = {Sat, 01 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChengQS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengX14,
author = {Yongxi Cheng and
Yinfeng Xu},
title = {An efficient {FPRAS} type group testing procedure to approximate the
number of defectives},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {302--314},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9516-5},
doi = {10.1007/s10878-012-9516-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChengX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CroceP14,
author = {Federico Della Croce and
Vangelis Th. Paschos},
title = {Efficient algorithms for the max k-vertex cover problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {674--691},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9575-7},
doi = {10.1007/s10878-012-9575-7},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CroceP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DingQ14,
author = {Wei Ding and
Ke Qiu},
title = {Algorithms for the minimum diameter terminal Steiner tree problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {837--853},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9591-7},
doi = {10.1007/s10878-012-9591-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DingQ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DingX14,
author = {Wei Ding and
Guoliang Xue},
title = {Minimum diameter cost-constrained Steiner trees},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {32--48},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9611-2},
doi = {10.1007/s10878-013-9611-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DingX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DinhSNT14,
author = {Thang N. Dinh and
Yilin Shen and
Dung T. Nguyen and
My T. Thai},
title = {On the approximability of positive influence dominating set in social
networks},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {487--503},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9530-7},
doi = {10.1007/s10878-012-9530-7},
timestamp = {Tue, 24 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DinhSNT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DinhTN14,
author = {Thang N. Dinh and
My T. Thai and
Hien T. Nguyen},
title = {Bound and exact methods for assessing link vulnerability in complex
networks},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {3--24},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9742-0},
doi = {10.1007/s10878-014-9742-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DinhTN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DorbecHH14,
author = {Paul Dorbec and
Bert L. Hartnell and
Michael A. Henning},
title = {Paired versus double domination in {K} 1, r -free graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {688--694},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9547-y},
doi = {10.1007/s10878-012-9547-y},
timestamp = {Mon, 07 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DorbecHH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DuX14,
author = {Hai Du and
Yinfeng Xu},
title = {An approximation algorithm for k-center problem on a convex polygon},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {504--518},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9532-5},
doi = {10.1007/s10878-012-9532-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DuX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EpsteinKS14,
author = {Leah Epstein and
Elena Kleiman and
Rob van Stee},
title = {The cost of selfishness for maximizing the minimum load on uniformly
related machines},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {767--777},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9555-y},
doi = {10.1007/s10878-012-9555-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EpsteinKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EpsteinZ14,
author = {Leah Epstein and
Hanan Zebedat{-}Haider},
title = {Online scheduling with rejection and reordering: exact algorithms
for unit size jobs},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {875--892},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9593-5},
doi = {10.1007/s10878-012-9593-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EpsteinZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EstesW14,
author = {John W. Estes and
Bing Wei},
title = {Sharp bounds of the Zagreb indices of k-trees},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {271--291},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9515-6},
doi = {10.1007/s10878-012-9515-6},
timestamp = {Thu, 08 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/EstesW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EtoGM14,
author = {Hiroshi Eto and
Fengrui Guo and
Eiji Miyano},
title = {Distance- {\textdollar}{\textdollar}d{\textdollar}{\textdollar} independent
set problems for bipartite and chordal graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {88--99},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9594-4},
doi = {10.1007/s10878-012-9594-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EtoGM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FanLWBWT14,
author = {Lidan Fan and
Zaixin Lu and
Weili Wu and
Yuanjun Bi and
Ailian Wang and
Bhavani M. Thuraisingham},
title = {An individual-based model of information diffusion combining friends'
influence},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {529--539},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9677-x},
doi = {10.1007/s10878-013-9677-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FanLWBWT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FangW14,
author = {Zheng Fang and
Jie Wang},
title = {Efficient identifications of structural similarities for graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {209--220},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9505-8},
doi = {10.1007/s10878-012-9505-8},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FangW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FavaronKS14,
author = {Odile Favaron and
Hossein Karami and
Seyed Mahmoud Sheikholeslami},
title = {On the total outer-connected domination in graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {451--461},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9531-6},
doi = {10.1007/s10878-012-9531-6},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FavaronKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GevezesP14,
author = {Theodoros P. Gevezes and
Leonidas S. Pitsoulis},
title = {Recognition of overlap graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {25--37},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9663-3},
doi = {10.1007/s10878-013-9663-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GevezesP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GhannadpourNT14,
author = {Seyed Farid Ghannadpour and
Siamak Noori and
Reza Tavakkoli{-}Moghaddam},
title = {A multi-objective vehicle routing and scheduling problem with uncertainty
in customers' request and priority},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {414--446},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9564-x},
doi = {10.1007/s10878-012-9564-x},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GhannadpourNT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GreethamSG14,
author = {Danica Vukadinovic Greetham and
Zhivko Stoyanov and
Peter Grindrod},
title = {On the radius of centrality in evolving communication networks},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {540--560},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9726-0},
doi = {10.1007/s10878-014-9726-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GreethamSG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuntherKM14,
author = {Elisabeth G{\"{u}}nther and
Felix G. K{\"{o}}nig and
Nicole Megow},
title = {Scheduling and packing malleable and parallel tasks with precedence
constraints of bounded width},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {164--181},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9498-3},
doi = {10.1007/s10878-012-9498-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuntherKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HallawayKY14,
author = {Michael Hallaway and
Cong X. Kang and
Eunjeong Yi},
title = {On metric dimension of permutation graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {814--826},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9587-3},
doi = {10.1007/s10878-012-9587-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HallawayKY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanYLJL14,
author = {Meng Han and
Mingyuan Yan and
Jinbao Li and
Shouling Ji and
Yingshu Li},
title = {Neighborhood-based uncertainty generation in social networks},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {561--576},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9684-y},
doi = {10.1007/s10878-013-9684-y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HanYLJL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HigashikawaKLT14,
author = {Yuya Higashikawa and
Naoki Katoh and
Stefan Langerman and
Shin{-}ichi Tanigawa},
title = {Online graph exploration algorithms for cycles and trees by multiple
searchers},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {480--495},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9571-y},
doi = {10.1007/s10878-012-9571-y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HigashikawaKLT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HirschSMD14,
author = {Michael J. Hirsch and
Daniel E. Schroeder and
Alvaro Maggiar and
Irina S. Dolinskaya},
title = {Multi-depot vessel routing problem in a direction dependent wavefield},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {38--57},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9732-2},
doi = {10.1007/s10878-014-9732-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HirschSMD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HsuC14,
author = {Hsiang{-}Chun Hsu and
Gerard Jennhwa Chang},
title = {Graphs with small balanced decomposition numbers},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {505--510},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9576-6},
doi = {10.1007/s10878-012-9576-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HsuC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuX14,
author = {Fu{-}Tao Hu and
Jun{-}Ming Xu},
title = {Total and paired domination numbers of toroidal meshes},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {369--378},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9519-2},
doi = {10.1007/s10878-012-9519-2},
timestamp = {Wed, 27 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HuX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ItoD14,
author = {Takehiro Ito and
Erik D. Demaine},
title = {Approximability of the subset sum reconfiguration problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {639--654},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9562-z},
doi = {10.1007/s10878-012-9562-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ItoD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JaradatAA14,
author = {Ghaith M. Jaradat and
Masri Ayob and
Zulkifli Ahmad},
title = {On the performance of Scatter Search for post-enrolment course timetabling
problems},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {417--439},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9521-8},
doi = {10.1007/s10878-012-9521-8},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JaradatAA14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangWH14,
author = {Yiwei Jiang and
Zewei Weng and
Jueliang Hu},
title = {Algorithms with limited number of preemptions for scheduling on parallel
machines},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {711--723},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9545-0},
doi = {10.1007/s10878-012-9545-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiangWH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JinZ14,
author = {Zemin Jin and
Peipei Zhu},
title = {Heterochromatic tree partition number in complete multipartite graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {321--340},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9557-9},
doi = {10.1007/s10878-012-9557-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JinZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KanjX14,
author = {Iyad A. Kanj and
Ge Xia},
title = {On certain geometric properties of the Yao-Yao graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {78--87},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9570-z},
doi = {10.1007/s10878-012-9570-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KanjX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KavithaNN14,
author = {Telikepalli Kavitha and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Popularity at minimum cost},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {574--596},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9537-0},
doi = {10.1007/s10878-012-9537-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KavithaNN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KimLALTO14,
author = {Donghyun Kim and
Deying Li and
Omid Asgari and
Yingshu Li and
Alade O. Tokuta and
Heekuck Oh},
title = {Computing an effective decision making group of a society using social
network analysis},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {577--587},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9687-8},
doi = {10.1007/s10878-013-9687-8},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KimLALTO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KochenbergerHGLLWW14,
author = {Gary A. Kochenberger and
Jin{-}Kao Hao and
Fred W. Glover and
Mark W. Lewis and
Zhipeng L{\"{u}} and
Haibo Wang and
Yang Wang},
title = {The unconstrained binary quadratic programming problem: a survey},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {58--81},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9734-0},
doi = {10.1007/s10878-014-9734-0},
timestamp = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KochenbergerHGLLWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kochol14,
author = {Martin Kochol},
title = {Linear algebraic approach to an edge-coloring result},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {341--347},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9561-0},
doi = {10.1007/s10878-012-9561-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kochol14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kosmrlj14,
author = {Gasper Kosmrlj},
title = {Realizations of the game domination number},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {447--461},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9572-x},
doi = {10.1007/s10878-012-9572-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kosmrlj14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KungLH14,
author = {Tzu{-}Liang Kung and
Cheng{-}Kuan Lin and
Lih{-}Hsing Hsu},
title = {On the maximum number of fault-free mutually independent Hamiltonian
cycles in the faulty hypercube},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {328--344},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9528-1},
doi = {10.1007/s10878-012-9528-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KungLH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KwakC14,
author = {Woo{-}Lahm Kwak and
Soo Y. Chang},
title = {Order consolidation for hierarchical product lines},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {597--608},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9538-z},
doi = {10.1007/s10878-012-9538-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KwakC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LevinY14,
author = {Asaf Levin and
Uri Yovel},
title = {Local search algorithms for multiple-depot vehicle routing and for
multiple traveling salesman problems with proved performance guarantees},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {726--747},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9580-x},
doi = {10.1007/s10878-012-9580-x},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LevinY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiDXX14,
author = {Yu Li and
Donglei Du and
Naihua Xiu and
Dachuan Xu},
title = {A unified dual-fitting approximation algorithm for the facility location
problems with linear/submodular penalties},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {609--620},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9540-5},
doi = {10.1007/s10878-012-9540-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiDXX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiL14,
author = {Yusheng Li and
Qizhong Lin},
title = {Lower bounds for independence numbers of some locally sparse graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {717--725},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9578-4},
doi = {10.1007/s10878-012-9578-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLL14,
author = {Jianping Li and
Weidong Li and
Junran Lichen},
title = {The subdivision-constrained routing requests problem},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {152--163},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9497-4},
doi = {10.1007/s10878-012-9497-4},
timestamp = {Tue, 14 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLLX14,
author = {Haiyan Li and
Yanting Liang and
Muhuo Liu and
Baogang Xu},
title = {On minimum balanced bipartitions of triangle-free graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {557--566},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9539-y},
doi = {10.1007/s10878-012-9539-y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiLLX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZDL14,
author = {Deying Li and
Qinghua Zhu and
Hongwei Du and
Jianzhong Li},
title = {An improved distributed data aggregation scheduling in wireless sensor
networks},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {221--240},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9504-9},
doi = {10.1007/s10878-012-9504-9},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiZDL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangZ14,
author = {Zhewei Liang and
Kaizhong Zhang},
title = {Algorithms for local similarity between forests},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {14--31},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9613-0},
doi = {10.1007/s10878-013-9613-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LibertiM14,
author = {Leo Liberti and
Fabrizio Marinelli},
title = {Mathematical programming: Turing completeness and applications to
software analysis},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {82--104},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9715-3},
doi = {10.1007/s10878-014-9715-3},
timestamp = {Sun, 15 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LibertiM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lin14,
author = {Guohui Lin},
title = {Preface},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {1--2},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9600-5},
doi = {10.1007/s10878-013-9600-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Lin14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuZ14,
author = {Hong Liu and
Peng Zhang},
title = {On the generalized multiway cut in trees problem},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {65--77},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9565-9},
doi = {10.1007/s10878-012-9565-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LozinP14,
author = {Vadim V. Lozin and
Christopher Purcell},
title = {Coloring vertices of claw-free graphs in three colors},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {462--479},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9577-5},
doi = {10.1007/s10878-012-9577-5},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LozinP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuZ14,
author = {Fuliang Lu and
Lianzhu Zhang},
title = {The Pfaffian property of Cartesian products of graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {530--540},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9533-4},
doi = {10.1007/s10878-012-9533-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LuZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaD14,
author = {Qian Ma and
Zhenhua Duan},
title = {Linear time-dependent constraints programming with {MSVL}},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {724--766},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9551-2},
doi = {10.1007/s10878-012-9551-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaZH14,
author = {Dengju Ma and
Hengfeng Zhu and
Jianbao He},
title = {{\textdollar}{\textdollar}{\textbackslash}lambda {\textdollar}{\textdollar}
-numbers of several classes of snarks},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {787--799},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9589-1},
doi = {10.1007/s10878-012-9589-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaZH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MahadeokarS14,
author = {Jay Mahadeokar and
Sanjeev Saxena},
title = {Faster algorithm to find anti-risk path between two nodes of an undirected
graph},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {798--807},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9553-0},
doi = {10.1007/s10878-012-9553-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MahadeokarS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Malyshev14,
author = {Dmitriy S. Malyshev},
title = {Boundary graph classes for some maximum induced subgraph problems},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {345--354},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9529-0},
doi = {10.1007/s10878-012-9529-0},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Malyshev14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MiaoBP14,
author = {Zhuqi Miao and
Balabhaskar Balasundaram and
Eduardo L. Pasiliao},
title = {An exact algorithm for the maximum probabilistic clique problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {105--120},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9699-4},
doi = {10.1007/s10878-013-9699-4},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MiaoBP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Mollard14,
author = {Michel Mollard},
title = {The domination number of Cartesian product of two directed paths},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {144--151},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9494-7},
doi = {10.1007/s10878-012-9494-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Mollard14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MorrisonSJ14,
author = {David R. Morrison and
Edward C. Sewell and
Sheldon H. Jacobson},
title = {Characteristics of the maximal independent set {ZDD}},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {121--139},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9722-4},
doi = {10.1007/s10878-014-9722-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MorrisonSJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NguyenTD14,
author = {Duc Manh Nguyen and
Hoai An Le Thi and
Tao Pham Dinh},
title = {Solving the Multidimensional Assignment Problem by a Cross-Entropy
method},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {808--823},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9554-z},
doi = {10.1007/s10878-012-9554-z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NguyenTD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PandaP14,
author = {B. S. Panda and
S. Paul},
title = {Hardness results and approximation algorithm for total liar's domination
in graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {4},
pages = {643--662},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9542-3},
doi = {10.1007/s10878-012-9542-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PandaP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PastukhovVBP14,
author = {Grigory Pastukhov and
Alexander Veremyev and
Vladimir Boginski and
Eduardo L. Pasiliao},
title = {Optimal design and augmentation of strongly attack-tolerant two-hop
clusters in directed networks},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {462--486},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9523-6},
doi = {10.1007/s10878-012-9523-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PastukhovVBP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Przybylo14,
author = {Jakub Przybylo},
title = {On colour-blind distinguishing colour pallets in regular graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {2},
pages = {348--357},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9556-x},
doi = {10.1007/s10878-012-9556-x},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Przybylo14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/QiangPWZZLW14,
author = {Yan Qiang and
Bo Pei and
Weili Wu and
Juanjuan Zhao and
Xiaolong Zhang and
Yue Li and
Lidong Wu},
title = {Improvement of path analysis algorithm in social networks based on
HBase},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {588--599},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9675-z},
doi = {10.1007/s10878-013-9675-z},
timestamp = {Mon, 26 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/QiangPWZZLW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RoqueFF14,
author = {Lu{\'{\i}}s A. C. Roque and
Dalila B. M. M. Fontes and
Fernando A. C. C. Fontes},
title = {A hybrid biased random key genetic algorithm approach for the unit
commitment problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {140--166},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9710-8},
doi = {10.1007/s10878-014-9710-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/RoqueFF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RyszMKP14,
author = {Maciej Rysz and
Mohammad Mirghorbani and
Pavlo A. Krokhmal and
Eduardo L. Pasiliao},
title = {On risk-averse maximum weighted subgraph problems},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {167--185},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9718-0},
doi = {10.1007/s10878-014-9718-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RyszMKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShenDTN14,
author = {Yilin Shen and
Thang N. Dinh and
My T. Thai and
Hien T. Nguyen},
title = {Staying safe and visible via message sharing in online social networks},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {186--217},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9667-z},
doi = {10.1007/s10878-013-9667-z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ShenDTN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/StepienZ14,
author = {Zofia Stepien and
Maciej Zwierzchowski},
title = {2-Rainbow domination number of Cartesian products: {\textdollar}{\textdollar}C{\_}\{n\}{\textbackslash}square
C{\_}\{3\}{\textdollar}{\textdollar} and {\textdollar}{\textdollar}C{\_}\{n\}{\textbackslash}square
C{\_}\{5\}{\textdollar}{\textdollar}},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {748--755},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9582-8},
doi = {10.1007/s10878-012-9582-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/StepienZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ThaiD14,
author = {My T. Thai and
Thang N. Dinh},
title = {Preface},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {511--512},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9770-9},
doi = {10.1007/s10878-014-9770-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ThaiD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TsyurmastoZU14,
author = {Peter Tsyurmasto and
Michael Zabarankin and
Stan Uryasev},
title = {Value-at-risk support vector machine: stability to outliers},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {218--232},
year = {2014},
url = {https://doi.org/10.1007/s10878-013-9678-9},
doi = {10.1007/s10878-013-9678-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TsyurmastoZU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ValsecchiVM14,
author = {Andrea Valsecchi and
Leonardo Vanneschi and
Giancarlo Mauri},
title = {A study of search algorithms' optimization speed},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {256--270},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9514-7},
doi = {10.1007/s10878-012-9514-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ValsecchiVM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/VeremyevPP14,
author = {Alexander Veremyev and
Oleg A. Prokopyev and
Eduardo L. Pasiliao},
title = {An integer programming framework for critical elements detection in
graphs},
journal = {J. Comb. Optim.},
volume = {28},
number = {1},
pages = {233--273},
year = {2014},
url = {https://doi.org/10.1007/s10878-014-9730-4},
doi = {10.1007/s10878-014-9730-4},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/VeremyevPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2021-01-19 07:58 CET 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
the dblp computer science bibliography is funded by:
