Recent Submissions

  • Metric dimension of maximal outerplanar graphs 

    Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè (2021-02-02)
    Article
    Restricted access - publisher's policy
    In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2=ß(G)=¿2n5¿ and that the ...
  • Optimizing generalized kernels of polygons 

    Martínez Moraian, Alejandra; Orden Martin, David; Palios, Leonidas; Seara Ojea, Carlos; Zylinski, Pawel (Springer Nature, 2021-04-09)
    Article
    Restricted access - publisher's policy
    Let O be a set of k orientations in the plane, and let P be a simple polygon in the plane. Given two points p, q inside P, we say that p O-sees q if there is an O-staircase contained in P that connects p and q. The O-Kernel ...
  • A comparative analysis of trajectory similarity measures 

    Tao, Yaguang; Both, Alan; Silveira, Rodrigo Ignacio; Sijben, Stef; Buchin, Kevin; Purves, Ross S.; Laube, Patrick; Peng, Dongliang; Toohey, Kevin; Duckham, Matt (2021-06-23)
    Article
    Restricted access - publisher's policy
    Computing trajectory similarity is a fundamental operation in movement analytics, required in search, clustering, and classification of trajectories, for example. Yet the range of different but interrelated trajectory ...
  • Total domination in plane triangulations 

    Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2021-01-01)
    Article
    Open Access
    A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...
  • A scalable method to construct compact road networks from GPS trajectories 

    Guo, Yuejun; Bardera Reig, Anton; Fort Masdevall, Marta; Silveira, Rodrigo Ignacio (2020-10-06)
    Article
    Open Access
    The automatic generation of road networks from GPS tracks is a challenging problem that has been receiving considerable attention in the last years. Although dozens of methods have been proposed, current techniques suffer ...
  • Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations 

    Alegría Galicia, Carlos; Orden Martin, David; Seara Ojea, Carlos; Urrutia Galicia, Jorge (Springer Nature, 2021-03)
    Article
    Restricted access - publisher's policy
    Let P be a set of n points in the plane. We compute the value of ¿¿[0,2p) for which the rectilinear convex hull of P, denoted by RHP(¿), has minimum (or maximum) area in optimal O(nlogn) time and O(n) space, improving the ...
  • Caterpillars are antimagic 

    Lozano Bojados, Antoni; Mora Giné, Mercè; Seara Ojea, Carlos; Tey Carrera, Joaquín (2021-01-21)
    Article
    Restricted access - publisher's policy
    An antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to the ...
  • Map construction algorithms: a local evaluation through hiking data 

    Duran, David; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (2020-02-26)
    Article
    Open Access
    We study five existing map construction algorithms, designed and tested with urban vehicle data in mind, and apply them to hiking trajectories with different terrain characteristics. Our main goal is to better understand ...
  • Hamiltonicity for convex shape Delaunay and Gabriel graphs 

    Bose, Prosenjit; Cano Vila, María del Pilar; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (2020-08)
    Article
    Open Access
    We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape \(\mathcal {C}\) . Let S be a point ...
  • Convex quadrangulations of bichromatic point sets 

    Pilz, Alexander; Seara Ojea, Carlos (2020-06-05)
    Article
    Open Access
    We consider quadrangulations of red and blue points in the plane where each face is convex and no edge connects two points of the same color. In particular, we show that the following problem is NP-hard: Given a finite set ...
  • The uncoupling limit of identical Hopf bifurcations with an application to perceptual bistability 

    Pérez Cervera, Alberto; Ashwin, Peter; Huguet Casades, Gemma; Rankin, James; Martínez-Seara Alonso, M. Teresa (2019-12-01)
    Article
    Open Access
    We study the dynamics arising when two identical oscillators are coupled near a Hopfbifurcation where we assume a parameter uncouples the system at = 0. Using anormal form forN= 2 identical systems undergoing Hopf bifurcation, ...
  • Computing optimal shortcuts for networks 

    Garijo Royo, Delia; Marquez Pérez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo Ignacio (Elsevier, 2019-11-16)
    Article
    Open Access
    We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received ...

View more