Péter Ágoston

Orcid: 0000-0002-5478-7545

According to our database¹, Péter Ágoston authored at least 7 papers between 2020 and 2025.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers.

[BibT_eX]

[DOI]

CoRR, April, 2025

Orientation of good covers.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Maximizing the Maximum Degree in Ordered Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Orientation of Convex Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2020

An improved constant factor for the unit distance problem.

[BibT_eX]

[DOI]

Péter Ágoston

Dömötör Pálvölgyi

CoRR, 2020

A lower bound on the number of colours needed to nicely colour a sphere.

[BibT_eX]

Péter Ágoston

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Péter Ágoston

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...