Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Nadja Seiferth"'
Publikováno v:
FOCS
We show that many natural two-dimensional packing problems are algorithmically equivalent to finding real roots of multivariate polynomials. A two-dimensional packing problem is defined by the type of pieces, containers, and motions that are allowed.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fe6baed85bffb9381ec017ff44d6727
https://doi.org/10.1109/focs46700.2020.00098
https://doi.org/10.1109/focs46700.2020.00098
Autor:
Oswin Aichholzer, Michael Hoffmann, Birgit Vogtenhuber, Daniel Perz, Alexandra Weinberger, Nadja Seiferth, Johannes Obenaus, Rosna Paul
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph Drawing and Network Visualization
Lecture Notes in Computer Science, 12590
Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing and Network Visualization-28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers
Lecture Notes in Computer Science-Graph Drawing and Network Visualization
Lecture Notes in Computer Science, 12590
Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing and Network Visualization-28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers
Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line drawing of the complete graph contains a monochromatic plane spanning tree. It is open if this statement generalizes to other classes of drawings, specifically, to simple drawin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8828d38b0bdf994cd10456d7c39cf85f
