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/jco3.bht:"
download as .bib file
@article{DBLP:journals/jco/Akutsu99,
author = {Tatsuya Akutsu},
title = {Approximation and Exact Algorithms for {RNA} Secondary Structure Prediction
and Recognition of Stochastic Context-free Languages},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {321--336},
year = {1999},
url = {https://doi.org/10.1023/A:1009898029639},
doi = {10.1023/A:1009898029639},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Akutsu99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Cai99,
author = {Mao{-}cheng Cai},
title = {Inverse Problems of Matroid Intersection},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {465--474},
year = {1999},
url = {https://doi.org/10.1023/A:1009883605691},
doi = {10.1023/A:1009883605691},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Cai99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaiYL99,
author = {Mao{-}cheng Cai and
Xiaoguang Yang and
Yanjun Li},
title = {Inverse Polymatroidal Flow Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {115--126},
year = {1999},
url = {https://doi.org/10.1023/A:1009877408258},
doi = {10.1023/A:1009877408258},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaiYL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Caprara99,
author = {Alberto Caprara},
title = {On the Tightness of the Alternating-Cycle Lower Bound for Sorting
by Reversals},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {149--182},
year = {1999},
url = {https://doi.org/10.1023/A:1009838309166},
doi = {10.1023/A:1009838309166},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Caprara99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DellAmicoM99,
author = {Mauro Dell'Amico and
Silvano Martello},
title = {Reduction of the Three-Partition Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {17--30},
year = {1999},
url = {https://doi.org/10.1023/A:1009856820553},
doi = {10.1023/A:1009856820553},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DellAmicoM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GalinierH99,
author = {Philippe Galinier and
Jin{-}Kao Hao},
title = {Hybrid Evolutionary Algorithms for Graph Coloring},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {379--397},
year = {1999},
url = {https://doi.org/10.1023/A:1009823419804},
doi = {10.1023/A:1009823419804},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GalinierH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GasieniecJLO99,
author = {Leszek Gasieniec and
Jesper Jansson and
Andrzej Lingas and
Anna {\"{O}}stlin},
title = {On the Complexity of Constructing Evolutionary Trees},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {183--197},
year = {1999},
url = {https://doi.org/10.1023/A:1009833626004},
doi = {10.1023/A:1009833626004},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GasieniecJLO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GudmundssonL99,
author = {Joachim Gudmundsson and
Christos Levcopoulos},
title = {Close Approximations of Minimum Rectangular Coverings},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {437--452},
year = {1999},
url = {https://doi.org/10.1023/A:1009879504783},
doi = {10.1023/A:1009879504783},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GudmundssonL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuaJW99,
author = {Yufang Hua and
Tao Jiang and
Bin Wu},
title = {Aligning {DNA} Sequences to Minimize the Change in Protein},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {227--245},
year = {1999},
url = {https://doi.org/10.1023/A:1009889710983},
doi = {10.1023/A:1009889710983},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuaJW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Iida99,
author = {Hiroshi Iida},
title = {A Note on the Max-Min 0-1 Knapsack Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {89--94},
year = {1999},
url = {https://doi.org/10.1023/A:1009821323279},
doi = {10.1023/A:1009821323279},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Iida99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Jansen99,
author = {Klaus Jansen},
title = {An Approximation Scheme for Bin Packing with Conflicts},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {363--377},
year = {1999},
url = {https://doi.org/10.1023/A:1009871302966},
doi = {10.1023/A:1009871302966},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Jansen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KellererP99,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {A New Fully Polynomial Time Approximation Scheme for the Knapsack
Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {59--71},
year = {1999},
url = {https://doi.org/10.1023/A:1009813105532},
doi = {10.1023/A:1009813105532},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KellererP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KlinzW99,
author = {Bettina Klinz and
Gerhard J. Woeginger},
title = {The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {51--58},
year = {1999},
url = {https://doi.org/10.1023/A:1009881510868},
doi = {10.1023/A:1009881510868},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KlinzW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kobayashi99,
author = {Satoshi Kobayashi},
title = {Horn Clause Computation with {DNA} Molecules},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {277--299},
year = {1999},
url = {https://doi.org/10.1023/A:1009893911892},
doi = {10.1023/A:1009893911892},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kobayashi99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LathropP99,
author = {Richard H. Lathrop and
Michael J. Pazzani},
title = {Combinatorial Optimization in Rapidly Mutating Drug-Resistant Viruses},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {301--320},
year = {1999},
url = {https://doi.org/10.1023/A:1009846028730},
doi = {10.1023/A:1009846028730},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LathropP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Li99,
author = {Keqin Li},
title = {Analysis of the List Scheduling Algorithm for Precedence Constrained
Parallel Tasks},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {73--88},
year = {1999},
url = {https://doi.org/10.1023/A:1009817206440},
doi = {10.1023/A:1009817206440},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Li99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiT99,
author = {Xiang{-}Yang Li and
Shang{-}Hua Teng},
title = {Practical Human-Machine Identification over Insecure Channels},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {347--361},
year = {1999},
url = {https://doi.org/10.1023/A:1009894418895},
doi = {10.1023/A:1009894418895},
timestamp = {Fri, 27 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuY99,
author = {Zhaohui Liu and
Wenci Yu},
title = {Minimizing the Number of Late Jobs under the Group Technology Assumption},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {5--15},
year = {1999},
url = {https://doi.org/10.1023/A:1009841719644},
doi = {10.1023/A:1009841719644},
timestamp = {Sun, 27 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaWZ99,
author = {Bin Ma and
Lusheng Wang and
Louxin Zhang},
title = {Fitting Distances by Tree Metrics with Increment Error},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {213--225},
year = {1999},
url = {https://doi.org/10.1023/A:1009837726913},
doi = {10.1023/A:1009837726913},
timestamp = {Tue, 14 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MaWZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MiddendorfT99,
author = {Martin Middendorf and
Vadim G. Timkovsky},
title = {Transversal Graphs for Partially Ordered Sets: Sequencing, Merging
and Scheduling Problems},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {417--435},
year = {1999},
url = {https://doi.org/10.1023/A:1009827520712},
doi = {10.1023/A:1009827520712},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MiddendorfT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ParidaFR99,
author = {Laxmi Parida and
Aris Floratos and
Isidore Rigoutsos},
title = {An Approximation Algorithm for Alignment of Multiple Sequences using
Motif Discovery},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {247--275},
year = {1999},
url = {https://doi.org/10.1023/A:1009841927822},
doi = {10.1023/A:1009841927822},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ParidaFR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Piersma99,
author = {Nanda Piersma},
title = {A Probabilistic Analysis of the Capacitated Facility Location Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {31--50},
year = {1999},
url = {https://doi.org/10.1023/A:1009861004623},
doi = {10.1023/A:1009861004623},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Piersma99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Seiden99,
author = {Steven S. Seiden},
title = {Randomized Online Scheduling with Delivery Times},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {399--416},
year = {1999},
url = {https://doi.org/10.1023/A:1009875403874},
doi = {10.1023/A:1009875403874},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Seiden99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wang99,
author = {Jie Wang},
title = {Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {453--463},
year = {1999},
url = {https://doi.org/10.1023/A:1009831621621},
doi = {10.1023/A:1009831621621},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wang99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuCT99,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {Approximation and Exact Algorithms for Constructing Minimum Ultrametric
Trees from Distance Matrices},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {199--211},
year = {1999},
url = {https://doi.org/10.1023/A:1009885610075},
doi = {10.1023/A:1009885610075},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuCT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuMH99,
author = {Ying Xu and
Satoru Miyano and
Tom Head},
title = {Foreword},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {147--148},
year = {1999},
url = {https://doi.org/10.1023/A:1009802228614},
doi = {10.1023/A:1009802228614},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuMH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YagiuraI99,
author = {Mutsunori Yagiura and
Toshihide Ibaraki},
title = {Analyses on the 2 and 3-Flip Neighborhoods for the {MAX} {SAT}},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {95--114},
year = {1999},
url = {https://doi.org/10.1023/A:1009873324187},
doi = {10.1023/A:1009873324187},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YagiuraI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangM99,
author = {Jianzhong Zhang and
Zhongfan Ma},
title = {Solution Structure of Some Inverse Combinatorial Optimization Problems},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {127--139},
year = {1999},
url = {https://doi.org/10.1023/A:1009829525096},
doi = {10.1023/A:1009829525096},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangM99.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-06-26 11:08 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:
