Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dcg/dcg5.bht:"
@article{DBLP:journals/dcg/Abrahamson90, author = {Karl R. Abrahamson}, title = {On the Modality of Convex Polygons}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {409--419}, year = {1990}, url = {https://doi.org/10.1007/BF02187802}, doi = {10.1007/BF02187802}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Abrahamson90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Agarwal90, author = {Pankaj K. Agarwal}, title = {Partitioning Arrangements of Lines {I:} An Efficient deterministic Algorithm}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {449--483}, year = {1990}, url = {https://doi.org/10.1007/BF02187805}, doi = {10.1007/BF02187805}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Agarwal90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Agarwal90a, author = {Pankaj K. Agarwal}, title = {Parititoning Arrangements of Lines {II:} Applications}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {533--573}, year = {1990}, url = {https://doi.org/10.1007/BF02187809}, doi = {10.1007/BF02187809}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Agarwal90a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Aurenhammer90, author = {Franz Aurenhammer}, title = {A New Duality Result Concerning Voronoi Diagrams}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {243--254}, year = {1990}, url = {https://doi.org/10.1007/BF02187788}, doi = {10.1007/BF02187788}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Aurenhammer90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/BaranyL90, author = {Imre B{\'{a}}r{\'{a}}ny and David G. Larman}, title = {A Combinatorial Property of Points anf Ellipsoids}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {375--382}, year = {1990}, url = {https://doi.org/10.1007/BF02187798}, doi = {10.1007/BF02187798}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/BaranyL90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Barnette90, author = {David W. Barnette}, title = {W\({}^{\mbox{v}}\) Paths on the Torus}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {603--608}, year = {1990}, url = {https://doi.org/10.1007/BF02187811}, doi = {10.1007/BF02187811}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Barnette90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/BianchiL90, author = {Gabriele Bianchi and Marco Longinetti}, title = {Reconstructing Plane Sets from Projections}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {223--242}, year = {1990}, url = {https://doi.org/10.1007/BF02187787}, doi = {10.1007/BF02187787}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/BianchiL90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/BjornerEZ90, author = {Anders Bj{\"{o}}rner and Paul H. Edelman and G{\"{u}}nter M. Ziegler}, title = {Hyperplane Arrangements with a Lattice of Regions}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {263--288}, year = {1990}, url = {https://doi.org/10.1007/BF02187790}, doi = {10.1007/BF02187790}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/BjornerEZ90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/BokowskiRS90, author = {J{\"{u}}rgen Bokowski and J{\"{u}}rgen Richter and Bernd Sturmfels}, title = {Nonrealizability Proofs in Computational Geometry}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {333--350}, year = {1990}, url = {https://doi.org/10.1007/BF02187794}, doi = {10.1007/BF02187794}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/BokowskiRS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/ChazelleP90, author = {Bernard Chazelle and Leonidas Palios}, title = {Triangulating a Nonconvex Polytope}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {505--526}, year = {1990}, url = {https://doi.org/10.1007/BF02187807}, doi = {10.1007/BF02187807}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/ChazelleP90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/ClarksonEGSW90, author = {Kenneth L. Clarkson and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl}, title = {Combinatorial Complexity Bounds for Arrangement of Curves and Spheres}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {99--160}, year = {1990}, url = {https://doi.org/10.1007/BF02187783}, doi = {10.1007/BF02187783}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/ClarksonEGSW90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Dillencourt90, author = {Michael B. Dillencourt}, title = {Toughness and Delaunay Triangulations}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {575--601}, year = {1990}, url = {https://doi.org/10.1007/BF02187810}, doi = {10.1007/BF02187810}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Dillencourt90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/DobkinFS90, author = {David P. Dobkin and Steven J. Friedman and Kenneth J. Supowit}, title = {Delaunay Graphs are almost as Good as Complete Graphs}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {399--407}, year = {1990}, url = {https://doi.org/10.1007/BF02187801}, doi = {10.1007/BF02187801}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/DobkinFS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/DuK90, author = {Ding{-}Zhu Du and Daniel J. Kleitman}, title = {Diameter and Radius in the Manhattan Metric}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {351--356}, year = {1990}, url = {https://doi.org/10.1007/BF02187795}, doi = {10.1007/BF02187795}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/DuK90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/EdelsbrunnerGS90, author = {Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir}, title = {The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {161--196}, year = {1990}, url = {https://doi.org/10.1007/BF02187784}, doi = {10.1007/BF02187784}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/EdelsbrunnerGS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/EdelsbrunnerGS90a, author = {Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir}, title = {The Complexity of Many Cells in Arrangements of Planes and Related Problems}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {197--216}, year = {1990}, url = {https://doi.org/10.1007/BF02187785}, doi = {10.1007/BF02187785}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/EdelsbrunnerGS90a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/EdelsbrunnerS90, author = {Herbert Edelsbrunner and Micha Sharir}, title = {The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {35--42}, year = {1990}, url = {https://doi.org/10.1007/BF02187778}, doi = {10.1007/BF02187778}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/EdelsbrunnerS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/ErdosK90, author = {Paul Erd{\"{o}}s and P{\'{e}}ter Komj{\'{a}}th}, title = {Countable Decompositions of R\({}^{\mbox{2}}\) and R\({}^{\mbox{3}}\)}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {325--331}, year = {1990}, url = {https://doi.org/10.1007/BF02187793}, doi = {10.1007/BF02187793}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/ErdosK90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Filliman90, author = {Paul Filliman}, title = {Exterior Algebra and projections of Polytopes}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {305--322}, year = {1990}, url = {https://doi.org/10.1007/BF02187792}, doi = {10.1007/BF02187792}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Filliman90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/FredericksonR90, author = {Greg N. Frederickson and Susan H. Rodger}, title = {A New Approach to the Dynamic Maintaince of Maximal Points in a Plane}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {365--374}, year = {1990}, url = {https://doi.org/10.1007/BF02187797}, doi = {10.1007/BF02187797}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/FredericksonR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/GrahamS90, author = {Ronald L. Graham and Neil J. A. Sloane}, title = {Penny-Packing and Two-Dimensional Codes}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {1--11}, year = {1990}, url = {https://doi.org/10.1007/BF02187775}, doi = {10.1007/BF02187775}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/GrahamS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/GretenkortKS90, author = {J{\"{o}}rg Gretenkort and Peter Kleinschmidt and Bernd Sturmfels}, title = {On the Existence of Certain Smooth Toric Varieties}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {255--262}, year = {1990}, url = {https://doi.org/10.1007/BF02187789}, doi = {10.1007/BF02187789}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/GretenkortKS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Groemer90, author = {H. Groemer}, title = {On Convex Bodies that Permit Packings of High Density}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {357--364}, year = {1990}, url = {https://doi.org/10.1007/BF02187796}, doi = {10.1007/BF02187796}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Groemer90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/KedemS90, author = {Klara Kedem and Micha Sharir}, title = {An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {43--75}, year = {1990}, url = {https://doi.org/10.1007/BF02187779}, doi = {10.1007/BF02187779}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/KedemS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/KernW90, author = {Walter Kern and Alfred Wanka}, title = {On a Problem About Covering Lines by Squares}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {77--82}, year = {1990}, url = {https://doi.org/10.1007/BF02187780}, doi = {10.1007/BF02187780}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/KernW90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Khachiyan90, author = {Leonid Khachiyan}, title = {An Inequality for the Volume of Inscribed Ellipsoids}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {219--222}, year = {1990}, url = {https://doi.org/10.1007/BF02187786}, doi = {10.1007/BF02187786}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Khachiyan90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/KleeK90, author = {Victor Klee and Peter Kleinschmidt}, title = {Geometry of the Gass-Saaty Parametric Cost {LP} Algorithm}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {13--26}, year = {1990}, url = {https://doi.org/10.1007/BF02187776}, doi = {10.1007/BF02187776}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/KleeK90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/KosT90, author = {G{\'{e}}za K{\'{o}}s and Jen{\"{o}} T{\"{o}}r{\"{o}}csik}, title = {Convex Disks Can Cover Their Shadow}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {529--531}, year = {1990}, url = {https://doi.org/10.1007/BF02187808}, doi = {10.1007/BF02187808}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/KosT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Kung90, author = {Joseph P. S. Kung}, title = {Combinatorial Geometries Representable over {GF(3)} and GF(q). I. The Number of Points}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {83--95}, year = {1990}, url = {https://doi.org/10.1007/BF02187781}, doi = {10.1007/BF02187781}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Kung90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/KuperbergK90, author = {Greg Kuperberg and Wlodzimierz Kuperberg}, title = {Double-Lattice Packings of Convex Bodies in the Plane}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {389--397}, year = {1990}, url = {https://doi.org/10.1007/BF02187800}, doi = {10.1007/BF02187800}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/KuperbergK90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Matousek90, author = {Jir{\'{\i}} Matousek}, title = {Construction of epsilon-Nets}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {427--448}, year = {1990}, url = {https://doi.org/10.1007/BF02187804}, doi = {10.1007/BF02187804}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Matousek90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/PatersonY90, author = {Mike Paterson and F. Frances Yao}, title = {Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {485--503}, year = {1990}, url = {https://doi.org/10.1007/BF02187806}, doi = {10.1007/BF02187806}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/PatersonY90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/RappaportIT90, author = {David Rappaport and Hiroshi Imai and Godfried T. Toussaint}, title = {Computing Simple Circuits form a Set of Line Segments}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {289--304}, year = {1990}, url = {https://doi.org/10.1007/BF02187791}, doi = {10.1007/BF02187791}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/RappaportIT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Wenger90, author = {Rephael Wenger}, title = {Upper Bounds on Geometric Permutations for Convex Sets}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {27--33}, year = {1990}, url = {https://doi.org/10.1007/BF02187777}, doi = {10.1007/BF02187777}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Wenger90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Wenger90a, author = {Rephael Wenger}, title = {A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets}, journal = {Discret. Comput. Geom.}, volume = {5}, pages = {383--388}, year = {1990}, url = {https://doi.org/10.1007/BF02187799}, doi = {10.1007/BF02187799}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Wenger90a.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.