default search action
Nestaly Marín-Nevárez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Jose Luis Álvarez-Rebollar
, Jorge Cravioto-Lagos, Nestaly Marín
Crossing and intersecting families of geometric graphs on point sets. Graphs Comb. 40(1): 17 (2024) - [i4]David Flores-Peñaloza, Mario Alberto López, Nestaly Marín, David Orden:
Rainbow ortho-convex 4-sets in k-colored point sets. CoRR abs/2404.06376 (2024) - 2023
- [j7]José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Separability, Boxicity, and Partial Orders. Order 40(3): 699-712 (2023) - 2022
- [b1]Nestaly Marín-Nevárez:
Variantes del problema de la galería de arte y geometría de orientaciones restringidas. UNAM, Mexico, 2022 - [j6]A. Arévalo, R. Chávez-Jiménez, A. Hernández-Mora, R. López-López, Nestaly Marín
On Rainbow Quadrilaterals in Colored Point Sets. Graphs Comb. 38(5): 152 (2022) - [j5]Vitor Tocci F. de Luca, Nestaly Marín
Grid straight-line embeddings of trees with a minimum number of bends per path. Inf. Process. Lett. 174: 106210 (2022) - [j4]Jose Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín
Representing point sets on the plane as permutations. Inf. Process. Lett. 175: 106228 (2022) - [j3]Sergey Bereg
Optimal placement of base stations in border surveillance using limited capacity drones. Theor. Comput. Sci. 928: 183-196 (2022) - [i3]José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards. CoRR abs/2208.12864 (2022) - [i2]Sergey Bereg, José Miguel Díaz-Báñez, Mohammadreza Haghpanah, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Fabio Rodríguez, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones. CoRR abs/2209.13311 (2022) - [i1]José Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín, Oriol Andreu Solé-Pi, Jorge Urrutia:
Crossing and intersecting families of geometric graphs on point sets. CoRR abs/2211.09904 (2022) - 2020
- [j2]Israel Aldana-Galván, Carlos Alegría, Jose Luis Álvarez-Rebollar, Nestaly Marín-Nevárez
Finding minimum witness sets in orthogonal polygons. Comput. Geom. 90: 101656 (2020) - [j1]Israel Aldana-Galván
Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons. Graphs Comb. 36(3): 617-630 (2020)
2010 – 2019
- 2018
- [c2]Israel Aldana-Galván, Carlos Alegría-Galicia, Jose Luis Álvarez-Rebollar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Finding Minimum Witness Sets in Orthogonal Polygons. CCCG 2018: 253-258 - 2017
- [c1]Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan C. Catana-Salazar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Beacon Coverage in Orthogonal Polyhedra. CCCG 2017: 156-161
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-09-10 23:43 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: