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/jco5.bht:"
download as .bib file
@article{DBLP:journals/jco/AsanoKK01,
author = {Tetsuo Asano and
Naoki Katoh and
Kazuhiro Kawashima},
title = {A New Approximation Algorithm for the Capacitated Vehicle Routing
Problem on a Tree},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {213--231},
year = {2001},
url = {https://doi.org/10.1023/A:1011461300596},
doi = {10.1023/A:1011461300596},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AsanoKK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CarrFKP01,
author = {Robert D. Carr and
Toshihiro Fujito and
Goran Konjevod and
Ojas Parekh},
title = {A 2{\textbackslash}frac\{1\}\{10\}-Approximation Algorithm for a Generalization
of the Weighted Edge-Dominating Set Problem},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {317--326},
year = {2001},
url = {https://doi.org/10.1023/A:1011445210568},
doi = {10.1023/A:1011445210568},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CarrFKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenDHWX01,
author = {Danny Z. Chen and
Ovidiu Daescu and
Xiaobo Hu and
Xiaodong Wu and
Jinhui Xu},
title = {Determining an Optimal Penetration Among Weighted Regions in Two and
Three Dimensions},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {59--79},
year = {2001},
url = {https://doi.org/10.1023/A:1009885517653},
doi = {10.1023/A:1009885517653},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenDHWX01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengKL01,
author = {Xiuzhen Cheng and
Joon{-}Mo Kim and
Bing Lu},
title = {A Polynomial Time Approximation Scheme for the Problem of Interconnecting
Highways},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {327--343},
year = {2001},
url = {https://doi.org/10.1023/A:1011497227406},
doi = {10.1023/A:1011497227406},
timestamp = {Thu, 10 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChengKL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CrescenziDP01,
author = {Pierluigi Crescenzi and
Xiaotie Deng and
Christos H. Papadimitriou},
title = {On Approximating a Scheduling Problem},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {287--297},
year = {2001},
url = {https://doi.org/10.1023/A:1011441109660},
doi = {10.1023/A:1011441109660},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CrescenziDP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DengMM01,
author = {Xiaotie Deng and
Evangelos E. Milios and
Andranik Mirzaian},
title = {Robot Map Verification of a Graph World},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {383--395},
year = {2001},
url = {https://doi.org/10.1023/A:1011688823715},
doi = {10.1023/A:1011688823715},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DengMM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaurK01,
author = {Daya Ram Gaur and
Ramesh Krishnamurti},
title = {Simple Approximation Algorithms for {MAXNAESP} and Hypergraph 2-colorability},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {167--173},
year = {2001},
url = {https://doi.org/10.1023/A:1011453115618},
doi = {10.1023/A:1011453115618},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GaurK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Hall01,
author = {Peter Hall},
title = {On the Addition and Comparison of Graphs Labeled with Stochastic Variables:
Learnable Anatomical Catalogs},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {43--58},
year = {2001},
url = {https://doi.org/10.1023/A:1009881416744},
doi = {10.1023/A:1009881416744},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Hall01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HifiR01,
author = {Mhand Hifi and
Catherine Roucairol},
title = {Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional
Two-staged Cutting Stock Problems},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {465--494},
year = {2001},
url = {https://doi.org/10.1023/A:1011628809603},
doi = {10.1023/A:1011628809603},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HifiR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HwangC01,
author = {Shyh{-}In Hwang and
Sheng{-}Tzong Cheng},
title = {Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {345--375},
year = {2001},
url = {https://doi.org/10.1023/A:1011449311477},
doi = {10.1023/A:1011449311477},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HwangC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/IasemidisPSS01,
author = {Leonidas D. Iasemidis and
Panos M. Pardalos and
J. Chris Sackellares and
Deng{-}Shan Shiau},
title = {Quadratic Binary Programming and Dynamical System Approach to Determine
the Predictability of Epileptic Seizures},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {9--26},
year = {2001},
url = {https://doi.org/10.1023/A:1009877331765},
doi = {10.1023/A:1009877331765},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/IasemidisPSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KrystaS01,
author = {Piotr Krysta and
Roberto Solis{-}Oba},
title = {Approximation Algorithms for Bounded Facility Location Problems},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {233--247},
year = {2001},
url = {https://doi.org/10.1023/A:1011465419252},
doi = {10.1023/A:1011465419252},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KrystaS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KusakariMN01,
author = {Yoshiyuki Kusakari and
Daisuke Masubuchi and
Takao Nishizeki},
title = {Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face
Condition},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {249--266},
year = {2001},
url = {https://doi.org/10.1023/A:1011425821069},
doi = {10.1023/A:1011425821069},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KusakariMN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LauT01,
author = {Hing{-}Yip Lau and
H. F. Ting},
title = {The Greedier the Better: An Efficient Algorithm for Approximating
Maximum Independent},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {411--420},
year = {2001},
url = {https://doi.org/10.1023/A:1011672624624},
doi = {10.1023/A:1011672624624},
timestamp = {Fri, 12 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LauT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Letchford01,
author = {Adam N. Letchford},
title = {On Disjunctive Cuts for Combinatorial Optimization},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {299--315},
year = {2001},
url = {https://doi.org/10.1023/A:1011493126498},
doi = {10.1023/A:1011493126498},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Letchford01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Mitchell01,
author = {John E. Mitchell},
title = {Restarting after Branching in the {SDP} Approach to {MAX-CUT} and
Similar Combinatorial Optimization Problems},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {151--166},
year = {2001},
url = {https://doi.org/10.1023/A:1011416130639},
doi = {10.1023/A:1011416130639},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Mitchell01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NagamochiSI01,
author = {Hiroshi Nagamochi and
Takashi Shiraki and
Toshihide Ibaraki},
title = {Augmenting a Submodular and Posi-modular Set Function by a Multigraph},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {175--212},
year = {2001},
url = {https://doi.org/10.1023/A:1011409332456},
doi = {10.1023/A:1011409332456},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NagamochiSI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NystromS01,
author = {Ingela Nystr{\"{o}}m and
{\"{O}}rjan Smedby},
title = {Skeletonization of Volumetric Vascular Images - Distance Information
Utilized for Visualization},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {27--41},
year = {2001},
url = {https://doi.org/10.1023/A:1009829415835},
doi = {10.1023/A:1009829415835},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NystromS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Plesnik01,
author = {J{\'{a}}n Plesn{\'{\i}}k},
title = {Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {275--286},
year = {2001},
url = {https://doi.org/10.1023/A:1011457225589},
doi = {10.1023/A:1011457225589},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Plesnik01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RajasekaranHLNPSS01,
author = {Sanguthevar Rajasekaran and
Y. Hu and
Jun Luo and
H. Nick and
Panos M. Pardalos and
Sartaj Sahni and
G. Shaw},
title = {Efficient Algorithms for Similarity Search},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {125--132},
year = {2001},
url = {https://doi.org/10.1023/A:1009897903540},
doi = {10.1023/A:1009897903540},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RajasekaranHLNPSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RajasekaranNPSS01,
author = {Sanguthevar Rajasekaran and
H. Nick and
Panos M. Pardalos and
Sartaj Sahni and
G. Shaw},
title = {Efficient Algorithms for Local Alignment Search},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {117--124},
year = {2001},
url = {https://doi.org/10.1023/A:1009893719470},
doi = {10.1023/A:1009893719470},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RajasekaranNPSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Resende01,
author = {Mauricio G. C. Resende},
title = {"Mobile Networks and Computing"},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {297--298},
year = {2001},
url = {https://doi.org/10.1023/A:1011633010511},
doi = {10.1023/A:1011633010511},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Resende01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Resende01a,
author = {Mauricio G. C. Resende},
title = {Multichannel Optical Networks: Theory and Practice},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {495--496},
year = {2001},
url = {https://doi.org/10.1023/A:1011680926441},
doi = {10.1023/A:1011680926441},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Resende01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShengWZ01,
author = {Li Sheng and
Chi Wang and
Peisen Zhang},
title = {Tagged Probe Interval Graphs},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {133--142},
year = {2001},
url = {https://doi.org/10.1023/A:1009850020378},
doi = {10.1023/A:1009850020378},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShengWZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SmithL01,
author = {J. MacGregor Smith and
Wu{-}Ji Li},
title = {Quadratic Assignment Problems and {M/G/C/C/} State Dependent Network
Flows},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {421--443},
year = {2001},
url = {https://doi.org/10.1023/A:1011624708694},
doi = {10.1023/A:1011624708694},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SmithL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SpragueB01,
author = {Alan P. Sprague and
Stephen E. Brossette},
title = {Medical Surveillance, Frequent Sets, and Closure Operations},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {81--94},
year = {2001},
url = {https://doi.org/10.1023/A:1009889601723},
doi = {10.1023/A:1009889601723},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SpragueB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Vakhania01,
author = {Nodari Vakhania},
title = {Tight Performance Bounds of CP-Scheduling on Out-Trees},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {445--464},
year = {2001},
url = {https://doi.org/10.1023/A:1011676725533},
doi = {10.1023/A:1011676725533},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Vakhania01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wang01,
author = {Jie Wang},
title = {Optimization Problems in Medical Applications},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {7--8},
year = {2001},
url = {https://doi.org/10.1023/A:1009842914927},
doi = {10.1023/A:1009842914927},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wang01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoJ01,
author = {Peng Zhao and
Tao Jiang},
title = {A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks},
journal = {J. Comb. Optim.},
volume = {5},
number = {1},
pages = {95--115},
year = {2001},
url = {https://doi.org/10.1023/A:1009841718561},
doi = {10.1023/A:1009841718561},
timestamp = {Fri, 24 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoNI01,
author = {Liang Zhao and
Hiroshi Nagamochi and
Toshihide Ibaraki},
title = {Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts},
journal = {J. Comb. Optim.},
volume = {5},
number = {4},
pages = {397--410},
year = {2001},
url = {https://doi.org/10.1023/A:1011620607786},
doi = {10.1023/A:1011620607786},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhaoNI01.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 19:55 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:
