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/jco19.bht:"
download as .bib file
@article{DBLP:journals/jco/Aazami10,
author = {Ashkan Aazami},
title = {Domination in graphs with bounded propagation: algorithms, formulations
and hardness results},
journal = {J. Comb. Optim.},
volume = {19},
number = {4},
pages = {429--456},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9176-7},
doi = {10.1007/S10878-008-9176-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Aazami10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenCH10,
author = {Bo Chen and
Xujin Chen and
Xiaodong Hu},
title = {The price of atomic selfish ring routing},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {258--278},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9171-z},
doi = {10.1007/S10878-008-9171-Z},
timestamp = {Tue, 10 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenCH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenFA10,
author = {Zhixiang Chen and
Bin Fu and
John Abraham},
title = {A quadratic lower bound for Rocchio's similarity-based relevance feedback
algorithm with a fixed query updating factor},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {134--157},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9169-6},
doi = {10.1007/S10878-008-9169-6},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenFA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenLZ10,
author = {Lei Chen and
Changhong Lu and
Zhenbing Zeng},
title = {Labelling algorithms for paired-domination problems in block and interval
graphs},
journal = {J. Comb. Optim.},
volume = {19},
number = {4},
pages = {457--470},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9177-6},
doi = {10.1007/S10878-008-9177-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CochranLC10,
author = {James J. Cochran and
Martin S. Levy and
Jeffrey D. Camm},
title = {Bayesian coverage optimization models},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {158--173},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9172-y},
doi = {10.1007/S10878-008-9172-Y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CochranLC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DuanY10,
author = {Zhenhua Duan and
Chen Yang},
title = {Unconditional secure communication: a Russian Cards protocol},
journal = {J. Comb. Optim.},
volume = {19},
number = {4},
pages = {501--530},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9252-7},
doi = {10.1007/S10878-009-9252-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DuanY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DudekPR10,
author = {Andrzej Dudek and
Joanna Polcyn and
Andrzej Rucinski},
title = {Subhypergraph counts in extremal and random hypergraphs and the fractional
\emph{q}-independence},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {184--199},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9174-9},
doi = {10.1007/S10878-008-9174-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DudekPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Elloumi10,
author = {Sourour Elloumi},
title = {A tighter formulation of the \emph{p}-median problem},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {69--83},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9162-0},
doi = {10.1007/S10878-008-9162-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Elloumi10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FanghanelL10,
author = {Diana Fangh{\"{a}}nel and
Frauke Liers},
title = {A fast exact algorithm for the problem of optimum cooperation and
the structure of its solutions},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {369--393},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9208-y},
doi = {10.1007/S10878-009-9208-Y},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FanghanelL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GomesCJ10,
author = {Teresa Gomes and
Jos{\'{e}} M. F. Craveirinha and
Lu{\'{\i}}sa Jorge},
title = {An effective algorithm for obtaining the whole set of minimal cost
pairs of disjoint paths with dual arc costs},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {394--414},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9255-4},
doi = {10.1007/S10878-009-9255-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GomesCJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GulerH10,
author = {{\c{C}}igdem G{\"{u}}ler and
Horst W. Hamacher},
title = {Capacity inverse minimum cost flow problem},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {43--59},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9159-8},
doi = {10.1007/S10878-008-9159-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GulerH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Guo10,
author = {Jun Guo},
title = {Pooling designs associated with unitary space and ratio efficiency
comparison},
journal = {J. Comb. Optim.},
volume = {19},
number = {4},
pages = {492--500},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9185-6},
doi = {10.1007/S10878-008-9185-6},
timestamp = {Tue, 27 Mar 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Guo10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HsiehW10,
author = {Sun{-}Yuan Hsieh and
Chang{-}Yu Wu},
title = {Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional
edge faults},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {16--30},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9157-x},
doi = {10.1007/S10878-008-9157-X},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HsiehW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Hu10,
author = {Shiyan Hu},
title = {An almost four-approximation algorithm for maximum weight triangulation},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {31--42},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9158-9},
doi = {10.1007/S10878-008-9158-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Hu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangWW10,
author = {Tayuan Huang and
Kaishun Wang and
Chih{-}Wen Weng},
title = {A class of error-correcting pooling designs over complexes},
journal = {J. Comb. Optim.},
volume = {19},
number = {4},
pages = {486--491},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9179-4},
doi = {10.1007/S10878-008-9179-4},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuangWW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangK10,
author = {Hongxing Jiang and
Liying Kang},
title = {Total restrained domination in claw-free graphs},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {60--68},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9161-1},
doi = {10.1007/S10878-008-9161-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiangK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KennedyKLY10,
author = {William S. Kennedy and
Hui Kong and
Guohui Lin and
Guiying Yan},
title = {Linear time construction of 5-phylogenetic roots for tree chordal
graphs},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {94--106},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9164-y},
doi = {10.1007/S10878-008-9164-Y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KennedyKLY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LeyvandSSY10,
author = {Yaron Leyvand and
Dvir Shabtay and
George Steiner and
Liron Yedidsion},
title = {Just-in-time scheduling with controllable processing times on parallel
machines},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {347--368},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9270-5},
doi = {10.1007/S10878-009-9270-5},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LeyvandSSY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiY10,
author = {Shisheng Li and
Jinjiang Yuan},
title = {Parallel-machine parallel-batching scheduling with family jobs and
release dates to minimize makespan},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {84--93},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9163-z},
doi = {10.1007/S10878-008-9163-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LitvinchevRS10,
author = {Igor S. Litvinchev and
Socorro Rangel and
Jania Saucedo},
title = {A Lagrangian bound for many-to-many assignment problems},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {241--257},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9196-3},
doi = {10.1007/S10878-008-9196-3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LitvinchevRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuJ10,
author = {Lan Liu and
Tao Jiang},
title = {A linear-time algorithm for reconstructing zero-recombinant haplotype
configuration on pedigrees without mating loops},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {217--240},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9180-y},
doi = {10.1007/S10878-008-9180-Y},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/McDermidM10,
author = {Eric McDermid and
David F. Manlove},
title = {Keeping partners together: algorithmic results for the hospitals/residents
problem with couples},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {279--303},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9257-2},
doi = {10.1007/S10878-009-9257-2},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/McDermidM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RebennackAEP10,
author = {Steffen Rebennack and
Ashwin Arulselvan and
Lily Elefteriadou and
Panos M. Pardalos},
title = {Complexity analysis for maximum flow problems with arc reversals},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {200--216},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9175-8},
doi = {10.1007/S10878-008-9175-8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RebennackAEP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RossiTHPK10,
author = {Roberto Rossi and
S. Armagan Tarim and
Brahim Hnich and
Steven D. Prestwich and
Semra Karacaer},
title = {Scheduling internal audit activities: a stochastic combinatorial optimization
problem},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {325--346},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9207-z},
doi = {10.1007/S10878-009-9207-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RossiTHPK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SonneratV10,
author = {Nicolas Sonnerat and
Adrian Vetta},
title = {Galaxy cutsets in graphs},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {415--427},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9258-1},
doi = {10.1007/S10878-009-9258-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SonneratV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Sourd10,
author = {Francis Sourd},
title = {Lexicographically minimizing axial motions for the Euclidean {TSP}},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {1--15},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9154-0},
doi = {10.1007/S10878-008-9154-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Sourd10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/TamirV10,
author = {Tami Tamir and
Benny Vaksendiser},
title = {Algorithms for storage allocation based on client preferences},
journal = {J. Comb. Optim.},
volume = {19},
number = {3},
pages = {304--324},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9259-0},
doi = {10.1007/S10878-009-9259-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/TamirV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangW10,
author = {Yiqiao Wang and
Weifan Wang},
title = {Adjacent vertex distinguishing total colorings of outerplanar graphs},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {123--133},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9165-x},
doi = {10.1007/S10878-008-9165-X},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangW10a,
author = {Weifan Wang and
Yiqiao Wang},
title = {Adjacent vertex distinguishing edge-colorings of graphs with smaller
maximum average degree},
journal = {J. Comb. Optim.},
volume = {19},
number = {4},
pages = {471--485},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9178-5},
doi = {10.1007/S10878-008-9178-5},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangW10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWPFW10,
author = {Chen Wang and
James Willson and
Myung Ah Park and
Andras Farago and
Weili Wu},
title = {On dual power assignment optimization for biconnectivity},
journal = {J. Comb. Optim.},
volume = {19},
number = {2},
pages = {174--183},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9173-x},
doi = {10.1007/S10878-008-9173-X},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangWPFW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangX10,
author = {Zhenbo Wang and
Wenxun Xing},
title = {Worst-case analysis for on-line service policies},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {107--122},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9170-0},
doi = {10.1007/S10878-008-9170-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangX10.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-23 11:03 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:
