Search dblp for Publications

export results for "toc:db/journals/comgeo/comgeo24.bht:"

 download as .bib file

@article{DBLP:journals/comgeo/AkiyamaNNS03,
  author       = {Jin Akiyama and
                  Gisaku Nakamura and
                  Akihiro Nozaki and
                  Ken'ichi Ozawa and
                  Toshinori Sakai},
  title        = {The optimality of a certain purely recursive dissection for a sequentially
                  n-divisible square},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {1},
  pages        = {27--39},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00047-0},
  doi          = {10.1016/S0925-7721(02)00047-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/AkiyamaNNS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/BergGHO03,
  author       = {Mark de Berg and
                  Joachim Gudmundsson and
                  Mikael Hammar and
                  Mark H. Overmars},
  title        = {On R-trees with low query complexity},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {3},
  pages        = {179--195},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00112-8},
  doi          = {10.1016/S0925-7721(02)00112-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/BergGHO03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/BernDEKMS03,
  author       = {Marshall W. Bern and
                  Erik D. Demaine and
                  David Eppstein and
                  Eric Kuo and
                  Andrea Mantler and
                  Jack Snoeyink},
  title        = {Ununfoldable polyhedra with convex faces},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {2},
  pages        = {51--62},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00091-3},
  doi          = {10.1016/S0925-7721(02)00091-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/BernDEKMS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/Bespamyatnikh03,
  author       = {Sergei Bespamyatnikh},
  title        = {An O(nlogn) algorithm for the zoo-keeper's problem},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {2},
  pages        = {63--74},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00092-5},
  doi          = {10.1016/S0925-7721(02)00092-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/Bespamyatnikh03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/BoseMM03,
  author       = {Prosenjit Bose and
                  Anil Maheshwari and
                  Pat Morin},
  title        = {Fast approximations for sums of distances, clustering and the Fermat-Weber
                  problem},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {3},
  pages        = {135--146},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00102-5},
  doi          = {10.1016/S0925-7721(02)00102-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/BoseMM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/Brass03,
  author       = {Peter Bra{\ss}},
  title        = {On finding maximum-cardinality symmetric subsets},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {1},
  pages        = {19--25},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00046-9},
  doi          = {10.1016/S0925-7721(02)00046-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/Brass03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/CarrSA03,
  author       = {Hamish A. Carr and
                  Jack Snoeyink and
                  Ulrike Axen},
  title        = {Computing contour trees in all dimensions},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {2},
  pages        = {75--94},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00093-7},
  doi          = {10.1016/S0925-7721(02)00093-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/CarrSA03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/DuncanGK03,
  author       = {Christian A. Duncan and
                  Michael T. Goodrich and
                  Stephen G. Kobourov},
  title        = {Planarity-preserving clustering and embedding for large planar graphs},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {2},
  pages        = {95--114},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00094-9},
  doi          = {10.1016/S0925-7721(02)00094-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/DuncanGK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/GabrielyR03,
  author       = {Yoav Gabriely and
                  Elon Rimon},
  title        = {Competitive on-line coverage of grid environments by a mobile robot},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {3},
  pages        = {197--224},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00110-4},
  doi          = {10.1016/S0925-7721(02)00110-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/GabrielyR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/IndykV03,
  author       = {Piotr Indyk and
                  Suresh Venkatasubramanian},
  title        = {Approximate congruence in nearly linear time},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {2},
  pages        = {115--128},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00095-0},
  doi          = {10.1016/S0925-7721(02)00095-0},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/comgeo/IndykV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/Ito03,
  author       = {Hiro Ito},
  title        = {Sum of edge lengths of a multigraph drawn on a convex polygon},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {1},
  pages        = {41--47},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00048-2},
  doi          = {10.1016/S0925-7721(02)00048-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/Ito03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/LiottaM03,
  author       = {Giuseppe Liotta and
                  Henk Meijer},
  title        = {Voronoi drawings of trees},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {3},
  pages        = {147--178},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00137-2},
  doi          = {10.1016/S0925-7721(02)00137-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/LiottaM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/ORourke03,
  author       = {Joseph O'Rourke},
  title        = {On the development of the intersection of a plane with a polytope},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {1},
  pages        = {3--10},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00044-5},
  doi          = {10.1016/S0925-7721(02)00044-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/ORourke03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/RadoicicT03,
  author       = {Rados Radoicic and
                  G{\'{e}}za T{\'{o}}th},
  title        = {Monotone paths in line arrangements},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {3},
  pages        = {129--134},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00136-0},
  doi          = {10.1016/S0925-7721(02)00136-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/RadoicicT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/Tokuyama03,
  author       = {Takeshi Tokuyama},
  title        = {Efficient algorithms for the minimum diameter bridge problem},
  journal      = {Comput. Geom.},
  volume       = {24},
  number       = {1},
  pages        = {11--18},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0925-7721(02)00045-7},
  doi          = {10.1016/S0925-7721(02)00045-7},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/comgeo/Tokuyama03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.