A lower bound on the number of colours needed to nicely colour a sphere. - Péter Ágoston (CCCG, 2020)

An improved constant factor for the unit distance problem. - Péter Ágoston; Dömötör Pálvölgyi (CoRR, 2020)

Orientation of Convex Sets. - Péter Ágoston; Gábor Damásdi; Balázs Keszegh; Dömötör Pálvölgyi (Electron. J. Comb., 2024)

Maximizing the Maximum Degree in Ordered Yao Graphs. - Péter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng (CoRR, 2024)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs. - Péter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng (CALDAM, 2025)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers. - Péter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng (CoRR, 2025)