Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Hurtado Díaz, Ferran"'
Autor:
Cortés Parejo, María del Carmen, Hurtado Díaz, Ferran, Márquez Pérez, Alberto, Valenzuela Muñoz, Jesús, Díaz Báñez, José Miguel (Coordinador), Garijo Royo, Delia (Coordinador), Márquez Pérez, Alberto (Coordinador), Urrutia Galicia, Jorge (Coordinador)
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted versions have been proposed. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6244e3ece3d8645c22bb30680083dae8
https://idus.us.es/xmlui/handle/11441/60277
https://idus.us.es/xmlui/handle/11441/60277
Autor:
Claverol Aguas, Mercè, Garijo Royo, Delia, Hurtado Díaz, Ferran, Lara Cuevas, María Dolores, Seara Ojea, Carlos, Díaz Báñez, José Miguel (Coordinador), Garijo Royo, Delia (Coordinador), Márquez Pérez, Alberto (Coordinador), Urrutia Galicia, Jorge (Coordinador)
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric Hamiltonian alternating path. In this work we prove that if we relax the constraint on the path from being plane to being 1-p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bc2d2b5fd256e5d29711441b3986e0c6
https://idus.us.es/xmlui/handle/11441/60281
https://idus.us.es/xmlui/handle/11441/60281
Autor:
Cano Vila, Javier, Hurtado Díaz, Ferran, Urrutia Galicia, Jorge, Díaz Báñez, José Miguel (Coordinador), Garijo Royo, Delia (Coordinador), Márquez Pérez, Alberto (Coordinador), Urrutia Galicia, Jorge (Coordinador)
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
Let S be a set of n points in Rd in general position. A set H of k-flats is called an mk-stabber of S if the relative interior of any m-simplex with vertices in S is intersected by at least one element of H. In this paper we give lower and upper boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9c4963df268bb484d24c763f5069d87f
https://idus.us.es/xmlui/handle/11441/60158
https://idus.us.es/xmlui/handle/11441/60158
Publikováno v:
idUS: Depósito de Investigación de la Universidad de Sevilla
Universidad de Sevilla (US)
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Universidad de Sevilla (US)
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 pairwise disjoint monochromatic triangles with vertices in S and empty of points of S. We further show that S can be partitioned into 3 n 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::11263d8d9736b8726c0cfacacb771c55
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
Three different concepts of depth in a point set are considered and compared: Convex depth, location depth and Delaunay depth. As a notion of weight is naturally associated to each depth definition, we also present results on minimum weight structure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b21d8a13128396041a4824140a765363
https://idus.us.es/handle/11441/55094
https://idus.us.es/handle/11441/55094
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
Dirección General de Educación Superior (Ministerio de Ciencia y Tecnología) Generalitat de Catalunya Comunidad Autónoma de Madrid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::67191792f3945daa0f35ae3c50baa7b3