David Flores-Peñaloza

Orcid: 0000-0002-5411-3049

According to our database1, David Flores-Peñaloza authored at least 22 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Matching random colored points with rectangles.
J. Comb. Optim., March, 2023

On maximum-sum matchings of points.
J. Glob. Optim., 2023

On polynomials associated to Voronoi diagrams of point sets and crossing numbers.
CoRR, 2023

2021
Rainbow polygons for colored point sets in the plane.
Discret. Math., 2021

2019
The topology of look-compute-move robot wait-free algorithms with hard termination.
Distributed Comput., 2019

2018
Computing balanced islands in two colored point sets in the plane.
Inf. Process. Lett., 2018

Modem illumination of monotone polygons.
Comput. Geom., 2018

2017
Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Optimizing some constructions with bars: new geometric knapsack problems.
J. Comb. Optim., 2016

2015
Balanced Islands in Two Colored Point Sets in the Plane.
CoRR, 2015

2014
Embedding the double Circle in a Square Grid of Minimum Size.
Int. J. Comput. Geom. Appl., 2014

2013
Proximity graphs inside large weighted graphs.
Networks, 2013

On the connectedness and diameter of a Geometric Johnson Graph.
Discret. Math. Theor. Comput. Sci., 2013

Drawing the double circle on a grid of minimum size
CoRR, 2013

2012
Min-energy broadcast in mobile ad hoc networks with restricted motion.
J. Comb. Optim., 2012

Token Graphs.
Graphs Comb., 2012

Covering moving points with anchored disks.
Eur. J. Oper. Res., 2012

2011
On crossing numbers of geometric proximity graphs.
Comput. Geom., 2011

2010
Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010

2009
On the Chromatic Number of some Flip Graphs.
Discret. Math. Theor. Comput. Sci., 2009

Empty monochromatic triangles.
Comput. Geom., 2009

Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009


  Loading...