×

Found 40 Documents (Results 1–40)

A SAT attack on the Erdős-Szekeres conjecture. (English) Zbl 1346.05180

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 425-431, electronic only (2015).
MSC:  05C55 05D10 52C10
PDF BibTeX XML Cite
Full Text: DOI

On the computational complexity of Erdős-Szekeres and related problems in \(\mathbb{R}^{3}\). (English) Zbl 1395.68150

Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 541-552 (2013).
PDF BibTeX XML Cite
Full Text: DOI

Higher-order Erdős-Szekeres theorems. (English) Zbl 1293.52014

Proceedings of the 28th annual symposium on computational geometry, SoCG 2012, Chapel Hill, NC, USA, June 17–20, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1299-8). 81-90 (2012).
PDF BibTeX XML Cite
Full Text: DOI

Empty convex hexagons in planar point sets. Reprinted from the journal Discrete & Computational Geometry 39, No. 1-3 (2008). (English) Zbl 1169.52006

Goodman, Jacob E. (ed.) et al., Twentieth anniversary volume: Discrete and computational geometry. New York, NY: Springer (ISBN 978-0-387-87362-6/pbk). 220-253 (2009).
MSC:  52C10
PDF BibTeX XML Cite

On empty hexagons. (English) Zbl 1147.52301

Goodman, Jacob E. (ed.) et al., Surveys on discrete and computational geometry. Twenty years later. AMS-IMS-SIAM summer research conference, Snowbird, UT, USA, June 18–22, 2006. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4239-3/pbk). Contemporary Mathematics 453, 433-441 (2008).
MSC:  52C10
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Main Field

Software