default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan Arroyo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Alan Arroyo
, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera:
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69(3): 745-770 (2023)- [j12]Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. J. Graph Algorithms Appl. 27(6): 433-457 (2023) - 2022
- [j11]Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Convex drawings of the complete graph: topology meets geometry. Ars Math. Contemp. 22(3): 3 (2022) - [j10]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. J. Graph Algorithms Appl. 26(2): 225-240 (2022) - [c6]Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. WALCOM 2022: 383-395 - 2021
- [j9]Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar, Matthew Sullivan:
Drawings of complete graphs in the projective plane. J. Graph Theory 97(3): 426-440 (2021) - [j8]Alan Arroyo, Julien Bensmail, R. Bruce Richter:
Extending Drawings of Graphs to Arrangements of Pseudolines. J. Comput. Geom. 12(2): 3-24 (2021) - [j7]Alan Arroyo, R. Bruce Richter, Matthew Sunohara:
Extending Drawings of Complete Graphs into Arrangements of Pseudocircles. SIAM J. Discret. Math. 35(2): 1050-1076 (2021) - [c5]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. WALCOM 2021: 221-233 - [i5]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. CoRR abs/2101.03928 (2021) - [i4]Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. CoRR abs/2109.14892 (2021) - 2020
- [c4]Alan Arroyo, Julien Bensmail, R. Bruce Richter:
Extending Drawings of Graphs to Arrangements of Pseudolines. SoCG 2020: 9:1-9:14 - [c3]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Inserting One Edge into a Simple Drawing Is Hard. WG 2020: 325-338 - [i3]Alan Arroyo, R. Bruce Richter, Matthew Sunohara:
Extending drawings of complete graphs into arrangements of pseudocircles. CoRR abs/2001.06053 (2020)
2010 – 2019
- 2019
- [j6]André C. Silva, Alan Arroyo, R. Bruce Richter, Orlando Lee:
Graphs with at most one crossing. Discret. Math. 342(11): 3201-3207 (2019) - [c2]Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. GD 2019: 230-243 - [i2]Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. CoRR abs/1908.08129 (2019) - [i1]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Extending simple drawings with one edge is hard. CoRR abs/1909.07347 (2019) - 2018
- [j5]Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. J. Graph Theory 87(4): 443-459 (2018) - [j4]Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. SIAM J. Discret. Math. 32(3): 2080-2093 (2018) - 2017
- [j3]Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem). Australas. J Comb. 67: 131-144 (2017) - [j2]Alan Arroyo, R. Bruce Richter:
Characterizing Graphs with Crossing Number at Least 2. J. Graph Theory 85(4): 738-746 (2017) - 2016
- [c1]Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. GD 2016: 427-438 - 2013
- [j1]Alan Arroyo, Hortensia Galeana-Sánchez:
The Path Partition Conjecture is true for some generalizations of tournaments. Discret. Math. 313(3): 293-300 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
