default search action
David Flores-Peñaloza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j19]David Flores-Peñaloza, Mario Alberto López, Nestaly Marín
, David Orden:
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets. Inf. Process. Lett. 189: 106551 (2025) - 2024
- [j18]Mercè Claverol, Andrea de las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer, David Orden:
On polynomials associated to Voronoi diagrams of point sets and crossing numbers. Discret. Math. Theor. Comput. Sci. 26(2) (2024) - [i8]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
- [j17]Josué Corujo
Matching random colored points with rectangles. J. Comb. Optim. 45(2): 81 (2023) - [j16]Sergey Bereg
On maximum-sum matchings of points. J. Glob. Optim. 85(1): 111-128 (2023) - [i7]Mercè Claverol, Andrea de las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer, David Orden:
On polynomials associated to Voronoi diagrams of point sets and crossing numbers. CoRR abs/2304.12238 (2023) - 2021
- [j15]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval
Rainbow polygons for colored point sets in the plane. Discret. Math. 344(7): 112406 (2021) - 2020
- [c4]Josué Corujo
Matching Random Colored Points with Rectangles. WALCOM 2020: 261-272 - [i6]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. CoRR abs/2007.10139 (2020)
2010 – 2019
- 2019
- [j14]Manuel Alcantara
The topology of look-compute-move robot wait-free algorithms with hard termination. Distributed Comput. 32(3): 235-255 (2019) - [i5]Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara:
On Maximum-Sum Matchings of Points. CoRR abs/1911.10610 (2019) - 2018
- [j13]Oswin Aichholzer
Modem illumination of monotone polygons. Comput. Geom. 68: 101-118 (2018) - [j12]Oswin Aichholzer
Computing balanced islands in two colored point sets in the plane. Inf. Process. Lett. 135: 28-32 (2018) - 2017
- [c3]Sergio Rajsbaum
Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. IPDPS 2017: 493-502 - 2016
- [j11]Sergey Bereg
Optimizing some constructions with bars: new geometric knapsack problems. J. Comb. Optim. 31(3): 1160-1173 (2016) - 2015
- [i4]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber:
Modem Illumination of Monotone Polygons. CoRR abs/1503.05062 (2015) - [i3]Oswin Aichholzer, Nieves Atienza, Ruy Fabila Monroy, Pablo Pérez-Lantero, José Miguel Díaz-Báñez, David Flores-Peñaloza, Birgit Vogtenhuber, Jorge Urrutia:
Balanced Islands in Two Colored Point Sets in the Plane. CoRR abs/1510.01819 (2015) - 2014
- [j10]Sergey Bereg
Embedding the double Circle in a Square Grid of Minimum Size. Int. J. Comput. Geom. Appl. 24(3): 247- (2014) - 2013
- [j9]Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento
On the connectedness and diameter of a Geometric Johnson Graph. Discret. Math. Theor. Comput. Sci. 15(3): 21-30 (2013) - [j8]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant
Proximity graphs inside large weighted graphs. Networks 61(1): 29-39 (2013) - [i2]Sergey Bereg, Ruy Fabila Monroy, David Flores-Peñaloza, Mario Alberto López, Pablo Pérez-Lantero:
Drawing the double circle on a grid of minimum size. CoRR abs/1305.6693 (2013) - 2012
- [j7]Crevel Bautista-Santiago, José Miguel Díaz-Báñez
Covering moving points with anchored disks. Eur. J. Oper. Res. 216(2): 278-285 (2012) - [j6]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer
Token Graphs. Graphs Comb. 28(3): 365-380 (2012) - [j5]José Miguel Díaz-Báñez
Min-energy broadcast in mobile ad hoc networks with restricted motion. J. Comb. Optim. 24(4): 413-426 (2012) - [i1]Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia:
On the Connectedness and Diameter of a Geometric Johnson Graph. CoRR abs/1202.3455 (2012) - 2011
- [j4]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant
On crossing numbers of geometric proximity graphs. Comput. Geom. 44(4): 216-233 (2011) - 2010
- [b1]David Flores-Peñaloza:
Resultados algorítmicos y combinatorios sobre gráficas geométricas. UNAM, Mexico, 2010 - [j3]Oswin Aichholzer, Sergio Cabello
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010)
2000 – 2009
- 2009
- [j2]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer
Empty monochromatic triangles. Comput. Geom. 42(9): 934-938 (2009) - [j1]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood
On the Chromatic Number of some Flip Graphs. Discret. Math. Theor. Comput. Sci. 11(2): 47-56 (2009) - [c2]David Flores-Peñaloza, Francisco Javier Zaragoza Martínez:
Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. CCCG 2009: 91-94 - 2008
- [c1]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Triangles. CCCG 2008
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 2025-03-04 21:15 CET 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: