Now showing items 1-20 of 55

• #### Algorithmic geometry with infinite time computation ﻿

(2021)
Conference report
Restricted access - publisher's policy
• #### Antimagic labelings of caterpillars ﻿

(2019-04-15)
Article
Open Access
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to edges incident ...
• #### Àlgebra 1. Apunts ﻿

(Universitat Politècnica de Catalunya, 1997)
Lecture notes
Open Access
• #### Àlgebra 2. Apunts ﻿

(Universitat Politècnica de Catalunya, 1998)
Lecture notes
Open Access
• #### Àlgebra I. Problemes ﻿

(Universitat Politècnica de Catalunya, 1996)
Lecture notes
Open Access
• #### Àlgebra II. Problemes ﻿

(Universitat Politècnica de Catalunya, 1997)
Lecture notes
Open Access
• #### Balanced partitions of 3-colored geometric sets in the plane ﻿

(2015)
Article
Open Access
Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S is said to be balanced if S'S' contains the same amount of elements of SS from each of the colors. We study several ...
• #### Capturing points with a rotating polygon (and a 3D extension) ﻿

(2019-04)
Article
Open Access
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on ...
• #### Caterpillars are antimagic ﻿

(2021-01-21)
Article
Open Access
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 ...
• #### Center of maximum-sum matchings of bichromatic points ﻿

(Elsevier, 2024-03-01)
Article
Restricted access - publisher's policy
Let R and B be two point sets in the plane with . Let be a perfect matching that matches points of R with points of B and maximizes , the total Euclidean distance of the matched pairs. In this paper, we prove that there ...
• #### Characteristic polynomials of production matrices for geometric graphs ﻿

(2017-08-01)
Article
Open Access
An n×n production matrix for a class of geometric graphs has the property that the numbers of these geometric graphs on up to n vertices can be read off from the powers of the matrix. Recently, we obtained such production ...
• #### Characterizations of some complexity classes between [theta sub 2 super p] and [delta sub 2 super p] ﻿

(1990)
Research report
Open Access
We give some characterizations of the classes P super NP [0(log super k n)]. First, we show that these classes are equal to classes AC super k-1 (N P). Second, we prove that they are also equivalent to some classes defined ...
• #### Convex quadrangulations of bichromatic point sets ﻿

(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 ...
• #### Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations ﻿

(Springer Nature, 2021-03)
Article
Open Access
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 ...
• #### Extremal graph theory for metric dimension and diameter ﻿

(2010-02-22)
Article
Open Access
A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. Let ...
• #### Extremal graph theory for metric dimension and diameter ﻿

(2010)
Article
Open Access
• #### Fitting a two-joint orthogonal chain to a point set ﻿

(2011-04)
Article
Open Access
We study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n points in the plane, where the objective function is to minimize the maximum orthogonal distance from S to the chain. We show that this ...
• #### K-1,K-3-covering red and blue points in the plane ﻿

(Chapman & Hall/CRC, 2019-01-31)
Article
Open Access
We say that a finite set of red and blue points in the plane in general position can be K1,3-covered if the set can be partitioned into subsets of size 4, with 3 points of one color and 1 point of the other color, in such ...
• #### Matching points with diametral disks ﻿

(2017)
Conference report
Open Access
We consider matchings between a set R of red points and a set B of blue points with diametral disks. In other words, for each pair of matched points p ¿ R and q ¿ B, we consider the diametral disk defined by p and q. We ...
• #### Matching points with disks with a common intersection ﻿

(2019-07-01)
Article
Open Access
We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p ¿ R and q ¿ B, we consider the disk through p and q with the smallest diameter. We prove that ...