Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
Bajuelos Dominguez, Antonio
Positions
Associate Teaching Professor
,
Knight Foundation School of Computing and Information Sciences
,
College of Engineering and Computing
Share this page
Twitter
Email
Copy link
Share
Scholarly & Creative Works
Contact
View All
Scholarly & Creative Works
selected scholarly works & creative activities
Article
2015
Some results on open-edge and open mobile guarding of polygons and triangulations
.
COMPUTER JOURNAL
. 58:160-171.
Full Text via DOI:
10.1093/comjnl/bxt151
2013
Guarding orthogonal galleries with rectangular rooms
.
COMPUTER JOURNAL
. 57:1668-1673.
Full Text via DOI:
10.1093/comjnl/bxt089
2012
A hybrid metaheuristic strategy for covering with wireless devices
2012
Minimizing the range for k-covered paths on sensor networks
.
COMPUTER JOURNAL
. 55:69-81.
Full Text via DOI:
10.1093/comjnl/bxr076
2011
Coverage restricted to an angle
.
OPERATIONS RESEARCH LETTERS
. 39:241-245.
Full Text via DOI:
10.1016/j.orl.2011.04.011
2009
Optimal 2-coverage of a polygonal region in a sensor network
Full Text via DOI:
10.3390/a2031137
2009
2-Covered paths by a set of antennas with minimum power transmission range
.
INFORMATION PROCESSING LETTERS
. 109:768-773.
Full Text via DOI:
10.1016/j.ipl.2009.03.016
2009
The embracing Voronoi diagram and closest embracing number
Full Text via DOI:
10.1007/s10958-009-9610-0
2008
Optimizing the minimum vertex guard set on simple polygons via a genetic algorithm
2004
Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: Lower and upper bounds on the number of pieces
.
DISTRIBUTED COMPUTING (DISC 2014)
. 3045:127-136.
Full Text via DOI:
10.1007/978-3-540-24767-8_14
2004
Quadratic-time linear-space algorithms for generating orthogonal polygons with a given number of vertices
.
DISTRIBUTED COMPUTING (DISC 2014)
. 3045:117-126.
Full Text via DOI:
10.1007/978-3-540-24767-8_13
2003
Approximation algorithms to minimum vertex cover problems on polygons and terrains
.
DISTRIBUTED COMPUTING (DISC 2014)
. 2657:869-878.
Full Text via DOI:
10.1007/3-540-44860-8_90
Conference
2012
Connecting red cells in a bicolour Voronoi diagram
.
DISTRIBUTED COMPUTING (DISC 2014)
. 210-219.
Full Text via DOI:
10.1007/978-3-642-34191-5_20
2009
Metaheuristic approaches for the minimum vertex guard problem
. 77-82.
Full Text via DOI:
10.1109/ADVCOMP.2009.19
2008
Estimating the maximum hidden vertex set in polygons
. 421-432.
Full Text via DOI:
10.1109/ICCSA.2008.19
2007
Some problems related to good illumination
.
DISTRIBUTED COMPUTING (DISC 2014)
. 1-14.
Full Text via DOI:
10.1007/978-3-540-74472-6_1
2006
On visibility problems in the plane - Solving minimum vertex guard problems by successive approximations
2006
Characterizing and covering some subclasses of orthogonal polygons
.
DISTRIBUTED COMPUTING (DISC 2014)
. 255-262.
Full Text via DOI:
10.1007/11758525_34
2004
Generating random orthogonal polygons
.
DISTRIBUTED COMPUTING (DISC 2014)
. 364-373.
Full Text via DOI:
10.1007/978-3-540-25945-9_36
2002
A methodology for developing adaptive educational-game environments
.
DISTRIBUTED COMPUTING (DISC 2014)
. 90-99.
Full Text via DOI:
10.1007/3-540-47952-x_11
Contact
full name
Antonio
Bajuelos Dominguez
visualizations
Co-author Network
Map of Science