Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/comgeo/comgeo99.bht:"
@article{DBLP:journals/comgeo/KimYA21, author = {Mincheol Kim and Sang Duk Yoon and Hee{-}Kap Ahn}, title = {Shortest rectilinear path queries to rectangles in a rectangular domain}, journal = {Comput. Geom.}, volume = {99}, pages = {101796}, year = {2021}, url = {https://doi.org/10.1016/j.comgeo.2021.101796}, doi = {10.1016/J.COMGEO.2021.101796}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/KimYA21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/SapucaiaRS21, author = {Allan Sapucaia and Pedro J. de Rezende and Cid C. de Souza}, title = {Solving the minimum convex partition of point sets with integer programming}, journal = {Comput. Geom.}, volume = {99}, pages = {101794}, year = {2021}, url = {https://doi.org/10.1016/j.comgeo.2021.101794}, doi = {10.1016/J.COMGEO.2021.101794}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/SapucaiaRS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/TillmannK21, author = {Andreas M. Tillmann and Leif Kobbelt}, title = {Structured discrete shape approximation: Theoretical complexity and practical algorithm}, journal = {Comput. Geom.}, volume = {99}, pages = {101795}, year = {2021}, url = {https://doi.org/10.1016/j.comgeo.2021.101795}, doi = {10.1016/J.COMGEO.2021.101795}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/comgeo/TillmannK21.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.