I am a doctoral candidate at the Doctoral School in Mathematics at ELTE, specifically at the Department of Computer Science. I am currently working at the Artificial Intelligence department of the Alfréd Rényi Institute of Mathematics.
P5 P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi: Orientation of good covers (submitted) [arXiv-preprint related: C6]
P4 P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi: Orientation of convex sets (submitted) [arXiv-preprint | related: C5, C6, C7]
P3 P. Ágoston: On the range of two-distance graphs (under preparation) [related: C3, C4]
P2 P. Ágoston: A lower bound on the number of colours needed to nicely colour a sphere (submitted) [related: C2]
P1 P. Ágoston, D. Pálvölgyi: An improved constant factor for the unit distance problem, Studia Scientiarum Mathematicarum Hungarica Combinatorics, Geometry and Topology, 59 (1), 40–57. [link | arXiv preprint | related: C1, T2]
C7 P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi: Orientation of convex sets, Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, 2023 [related: P3]
C6 P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi: Orientation type of intersecting convex planar sets, Nordic Combinatorial Conference, Tromsø, Norway, 2022 [related: P4, P5]
C5 P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi: Orientation of convex sets, European Workshop on Computational Geometry, Perugia, Italy, 2022 [related: P4]
C4 P. Ágoston: Semialgebraic sets as ranges of two-distance graphs, Developments in Computer Science, Budapest, Hungary online, 2021 [related: P3, C3]
C3 P. Ágoston: On the range of two-distance graphs, Computational Geometry: Young Researchers' Forum, Buffalo, NY, USA online, 2021 [long abstract | related: P3, C4]
C2 P. Ágoston: A lower bound on the number of colours needed to nicely colour a sphere, Canadian Conference in Computational Geometry, Saskatoon, SK, Canada online, 2020 [long abstract | video | related: P2]
C1 P. Ágoston, D. Pálvölgyi: Improved constant factor for the unit distance problem, European Workshop on Computational Geometry, Würzburg, Germany online, 2020, [paper | presentation | video | related: T2, P1]
T2 (MSc) P. Ágoston: Probablistic formulation of the Hadwiger–Nelson problem (2019)*
T1 (BSc) P. Ágoston: Az Erdős–Szekeres-problémakör és üres sokszögekre vonatkozó változatai (2017) (in Hungarian)