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/jco16.bht:"
download as .bib file
@article{DBLP:journals/jco/AlthausC08,
author = {Ernst Althaus and
Stefan Canzar},
title = {A Lagrangian relaxation approach for the multiple sequence alignment
problem},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {127--154},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9139-z},
doi = {10.1007/S10878-008-9139-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AlthausC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AvisK08,
author = {David Avis and
Bohdan Kaluzny},
title = {Computing monotone disjoint paths on polytopes},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {328--343},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9151-3},
doi = {10.1007/S10878-008-9151-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AvisK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Behle08,
author = {Markus Behle},
title = {On threshold BDDs and the optimal variable ordering problem},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {107--118},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9123-z},
doi = {10.1007/S10878-007-9123-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Behle08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BremnerDS08,
author = {David Bremner and
Antoine Deza and
Michael Soltys},
title = {Foreword: selected papers from the Franco-Canadian workshop on combinatorial
algorithms},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {323},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9155-z},
doi = {10.1007/S10878-008-9155-Z},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BremnerDS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CardinalFJ08,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Minimum entropy coloring},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {361--377},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9152-2},
doi = {10.1007/S10878-008-9152-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CardinalFJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DorbecHR08,
author = {Paul Dorbec and
Michael A. Henning and
Douglas F. Rall},
title = {On the upper total domination number of Cartesian products of graphs},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {68--80},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9099-8},
doi = {10.1007/S10878-007-9099-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DorbecHR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DressXZ08,
author = {Andreas W. M. Dress and
Yinfeng Xu and
Binhai Zhu},
title = {Preface},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {97--98},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9166-9},
doi = {10.1007/S10878-008-9166-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DressXZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FungPZ08,
author = {Stanley P. Y. Fung and
Chung Keung Poon and
Feifeng Zheng},
title = {Online interval scheduling: randomized and multiprocessor cases},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {248--262},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9131-z},
doi = {10.1007/S10878-007-9131-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FungPZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Gassner08,
author = {Elisabeth Gassner},
title = {The inverse 1-maxian problem with edge length modification},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {50--67},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9098-9},
doi = {10.1007/S10878-007-9098-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Gassner08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HarutyunyanM08,
author = {Hovhannes A. Harutyunyan and
Edward Maraachlian},
title = {On broadcasting in unicyclic graphs},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {307--322},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9160-2},
doi = {10.1007/S10878-008-9160-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HarutyunyanM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HasanJC08,
author = {Mohammad Khairul Hasan and
Hyunwoo Jung and
Kyung{-}Yong Chwa},
title = {Approximation algorithms for connected facility location problems},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {155--172},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9130-0},
doi = {10.1007/S10878-007-9130-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HasanJC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Irving08,
author = {Robert W. Irving},
title = {Stable matching problems with exchange restrictions},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {344--360},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9153-1},
doi = {10.1007/S10878-008-9153-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Irving08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/IrvingM08,
author = {Robert W. Irving and
David F. Manlove},
title = {Approximation algorithms for hard variants of the stable marriage
and hospitals/residents problems},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {279--292},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9133-x},
doi = {10.1007/S10878-007-9133-X},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/IrvingM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Jiang08,
author = {Yiwei Jiang},
title = {Online scheduling on parallel machines with two GoS levels},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {28--38},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9095-z},
doi = {10.1007/S10878-007-9095-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Jiang08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangZT08,
author = {Yiwei Jiang and
An Zhang and
Zhiyi Tan},
title = {Online coupon consumption problem},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {1--15},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9091-3},
doi = {10.1007/S10878-007-9091-3},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JiangZT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LedergerberD08,
author = {Christian Ledergerber and
Christophe Dessimoz},
title = {Alignments with non-overlapping moves, inversions and tandem duplications
in \emph{O} {(} \emph{n} \({}^{\mbox{4}}\)) time},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {263--278},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9132-y},
doi = {10.1007/S10878-007-9132-Y},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LedergerberD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lefmann08,
author = {Hanno Lefmann},
title = {Point sets in the unit square and large areas of convex hulls of subsets
of points},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {182--195},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9168-7},
doi = {10.1007/S10878-008-9168-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Lefmann08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinC08,
author = {Guohui Lin and
Zhipeng Cai},
title = {Editorial, {COCOON} 2007 special issue},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {197},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9167-8},
doi = {10.1007/S10878-008-9167-8},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinLX08,
author = {Mingen Lin and
Zhiyong Lin and
Jinhui Xu},
title = {Almost optimal solutions for bin coloring problems},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {16--27},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9094-0},
doi = {10.1007/S10878-007-9094-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinLX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuSB08,
author = {Chunmei Liu and
Yinglei Song and
Legand L. Burge III},
title = {Parameterized lower bound and inapproximability of polylogarithmic
string barcoding},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {39--49},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9097-x},
doi = {10.1007/S10878-007-9097-X},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuSB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuoAV08,
author = {Chaomin Luo and
Miguel F. Anjos and
Anthony Vannelli},
title = {A nonlinear optimization methodology for {VLSI} fixed-outline floorplanning},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {378--401},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9148-y},
doi = {10.1007/S10878-008-9148-Y},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuoAV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaXZ08,
author = {Bin Ma and
Lei Xin and
Kaizhong Zhang},
title = {A new quartet approach for reconstructing phylogenetic trees: quartet
joining method},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {293--306},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9145-1},
doi = {10.1007/S10878-008-9145-1},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MaXZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MinP08,
author = {Manki Min and
Panos M. Pardalos},
title = {OMEGa: an optimistic most energy gain method for minimum energy multicasting
in wireless ad hoc networks},
journal = {J. Comb. Optim.},
volume = {16},
number = {1},
pages = {81--95},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9100-6},
doi = {10.1007/S10878-007-9100-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MinP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SaadTVZ08,
author = {Mohamed Saad and
Tam{\'{a}}s Terlaky and
Anthony Vannelli and
Hu Zhang},
title = {Packing trees in communication networks},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {402--423},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9150-4},
doi = {10.1007/S10878-008-9150-4},
timestamp = {Fri, 03 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SaadTVZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShangYWH08,
author = {Weiping Shang and
F. Frances Yao and
Peng{-}Jun Wan and
Xiaodong Hu},
title = {On minimum \emph{m} -connected \emph{k} -dominating set problem in
unit disc graphs},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {99--106},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9124-y},
doi = {10.1007/S10878-007-9124-Y},
timestamp = {Tue, 10 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ShangYWH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/StephenT08,
author = {Tamon Stephen and
Hugh Thomas},
title = {A quadratic lower bound for colourful simplicial depth},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {324--327},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9149-x},
doi = {10.1007/S10878-008-9149-X},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/StephenT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SuXX08,
author = {Bing Su and
Qingchuan Xu and
Peng Xiao},
title = {Finding the anti-block vital edge of a shortest path between two nodes},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {173--181},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9120-2},
doi = {10.1007/S10878-007-9120-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SuXX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuG08,
author = {Yufeng Wu and
Dan Gusfield},
title = {A new recombination lower bound and the minimum perfect phylogenetic
forest problem},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {229--247},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9129-6},
doi = {10.1007/S10878-007-9129-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YeB08,
author = {Yuli Ye and
Allan Borodin},
title = {Priority algorithms for the subset-sum problem},
journal = {J. Comb. Optim.},
volume = {16},
number = {3},
pages = {198--228},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9126-9},
doi = {10.1007/S10878-007-9126-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YeB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangC08,
author = {Yuzhong Zhang and
Zhigang Cao},
title = {An asymptotic {PTAS} for batch scheduling with nonidentical job sizes
to minimize makespan},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {119--126},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9128-7},
doi = {10.1007/S10878-007-9128-7},
timestamp = {Mon, 15 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-07-08 01:38 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:
