Alan M Arroyo Guevara
Wagner Group
7 Publications
2021 | Journal Article | IST-REx-ID: 9295 | 
Arroyo Guevara AM, Mcquillan D, Richter RB, Salazar G, Sullivan M. 2021. Drawings of complete graphs in the projective plane. Journal of Graph Theory.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 9468 |
Arroyo Guevara AM, Richter RB, Sunohara M. 2021. Extending drawings of complete graphs into arrangements of pseudocircles. SIAM Journal on Discrete Mathematics. 35(2), 1050–1076.
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9296 |
Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 7994 |
Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8732
Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301, 325–338.
View
| DOI
2019 | Conference Paper | IST-REx-ID: 7230 |
Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). GD: Graph Drawing and Network Visualization, LNCS, vol. 11904, 230–243.
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 6638 |
Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics. 342(11), 3201–3207.
View
| DOI
| Download Preprint (ext.)
| arXiv
7 Publications
2021 | Journal Article | IST-REx-ID: 9295 |
Arroyo Guevara AM, Mcquillan D, Richter RB, Salazar G, Sullivan M. 2021. Drawings of complete graphs in the projective plane. Journal of Graph Theory.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 9468 |
Arroyo Guevara AM, Richter RB, Sunohara M. 2021. Extending drawings of complete graphs into arrangements of pseudocircles. SIAM Journal on Discrete Mathematics. 35(2), 1050–1076.
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9296 |
Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 7994 |
Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8732
Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301, 325–338.
View
| DOI
2019 | Conference Paper | IST-REx-ID: 7230 |
Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). GD: Graph Drawing and Network Visualization, LNCS, vol. 11904, 230–243.
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 6638 |
Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics. 342(11), 3201–3207.
View
| DOI
| Download Preprint (ext.)
| arXiv