default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuy Fabila Monroy
- > Home > Persons > Ruy Fabila Monroy
Publications
- 2019
[j41]Oswin Aichholzer, Ruy Fabila Monroy, Ferran Hurtado, Pablo Pérez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, Birgit Vogtenhuber:
Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd. Comput. Geom. 77: 51-61 (2019)- 2018
- [j39]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell
, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. Comput. Geom. 68: 292-308 (2018) - [i23]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. CoRR abs/1802.03415 (2018) - 2014
- [c12]Oswin Aichholzer, Ruy Fabila Monroy, Ferran Hurtado, Pablo Pérez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, Birgit Vogtenhuber:
Order types and cross-sections of line arrangements in R^3. CCCG 2014 - [c10]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored Ray Configurations. CCCG 2014 - 2013
- [j17]Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian:
Non-crossing matchings of points with geometric objects. Comput. Geom. 46(1): 78-92 (2013) - [j13]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell:
Proximity graphs inside large weighted graphs. Networks 61(1): 29-39 (2013) - 2012
- [j11]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood:
Token Graphs. Graphs Comb. 28(3): 365-380 (2012) - 2011
- [j8]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Vera Sacristán, Maria Saumell:
On crossing numbers of geometric proximity graphs. Comput. Geom. 44(4): 216-233 (2011) - 2010
- [j6]Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood:
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010) - [c2]Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian:
Matching Points with Things. LATIN 2010: 456-467 - 2009
- [j3]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia:
On the Chromatic Number of some Flip Graphs. Discret. Math. Theor. Comput. Sci. 11(2): 47-56 (2009)
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-08-05 21:25 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:
