Publications
selected scholarly works & creative activities
-
Article
-
2015Some 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
-
2013Guarding orthogonal galleries with rectangular rooms. Computer Journal. 57:1668-1673.Full Text via DOI: 10.1093/comjnl/bxt089
-
2012A hybrid metaheuristic strategy for covering with wireless devices. Journal of Universal Computer Science. 18:1906-1932.
-
2012Minimizing the range for k-covered paths on sensor networks. Computer Journal. 55:69-81.Full Text via DOI: 10.1093/comjnl/bxr076
-
2011Coverage restricted to an angle. Operations Research Letters. 39:241-245.Full Text via DOI: 10.1016/j.orl.2011.04.011
-
2009Optimal 2-coverage of a polygonal region in a sensor network. Algorithms. 2:1137-1154.Full Text via DOI: 10.3390/a2031137
-
20092-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
-
2009The embracing Voronoi diagram and closest embracing number. Journal of Mathematical Sciences. 161:909-918.Full Text via DOI: 10.1007/s10958-009-9610-0
-
2008Optimizing the minimum vertex guard set on simple polygons via a genetic algorithm. WSEAS Transactions on Information Science and Applications. 5:1584-1596.
-
2004Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: Lower and upper bounds on the number of pieces. Lecture Notes in Computer Science. 3045:127-136.Full Text via DOI: 10.1007/978-3-540-24767-8_14
-
2004Quadratic-time linear-space algorithms for generating orthogonal polygons with a given number of vertices. Lecture Notes in Computer Science. 3045:117-126.Full Text via DOI: 10.1007/978-3-540-24767-8_13
-
2003Approximation algorithms to minimum vertex cover problems on polygons and terrains. Lecture Notes in Computer Science. 2657:869-878.Full Text via DOI: 10.1007/3-540-44860-8_90
-
-
Conference
-
2012Connecting red cells in a bicolour Voronoi diagram. Lecture Notes in Computer Science. 210-219.Full Text via DOI: 10.1007/978-3-642-34191-5_20
-
2009Metaheuristic approaches for the minimum vertex guard problem. 77-82.Full Text via DOI: 10.1109/ADVCOMP.2009.19
-
2008Estimating the maximum hidden vertex set in polygons. 421-432.Full Text via DOI: 10.1109/ICCSA.2008.19
-
2007Some problems related to good illumination. Lecture Notes in Computer Science. 1-14.Full Text via DOI: 10.1007/978-3-540-74472-6_1
-
2006Characterizing and covering some subclasses of orthogonal polygons. Lecture Notes in Computer Science. 255-262.Full Text via DOI: 10.1007/11758525_34
-
2004Generating random orthogonal polygons. Lecture Notes in Computer Science. 364-373.Full Text via DOI: 10.1007/978-3-540-25945-9_36
-
2002A methodology for developing adaptive educational-game environments. Lecture Notes in Computer Science. 90-99.Full Text via DOI: 10.1007/3-540-47952-x_11
-
