Inês Matos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Inês Matos has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Leslie Bajuelos
Universidade de Aveiro
4 shared publications - Alfredo García
Universidad de Zaragoza
3 shared publications - Csaba D. Tóth
Department of Mathematics California State University Northridge Los Angeles CA
3 shared publications - Fiama Pierina Orejuela Hurtado
Departament de Matemàtica Aplicada II Universitat Politècnica de Catalunya Barcelona Spain
3 shared publications - Javier Tejel
Universidad de Zaragoza
3 shared publications - Maria Saumell
Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Czech Republic
3 shared publications
Latest Publications
- Open Access
Geometric Biplane Graphs I: Maximal Graphs
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the sense that no edge can be added while staying biplane---may differ in the number of edges, and we provide an efficient algorithm for adding edges to a biplane graph to make it maximal. We also study extremal properties of maximal biplane graphs such as the maximum number of edges and the largest maximum connectivity over $n$-element point sets.Open AccessGeometric Biplane Graphs I: Maximal Graphs
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the sense that no edge can be added while staying biplane---may differ in the number of edges, and we provide an efficient algorithm for adding edges to a biplane graph to make it maximal. We also study extremal properties of maximal biplane graphs such as the maximum number of edges and the largest maximum connectivity over $n$-element point sets. - Open Access
- 27 February 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (2) , 427-452
Geometric Biplane Graphs II: Graph Augmentation
- 27 February 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (2) , 427-452
Open AccessGeometric Biplane Graphs II: Graph Augmentation
- Open Access
- 26 February 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (2) , 407-425
Geometric Biplane Graphs I: Maximal Graphs
- 26 February 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (2) , 407-425
Open AccessGeometric Biplane Graphs I: Maximal Graphs
- 1 January 2014
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 58 (1) , 160-171
Some Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open-edge guards and open mobile-guards. A mobile guard can be placed on edges and diagonals of a polygon, and the ‘open’ prefix means that the endpoints of such an edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open-edge and open mobile-guards. A wide range of polygons is studied, which include orthogonal polygons with or without holes, spirals, orthogonal spirals and monotone polygons. Moreover, this problem is also considered for planar triangulation graphs using open-edge guards.
- 1 January 2014
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 58 (1) , 160-171
Some Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open-edge guards and open mobile-guards. A mobile guard can be placed on edges and diagonals of a polygon, and the ‘open’ prefix means that the endpoints of such an edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open-edge and open mobile-guards. A wide range of polygons is studied, which include orthogonal polygons with or without holes, spirals, orthogonal spirals and monotone polygons. Moreover, this problem is also considered for planar triangulation graphs using open-edge guards.
- Open Access
Some Results on Open Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the "open" prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open edge and open mobile guards. This problem is also considered for planar triangulation graphs using open edge guards.
Open AccessSome Results on Open Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the "open" prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open edge and open mobile guards. This problem is also considered for planar triangulation graphs using open edge guards.
- 16 August 2011
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 55 (1) , 69-81
Minimizing the Range for k-Covered Paths on Sensor Networks
Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field of wireless sensor networks. The main coverage issue centres around critical conditions that require reliable monitoring and prohibit failures. This issue can be addressed by maximal-exposure paths, regarding which this article presents new results. Namely, it shows how to minimize the sensing range of a set of sensors in order to ensure the existence of a k-covered path between two points on a given region. Such a path's coverage depends on k≥2, which is fixed. The three types of regions studied are: a planar graph, the whole plane and a polygonal region.
- 16 August 2011
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 55 (1) , 69-81
Minimizing the Range for k-Covered Paths on Sensor Networks
Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field of wireless sensor networks. The main coverage issue centres around critical conditions that require reliable monitoring and prohibit failures. This issue can be addressed by maximal-exposure paths, regarding which this article presents new results. Namely, it shows how to minimize the sensing range of a set of sensors in order to ensure the existence of a k-covered path between two points on a given region. Such a path's coverage depends on k≥2, which is fixed. The three types of regions studied are: a planar graph, the whole plane and a polygonal region.
- 1 July 2011
- Published by Elsevier in Operations Research Letters
- Vol. 39 (4) , 241-245
Coverage restricted to an angle
- 1 July 2011
- Published by Elsevier in Operations Research Letters
- Vol. 39 (4) , 241-245
Coverage restricted to an angle
- Open Access
- 14 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.
- 14 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
Open AccessOptimal 2-Coverage of a Polygonal Region in a Sensor Network
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.
- 4 September 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 161 (6) , 909-918
The embracing Voronoi diagram and closest embracing number
- 4 September 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 161 (6) , 909-918
The embracing Voronoi diagram and closest embracing number