Ponències/Comunicacions de congressos
Recent Submissions
-
Matching random colored points with rectangles
(Springer, 2020)
Conference report
Open AccessLet S[0,1]2 be a set of n points, randomly and uniformly selected. Let RB be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random ... -
Algorithmic geometry with infinite time computation
(2021)
Conference report
Restricted access - publisher's policy -
On maximum-sum matchings of points
(2021)
Conference report
Restricted access - publisher's policyHuemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ... -
Some results on the laplacian spectra of Token graphs
(Springer, 2021)
Conference report
Open AccessWe study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent ... -
The edge labeling of higher order Voronoi diagrams
(2021)
Conference report
Open AccessWe present an edge labeling of order-k Voronoi diagrams, Vk(S), of point sets S in the plane, and study properties of the regions defined by them. Among them, we show that Vk(S) has a small orientable cycle and path double ... -
Matching random colored points with rectangles
(Universitat de Girona, 2019)
Conference lecture
Open AccessLet S ¿ [0, 1]2 be a set of n points, randomly and uniformly selected. Let R ¿ B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the ... -
Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
(Springer, 2018)
Conference lecture
Restricted access - publisher's policyHow to draw the vertices of a complete multipartite graph G on different points of a bounded d-dimensional integer grid, such that the sum of squared distances between vertices of G is (i) minimized or (ii) maximized? For ... -
A new lower bound on the maximum number of plane graphs using production matrices
(2018)
Conference lecture
Restricted access - publisher's policyWe use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer ...
RSS 1.0