Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jco/jco33.bht:"
download as .bib file
@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/BrownYZP17,
author = {Peter Brown and
Yuedong Yang and
Yaoqi Zhou and
Wayne J. 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 = {Sun, 02 Oct 2022 01:00:00 +0200},
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/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/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 = {Tue, 21 Mar 2023 00:00:00 +0100},
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 = {Sun, 02 Oct 2022 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/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 = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLLM17.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/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 = {Thu, 14 Oct 2021 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/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 = {Sun, 02 Oct 2022 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/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 = {Mon, 28 Aug 2023 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/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/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 = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DuartePRS17.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/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/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/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/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, 25 Aug 2022 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/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/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 = {Thu, 14 Oct 2021 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/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 = {Mon, 14 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiQWY17.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/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/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 = {Sun, 22 Oct 2023 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 = {Sun, 02 Oct 2022 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/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/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/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 = {Thu, 23 Jun 2022 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, 14 Oct 2021 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 = {Thu, 14 Oct 2021 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/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/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/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 Oct 2022 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/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/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/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/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 = {Wed, 13 Jul 2022 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, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangLGZWG17.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/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/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 = {Mon, 28 Aug 2023 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/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, 14 Oct 2021 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/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 = {Mon, 21 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZakouniLK17.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/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 = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangXWD17.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}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-06 16:12 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
