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/jco41.bht:"
download as .bib file
@article{DBLP:journals/jco/AlexandrinoMLD21,
author = {Alexsandro Oliveira Alexandrino and
Guilherme Henrique Santos Miranda and
Carla Negri Lintzmayer and
Zanoni Dias},
title = {Length-weighted {\(\lambda\)}-rearrangement distance},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {579--602},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00673-2},
doi = {10.1007/S10878-020-00673-2},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AlexandrinoMLD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ban21,
author = {Ha{-}Bang Ban},
title = {A metaheuristic for the delivery man problem with time windows},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {794--816},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00716-2},
doi = {10.1007/S10878-021-00716-2},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ban21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BohraB21,
author = {Navdeep Bohra and
Vishal Bhatnagar},
title = {Group level social media popularity prediction by {MRGB} and Adam
optimization},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {328--347},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00684-z},
doi = {10.1007/S10878-020-00684-Z},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BohraB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BorgwardtP21,
author = {Steffen Borgwardt and
Stephan Patterson},
title = {On the computational complexity of finding a sparse Wasserstein barycenter},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {736--761},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00713-5},
doi = {10.1007/S10878-021-00713-5},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BorgwardtP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenCLWZ21,
author = {Yong Chen and
Zhi{-}Zhong Chen and
Guohui Lin and
Lusheng Wang and
An Zhang},
title = {A randomized approximation algorithm for metric triangle packing},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {12--27},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00660-7},
doi = {10.1007/S10878-020-00660-7},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenCLWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChoiP21,
author = {Byung{-}Cheon Choi and
Myoung{-}Ju Park},
title = {Single-machine scheduling with periodic due dates to minimize the
total earliness and tardy penalty},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {781--793},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00714-4},
doi = {10.1007/S10878-021-00714-4},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChoiP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CruzMR21,
author = {Roberto Cruz and
Juan Daniel Monsalve and
Juan Rada},
title = {The balanced double star has maximum exponential second Zagreb index},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {544--552},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00696-3},
doi = {10.1007/S10878-021-00696-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CruzMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DarabiAKD21,
author = {Hamid Darabi and
Yaser Alizadeh and
Sandi Klavzar and
Kinkar Chandra Das},
title = {On the relation between Wiener index and eccentricity of a graph},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {817--829},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00724-2},
doi = {10.1007/S10878-021-00724-2},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DarabiAKD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DavilaH21,
author = {Randy Davila and
Michael A. Henning},
title = {Zero forcing versus domination in cubic graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {553--577},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00692-z},
doi = {10.1007/S10878-020-00692-Z},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DavilaH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DettlaffLR21,
author = {Magda Dettlaff and
Magdalena Lemanska and
Juan A. Rodr{\'{\i}}guez{-}Vel{\'{a}}zquez},
title = {Secure Italian domination in graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {56--72},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00658-1},
doi = {10.1007/S10878-020-00658-1},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DettlaffLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DondiHMZ21,
author = {Riccardo Dondi and
Mohammad Mehdi Hosseinzadeh and
Giancarlo Mauri and
Italo Zoppis},
title = {Top-k overlapping densest subgraphs: approximation algorithms and
computational complexity},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {80--104},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00664-3},
doi = {10.1007/S10878-020-00664-3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DondiHMZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EkimSS21,
author = {T{\'{\i}}naz Ekim and
Mordechai Shalom and
Oylum Seker},
title = {The complexity of subtree intersection representation of chordal graphs
and linear time chordal graph generation},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {710--735},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00712-6},
doi = {10.1007/S10878-021-00712-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EkimSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Furuya21,
author = {Michitaka Furuya},
title = {A continuous generalization of domination-like invariants},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {905--922},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00725-1},
doi = {10.1007/S10878-021-00725-1},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Furuya21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaoFY21,
author = {Hong Gao and
Tingting Feng and
Yuansheng Yang},
title = {Italian domination in the Cartesian product of paths},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {526--543},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00694-x},
doi = {10.1007/S10878-020-00694-X},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GaoFY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GorgiOSH21,
author = {Abbass Gorgi and
Mourad El Ouali and
Anand Srivastav and
Mohamed Hachimi},
title = {Approximation algorithm for the multicovering problem},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {433--450},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00688-9},
doi = {10.1007/S10878-020-00688-9},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GorgiOSH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GurskiKR21,
author = {Frank Gurski and
Dominique Komander and
Carolin Rehs},
title = {On characterizations for subclasses of directed co-graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {234--266},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00670-5},
doi = {10.1007/S10878-020-00670-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GurskiKR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HassaniB21,
author = {Mohammad Reza Hassani and
Javad Behnamian},
title = {A scenario-based robust optimization with a pessimistic approach for
nurse rostering problem},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {143--169},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00667-0},
doi = {10.1007/S10878-020-00667-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HassaniB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HaynesH21,
author = {Teresa W. Haynes and
Michael A. Henning},
title = {Bounds on the semipaired domination number of graphs with minimum
degree at least two},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {451--486},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00687-w},
doi = {10.1007/S10878-020-00687-W},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HaynesH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeSHSZH21,
author = {Zaobo He and
Akshita Maradapu Vera Venkata Sai and
Yan Huang and
Daehee Seo and
Hanzhou Zhang and
Qilong Han},
title = {Differentially private approximate aggregation based on feature selection},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {318--327},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00666-1},
doi = {10.1007/S10878-020-00666-1},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeSHSZH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeYNC21,
author = {Ruyan He and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {Two-agent preemptive Pareto-scheduling to minimize the number of tardy
jobs and total late work},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {504--525},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00697-2},
doi = {10.1007/S10878-021-00697-2},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeYNC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Hernandez-Ortiz21,
author = {Rangel Hern{\'{a}}ndez{-}Ortiz and
Luis Pedro Montejano and
Juan Alberto Rodr{\'{\i}}guez{-}Vel{\'{a}}zquez},
title = {Secure domination in rooted product graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {401--413},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00679-w},
doi = {10.1007/S10878-020-00679-W},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Hernandez-Ortiz21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Khalilpourazari21,
author = {Soheyl Khalilpourazari and
Seyed Hamid Reza Pasandideh},
title = {Designing emergency flood evacuation plans using robust optimization
and artificial intelligence},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {640--677},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00699-0},
doi = {10.1007/S10878-021-00699-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Khalilpourazari21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiY21,
author = {Wenjie Li and
Jinjiang Yuan},
title = {Single-machine online scheduling of jobs with non-delayed processing
constraint},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {830--843},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00722-4},
doi = {10.1007/S10878-021-00722-4},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL21,
author = {Ke Liu and
Mei Lu},
title = {Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {923--933},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00703-7},
doi = {10.1007/S10878-021-00703-7},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuYW21,
author = {Xianliang Liu and
Zishen Yang and
Wei Wang},
title = {The t-latency bounded strong target set selection problem in some
kinds of special family of graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {105--117},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00671-4},
doi = {10.1007/S10878-020-00671-4},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuYW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuZX21,
author = {Henan Liu and
Huili Zhang and
Yi Xu},
title = {The m-Steiner Traveling Salesman Problem with online edge blockages},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {844--860},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00720-6},
doi = {10.1007/S10878-021-00720-6},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuZX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuF21,
author = {Jinn Lu and
Hung{-}Lin Fu},
title = {Quaternary splitting algorithm in group testing},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {73--79},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00661-6},
doi = {10.1007/S10878-020-00661-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuZ21,
author = {Yong Lu and
Qiannan Zhou},
title = {On sufficient topological indices conditions for properties of graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {487--503},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00700-w},
doi = {10.1007/S10878-021-00700-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LvW21,
author = {Wei Lv and
Chenchen Wu},
title = {An LP-rounding based algorithm for a capacitated uniform facility
location problem with penalties},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {888--904},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00726-0},
doi = {10.1007/S10878-021-00726-0},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LvW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lyu21,
author = {Zhenhua Lyu},
title = {Digraphs that contain at most t distinct walks of a given length with
the same endpoints},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {762--779},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00718-0},
doi = {10.1007/S10878-021-00718-0},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Lyu21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MorMS21,
author = {Baruch Mor and
Gur Mosheiov and
Dana Shapira},
title = {Single machine lot scheduling with optional job-rejection},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {1--11},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00651-8},
doi = {10.1007/S10878-020-00651-8},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MorMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NiD21,
author = {Qiufen Ni and
Hongwei Du},
title = {On strict submodularity of social influence},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {348--356},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00683-0},
doi = {10.1007/S10878-020-00683-0},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NiD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NiGHWJ21,
author = {Qiufen Ni and
Smita Ghosh and
Chuanhe Huang and
Weili Wu and
Rong Jin},
title = {Discount allocation for cost minimization in online social networks},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {213--233},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00674-1},
doi = {10.1007/S10878-020-00674-1},
timestamp = {Thu, 16 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NiGHWJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OliveiraM21,
author = {Luttiely Santos Oliveira and
Ricardo Luiz Machado},
title = {Application of optimization methods in the closed-loop supply chain:
a literature review},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {357--400},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00677-y},
doi = {10.1007/S10878-020-00677-Y},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/OliveiraM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Pandit21,
author = {Supantha Pandit},
title = {Dominating set of rectangles intersecting a straight line},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {414--432},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00685-y},
doi = {10.1007/S10878-020-00685-Y},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Pandit21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PengLL21,
author = {Anzhen Peng and
Longcheng Liu and
Weifeng Lin},
title = {Improved approximation algorithms for two-stage flexible flow shop
scheduling},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {28--42},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00657-2},
doi = {10.1007/S10878-020-00657-2},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PengLL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PoureidiGF21,
author = {Abolfazl Poureidi and
Mehrdad Ghaznavi and
Jafar Fathali},
title = {Algorithmic complexity of outer independent Roman domination and outer
independent total Roman domination},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {304--317},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00682-1},
doi = {10.1007/S10878-020-00682-1},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PoureidiGF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RajalakshmiD21,
author = {J. Rajalakshmi and
S. Durairaj},
title = {Application of multi-objective optimization algorithm for siting and
sizing of distributed generations in distribution networks},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {267--289},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00681-2},
doi = {10.1007/S10878-020-00681-2},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/RajalakshmiD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ravelo21,
author = {Santiago Vald{\'{e}}s Ravelo},
title = {Minimum constellation covers: hardness, approximability and polynomial
cases},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {603--624},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00698-1},
doi = {10.1007/S10878-021-00698-1},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Ravelo21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShiYKW21,
author = {Majun Shi and
Zishen Yang and
Donghyun Kim and
Wei Wang},
title = {Non-monotone submodular function maximization under k-system constraint},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {128--142},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00672-3},
doi = {10.1007/S10878-020-00672-3},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ShiYKW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangCJL21,
author = {Ji{-}Bo Wang and
Bo Cui and
Ping Ji and
Weiwei Liu},
title = {Research on single-machine scheduling with position-dependent weights
and past-sequence-dependent delivery times},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {290--303},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00676-z},
doi = {10.1007/S10878-020-00676-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangCJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangG21,
author = {Gang Wang and
You Gao},
title = {New construction of error-correcting pooling designs from singular
linear spaces over finite fields},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {197--212},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00675-0},
doi = {10.1007/S10878-020-00675-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangGZZ21,
author = {Hui Wang and
Xiucui Guan and
Qiao Zhang and
Binwu Zhang},
title = {Capacitated inverse optimal value problem on minimum spanning tree
under bottleneck Hamming distance},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {861--887},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00721-5},
doi = {10.1007/S10878-021-00721-5},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangGZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLHLWG21,
author = {Xiaozhi Wang and
Xianyue Li and
Bo Hou and
Wen Liu and
Lidong Wu and
Suogang Gao},
title = {A greedy algorithm for the fault-tolerant outer-connected dominating
set problem},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {118--127},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00668-z},
doi = {10.1007/S10878-020-00668-Z},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangLHLWG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WeiSTYR21,
author = {Qi Wei and
Jie Sun and
Xuehou Tan and
Xiaolin Yao and
Yonggong Ren},
title = {The simple grid polygon exploration problem},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {625--639},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00705-5},
doi = {10.1007/S10878-021-00705-5},
timestamp = {Tue, 12 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WeiSTYR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XiL21,
author = {Wenying Xi and
Wensong Lin},
title = {On maximum P\({}_{\mbox{3}}\)-packing in claw-free subcubic graphs},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {694--709},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00708-2},
doi = {10.1007/S10878-021-00708-2},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XiL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Yang0Y21,
author = {Jinling Yang and
Ligong Wang and
Xiuwen Yang},
title = {Some mixed graphs with H-rank 4, 6 or 8},
journal = {J. Comb. Optim.},
volume = {41},
number = {3},
pages = {678--693},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00704-6},
doi = {10.1007/S10878-021-00704-6},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Yang0Y21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangWK21,
author = {Zishen Yang and
Wei Wang and
Donghyun Kim},
title = {On multi-path routing for reliable communications in failure interdependent
complex networks},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {170--196},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00665-2},
doi = {10.1007/S10878-020-00665-2},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/YangWK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangXGZ21,
author = {Ruiqi Yang and
Dachuan Xu and
Longkun Guo and
Dongmei Zhang},
title = {Sequence submodular maximization meets streaming},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {43--55},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00662-5},
doi = {10.1007/S10878-020-00662-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangXGZ21.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-03 14:16 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:
