default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jal/jal38.bht:"
download as .bib file
@article{DBLP:journals/jal/BarequetH01,
author = {Gill Barequet and
Sariel Har{-}Peled},
title = {Efficiently Approximating the Minimum-Volume Bounding Box of a Point
Set in Three Dimensions},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {91--109},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1127},
doi = {10.1006/JAGM.2000.1127},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BarequetH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BiedlBDL01,
author = {Therese C. Biedl and
Prosenjit Bose and
Erik D. Demaine and
Anna Lubiw},
title = {Efficient Algorithms for Petersen's Matching Theorem},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {110--134},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1132},
doi = {10.1006/JAGM.2000.1132},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BiedlBDL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BryantS01,
author = {David Bryant and
Mike A. Steel},
title = {Constructing Optimal Trees from Quartets},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {237--259},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1133},
doi = {10.1006/JAGM.2000.1133},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BryantS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChandraH01,
author = {Barun Chandra and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximation Algorithms for Dispersion Problems},
journal = {J. Algorithms},
volume = {38},
number = {2},
pages = {438--465},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1145},
doi = {10.1006/JAGM.2000.1145},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChandraH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CohenZ01,
author = {Edith Cohen and
Uri Zwick},
title = {All-Pairs Small-Stretch Paths},
journal = {J. Algorithms},
volume = {38},
number = {2},
pages = {335--353},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1117},
doi = {10.1006/JAGM.2000.1117},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/CohenZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Cowen01,
author = {Lenore Cowen},
title = {Compact Routing with Minimum Stretch},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {170--183},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1134},
doi = {10.1006/JAGM.2000.1134},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Cowen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DuncanGK01,
author = {Christian A. Duncan and
Michael T. Goodrich and
Stephen G. Kobourov},
title = {Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees
and Octrees},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {303--333},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1135},
doi = {10.1006/JAGM.2000.1135},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/DuncanGK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FernauN01,
author = {Henning Fernau and
Rolf Niedermeier},
title = {An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover},
journal = {J. Algorithms},
volume = {38},
number = {2},
pages = {374--410},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1141},
doi = {10.1006/JAGM.2000.1141},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FernauN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GoldbergT01,
author = {Andrew V. Goldberg and
Kostas Tsioutsiouliklis},
title = {Cut Tree Algorithms: An Experimental Study},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {51--83},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1136},
doi = {10.1006/JAGM.2000.1136},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GoldbergT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Indyk01,
author = {Piotr Indyk},
title = {A Small Approximately Min-Wise Independent Family of Hash Functions},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {84--90},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1131},
doi = {10.1006/JAGM.2000.1131},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Indyk01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KalyanasundaramP01,
author = {Bala Kalyanasundaram and
Kirk Pruhs},
title = {Eliminating Migration in Multi-processor Scheduling},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {2--24},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1128},
doi = {10.1006/JAGM.2000.1128},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KalyanasundaramP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KleinbergK01,
author = {Jon M. Kleinberg and
Amit Kumar},
title = {Wavelength Conversion in Optical Networks},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {25--50},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1137},
doi = {10.1006/JAGM.2000.1137},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KleinbergK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KorupoluPR01,
author = {Madhukar R. Korupolu and
C. Greg Plaxton and
Rajmohan Rajaraman},
title = {Placement Algorithms for Hierarchical Cooperative Caching},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {260--302},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1129},
doi = {10.1006/JAGM.2000.1129},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KorupoluPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MakinoUI01,
author = {Kazuhisa Makino and
Yushi Uno and
Toshihide Ibaraki},
title = {On Minimum Edge Ranking Spanning Trees},
journal = {J. Algorithms},
volume = {38},
number = {2},
pages = {411--437},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1143},
doi = {10.1006/JAGM.2000.1143},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MakinoUI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Moret01,
author = {Bernard M. E. Moret},
title = {Foreword},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {1},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1139},
doi = {10.1006/JAGM.2000.1139},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Moret01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NagamochiH01,
author = {Hiroshi Nagamochi and
Toru Hasunuma},
title = {An Efficient {NC} Algorithm for a Sparse k-Edge-Connectivity Certificate},
journal = {J. Algorithms},
volume = {38},
number = {2},
pages = {354--373},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1144},
doi = {10.1006/JAGM.2000.1144},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/NagamochiH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Oldham01,
author = {Jeffrey D. Oldham},
title = {Combinatorial Approximation Algorithms for Generalized Flow Problems},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {135--169},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1130},
doi = {10.1006/JAGM.2000.1130},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Oldham01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Siegel01,
author = {Alan Siegel},
title = {Median Bounds and Their Application},
journal = {J. Algorithms},
volume = {38},
number = {1},
pages = {184--236},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1138},
doi = {10.1006/JAGM.2000.1138},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Siegel01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-11-29 00:10 CET 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:
