Follow
Marco A. Heredia
Marco A. Heredia
Universidad Autónoma Metropolitana - Azcapotzalco, Mexico City
Verified email at azc.uam.mx
Title
Cited by
Cited by
Year
On k-gons and k-holes in point sets
O Aichholzer, R Fabila-Monroy, H González-Aguilar, T Hackl, MA Heredia, ...
Computational Geometry 48 (7), 528-537, 2015
222015
4-holes in point sets
O Aichholzer, R Fabila-Monroy, H González-Aguilar, T Hackl, MA Heredia, ...
Computational Geometry 47 (6), 644-650, 2014
152014
On convex quadrangulations of point sets on the plane
VM Heredia, J Urrutia
Discrete Geometry, Combinatorics and Graph Theory, 38-46, 2007
92007
A triplet integer programming model for the Euclidean 3-matching problem
GV Casas, RAC Campos, MA Heredia, FJZ Martínez
2015 12th International Conference on Electrical Engineering, Computing …, 2015
42015
On optimal coverage of a tree with multiple robots
I Aldana-Galvan, JC Catana-Salazar, JM Díaz-Báñez, F Duque, ...
European Journal of Operational Research 285 (3), 844-852, 2020
32020
Integer Programming Models and Heuristics for Non-crossing Euclidean 3-Matchings
RAC Campos, MAH Velasco, GV Casas, FJZ Martínez
NEO 2016, 119-139, 2018
32018
Min-energy broadcast in mobile ad hoc networks with restricted motion
JM Díaz-Báñez, R Fabila-Monroy, D Flores-Peñaloza, MA Heredia, ...
Journal of Combinatorial Optimization 24 (4), 413-426, 2012
32012
Convex blocking and partial orders on the plane
JM Díaz-Báñez, MA Heredia, C Peláez, JA Sellarès, J Urrutia, I Ventura
Computational Geometry 51, 55-66, 2016
22016
On the number of edges in geometric graphs without empty triangles
C Bautista-Santiago, MA Heredia, C Huemer, A Ramírez-Vigueras, ...
Graphs and Combinatorics 29 (6), 1623-1631, 2013
22013
Constrained many-to-many point matching in two dimensions
LE Caraballo, RA Castro, JM Díaz-Báñez, MA Heredia, J Urrutia, ...
Optimization Letters, 1-18, 2024
2024
Online Algorithms for Tree Coverage
I Ventura, JM Dıaz-Banez, RA Castro, MA Heredia, FJ Zaragoza, J Urrutia
The system can't perform the operation now. Try again later.
Articles 1–11