default search action
Search dblp for Publications
export results for "toc:db/journals/comgeo/comgeo11.bht:"
@article{DBLP:journals/comgeo/AgarwalKS98, author = {Pankaj K. Agarwal and Marc J. van Kreveld and Subhash Suri}, title = {Label placement by maximum independent set in rectangles}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {209--218}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00028-5}, doi = {10.1016/S0925-7721(98)00028-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/AgarwalKS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BarequetBDG98, author = {Gill Barequet and Amy J. Briggs and Matthew Dickerson and Michael T. Goodrich}, title = {Offset-polygon annulus placement problems}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {125--141}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00025-X}, doi = {10.1016/S0925-7721(98)00025-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BarequetBDG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BergEG98, author = {Mark de Berg and Hazel Everett and Leonidas J. Guibas}, title = {The union of moving polygonal pseudodiscs - Combinatorial bounds and applications}, journal = {Comput. Geom.}, volume = {11}, number = {2}, pages = {69--81}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00020-0}, doi = {10.1016/S0925-7721(98)00020-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BergEG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BerrettyOS98, author = {Robert{-}Paul Berretty and Mark H. Overmars and A. Frank van der Stappen}, title = {Dynamic motion planning in low obstacle density environments}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {157--173}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00026-1}, doi = {10.1016/S0925-7721(98)00026-1}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BerrettyOS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/Bjorling-Sachs98, author = {Iliana Bjorling{-}Sachs}, title = {Edge guards in rectilinear polygons}, journal = {Comput. Geom.}, volume = {11}, number = {2}, pages = {111--123}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00024-8}, doi = {10.1016/S0925-7721(98)00024-8}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/Bjorling-Sachs98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BussieckL98, author = {Michael R. Bussieck and Marco E. L{\"{u}}bbecke}, title = {The vertex set of a 0/1-polytope is strongly P-enumerable}, journal = {Comput. Geom.}, volume = {11}, number = {2}, pages = {103--109}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00021-2}, doi = {10.1016/S0925-7721(98)00021-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BussieckL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/ChrobakN98, author = {Marek Chrobak and Shin{-}Ichi Nakano}, title = {Minimum-width grid drawings of plane graphs}, journal = {Comput. Geom.}, volume = {11}, number = {1}, pages = {29--54}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00016-9}, doi = {10.1016/S0925-7721(98)00016-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/ChrobakN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/DevillersLPT98, author = {Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia}, title = {Checking the convexity of polytopes and the planarity of subdivisions}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {187--208}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00039-X}, doi = {10.1016/S0925-7721(98)00039-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/DevillersLPT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/DickersonS98, author = {Matthew Dickerson and Daniel Scharstein}, title = {Optimal placement of convex polygons to maximize point containment}, journal = {Comput. Geom.}, volume = {11}, number = {1}, pages = {1--16}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00015-7}, doi = {10.1016/S0925-7721(98)00015-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/DickersonS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/EverettSVW98, author = {Hazel Everett and Ivan Stojmenovic and Pavel Valtr and Sue Whitesides}, title = {The largest k-ball in a d-dimensional box}, journal = {Comput. Geom.}, volume = {11}, number = {2}, pages = {59--67}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00022-4}, doi = {10.1016/S0925-7721(98)00022-4}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/EverettSVW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/GlozmanKS98, author = {Alex Glozman and Klara Kedem and Gregory Shpitalnik}, title = {On some geometric selection and optimization problems via sorted matrices}, journal = {Comput. Geom.}, volume = {11}, number = {1}, pages = {17--28}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00017-0}, doi = {10.1016/S0925-7721(98)00017-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/GlozmanKS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/HalperinO98, author = {Dan Halperin and Mark H. Overmars}, title = {Spheres, molecules, and hidden surface removal}, journal = {Comput. Geom.}, volume = {11}, number = {2}, pages = {83--102}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00023-6}, doi = {10.1016/S0925-7721(98)00023-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/HalperinO98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/HershbergerS98a, author = {John Hershberger and Jack Snoeyink}, title = {Cartographic line simplification and polygon {CSG} formul{\ae} in O(nlog * n) time}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {175--185}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00027-3}, doi = {10.1016/S0925-7721(98)00027-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/HershbergerS98a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/Puppo98, author = {Enrico Puppo}, title = {Variable resolution triangulations}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {219--238}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00029-7}, doi = {10.1016/S0925-7721(98)00029-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/Puppo98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/SegalK98, author = {Michael Segal and Klara Kedem}, title = {Geometric applications of posets}, journal = {Comput. Geom.}, volume = {11}, number = {3-4}, pages = {143--156}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00031-5}, doi = {10.1016/S0925-7721(98)00031-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/SegalK98.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.