<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-17T14:24:36Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/18077" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/18077</identifier><datestamp>2026-01-16T06:05:21Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Universal point subsets for planar graphs</dc:title>
   <dc:creator>Angelini, Patrizio</dc:creator>
   <dc:creator>Binucci, Carla</dc:creator>
   <dc:creator>Evans, William</dc:creator>
   <dc:creator>Hurtado Díaz, Fernando Alfredo</dc:creator>
   <dc:creator>Liotta, Giuseppe</dc:creator>
   <dc:creator>Mchedlidze, Tamara</dc:creator>
   <dc:creator>Meijer, Henk</dc:creator>
   <dc:creator>Okamoto, Yoshio</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta</dc:subject>
   <dc:subject>Discrete geometry</dc:subject>
   <dc:subject>Geometria discreta</dc:subject>
   <dc:subject>Classificació AMS::52 Convex and discrete geometry::52C Discrete geometry</dc:subject>
   <dc:description>A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of S . In this paper we study the following main problem: For a given class of graphs, what is the maximum k such that there exists a universal point subset of size k ? We provide a ⌈ √ n ⌉ lower bound on k for the class of planar graphs with n ver- tices. In addition, we consider the value F ( n; G ) such that every set of F ( n; G ) points in general position is a universal subset for all graphs with n vertices be- longing to the family G , and we establish upper and lower bounds for F ( n; G ) for different families of planar graphs, including 4-connected planar graphs and nested-triangles graphs.</dc:description>
   <dc:description>Peer Reviewed</dc:description>
   <dc:description>Postprint (author’s final draft)</dc:description>
   <dc:date>2012</dc:date>
   <dc:type>Conference report</dc:type>
   <dc:identifier>Angelini, P. [et al.]. Universal point subsets for planar graphs. A: International Symposium on  Algorithms and Computation. "Lecture Notes in Computer Science". Taipei: Springer, 2012, p. 423-432.</dc:identifier>
   <dc:identifier>978-3-642-35261-4</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/18077</dc:identifier>
   <dc:identifier>10.1007/978-3-642-35261-4_45</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>http://link.springer.com/chapter/10.1007/978-3-642-35261-4_45</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Spain</dc:rights>
   <dc:format>10 p.</dc:format>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Springer</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>