![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Carlos Hidalgo-Toscano
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Luis Evaristo Caraballo, José Miguel Díaz-Báñez
, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Stochastic strategies for patrolling a terrain with a synchronized multi-robot system. Eur. J. Oper. Res. 301(3): 1099-1116 (2022) - [i11]Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Stochastic strategies for patrolling a terrain with a synchronized multi-robot system. CoRR abs/2209.06968 (2022) - [i10]Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Daniel Perz, Birgit Vogtenhuber:
No Selection Lemma for Empty Triangles. CoRR abs/2210.00630 (2022) - 2021
- [j8]Luis Evaristo Caraballo, José Miguel Díaz-Báñez
, Ruy Fabila Monroy
, Carlos Hidalgo-Toscano
, Jesús Leaños, Amanda Montejano
:
On the number of order types in integer grids of small size. Comput. Geom. 95: 101730 (2021) - [j7]Frank Duque
, Ruy Fabila Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano
:
Counting the number of crossings in geometric graphs. Inf. Process. Lett. 165: 106028 (2021) - 2020
- [j6]Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro:
The Chromatic Number of the Disjointness Graph of the Double Chain. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j5]Oswin Aichholzer
, Frank Duque
, Ruy Fabila Monroy, Oscar E. García-Quintero, Carlos Hidalgo-Toscano
:
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. J. Graph Algorithms Appl. 24(3): 421-432 (2020) - [i9]Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CoRR abs/2001.08062 (2020)
2010 – 2019
- 2019
- [c4]Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CCCG 2019: 44-48 - [c3]Oswin Aichholzer
, Ruy Fabila Monroy
, Adrian Fuchs, Carlos Hidalgo-Toscano
, Irene Parada
, Birgit Vogtenhuber
, Francisco Zaragoza:
On the 2-Colored Crossing Number. GD 2019: 87-100 - [i8]Frank Duque, Ruy Fabila Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano:
Counting the Number of Crossings in Geometric Graphs. CoRR abs/1904.11037 (2019) - [i7]Oswin Aichholzer, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Oscar E. García-Quintero:
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. CoRR abs/1907.07796 (2019) - [i6]Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza:
On the 2-colored crossing number. CoRR abs/1908.06461 (2019) - 2018
- [j4]Frank Duque
, Ruy Fabila Monroy
, Carlos Hidalgo-Toscano
:
Point Sets with Small Integer Coordinates and No Large Convex Polygons. Discret. Comput. Geom. 59(2): 461-476 (2018) - [c2]Ruy Fabila Monroy, Carlos Hidalgo-Toscano
, Clemens Huemer, Dolores Lara, Dieter Mitsche:
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. GD 2018: 593-605 - [i5]Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche:
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. CoRR abs/1808.09024 (2018) - [i4]Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano:
On the Number of Order Types in Integer Grids of Small Size. CoRR abs/1811.02455 (2018) - 2017
- [j3]Luis Barba, Frank Duque
, Ruy Fabila Monroy, Carlos Hidalgo-Toscano
:
Drawing the Horton set in an integer grid of minimum size. Comput. Geom. 63: 10-19 (2017) - [j2]Frank Duque
, Ruy Fabila Monroy, Carlos Hidalgo-Toscano
, Pablo Pérez-Lantero:
Drawing the almost convex set in an integer grid of minimum size. Comput. Geom. 65: 1-11 (2017) - 2016
- [i3]Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Pablo Pérez-Lantero:
Drawing the Almost Convex Set in an Integer Grid of Minimum Size. CoRR abs/1606.02328 (2016) - 2015
- [j1]Frank Duque
, Carlos Hidalgo-Toscano
:
An Upper Bound on the k-Modem Illumination Problem. Int. J. Comput. Geom. Appl. 25(4): 299- (2015) - [i2]Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Drawing the Horton Set in an Integer Grid of Minimum Size. CoRR abs/1506.05505 (2015) - 2014
- [c1]Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Drawing the Horton Set in an Integer Grid of Minimun Size. CCCG 2014 - [i1]Frank Duque, Carlos Hidalgo-Toscano:
An upper bound on the k-modem illumination problem. CoRR abs/1410.4099 (2014)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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: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