  |
Items where Author is "Rote, Günter"
Group by: Item Type | No Grouping Number of items: 3. Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2022) An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. DISCRETE AND COMPUTATIONAL GEOMETRY : AN INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE. pp. 1-29. ISSN 0179-5376 (print); 1432-0444 (online) Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2020) An almost optimal bound on the number of intersections of two simple polygons. In: 36th International Symposium on Computational Geometry, SoCG 2020. Leibniz-Zentrum für Informatik, Wadern. ISBN 9783959771436 Gerbner, Dániel and Keszegh, Balázs and Pálvölgyi, Dömötör and Rote, Günter and Wiener, Gábor (2015) Search for the end of a path in the d-dimensional grid and in other graphs. Ars Mathematica Contemporanea. (In Press) |
