Perfil del autor: Garijo Royo, Delia
Datos institucionales
Nombre | Garijo Royo, Delia |
Departamento | Matemática Aplicada I |
Área de conocimiento | Matemática Aplicada |
Categoría profesional | Profesora Titular de Universidad |
Correo electrónico | Solicitar |
Estadísticas
-
Nº publicaciones
80
-
Nº visitas
9049
-
Nº descargas
11370
Publicaciones |
---|
Artículo
Homomorphisms between graphs embedded in surfaces
(Elsevier, 2024)
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and ... |
Artículo
New results on the robust coloring problem
(Springer, 2024)
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; ... |
Capítulo de Libro
Polynomials and graph homomorphisms
(Chapman and Hall/CRC, 2022)
We develop in the language of graph homomorphisms the connection between the Tutte polynomial and the state models of ... |
Capítulo de Libro
Flows and colorings
(Chapman and Hall/CRC, 2022)
Tutte first introduced the dichromate of a graph in large part motivated by the fact that it contained the flow polynomial ... |
Artículo
Continuous mean distance of a weighted graph
(Cornell University, 2021)
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance ... |
Trabajo Fin de Máster
Polinomio cromático. Introducción a la coloración robusta
(2020)
This work is framed within the eld of Graph Theory, speci cally in the area of graph coloring. Our main objective has ... |
Artículo
Computing optimal shortcuts for networks
(ELSEVIER SCIENCE BV; ELSEVIER, 2019)
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between ... |
Artículo
On Hamiltonian alternating cycles and paths
(Elsevier, 2018)
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an ... |
Ponencia
Computing Optimal Shortcuts for Networks
(Dagsthul Publishing, 2018)
We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between ... |
Artículo
Shortcut sets for the locus of plane Euclidean networks
(Elsevier, 2018)
We study the problem of augmenting the locus N of a plane Euclidean network N by in- serting iteratively a finite set ... |
Artículo
Stabbing segments with rectilinear objects
(Elsevier, 2017)
Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one ... |
Artículo
Polynomial graph invariants from homomorphism numbers
(Elsevier, 2016)
We give a new method of generating strongly polynomial sequences of graphs, i.e., sequences (Hk) indexed by a tuple k = ... |
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of ... |
Ponencia
Shortcut sets for Euclidean graphs
(2015)
A Euclidean graph G is the locus of a rectilinear embedding of a planar graph in the Euclidean plane. A shortcut set S is ... |
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
(2014)
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ... |
Artículo
Resolving sets for breaking symmetries of graphs
(Cornell University, 2014)
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a ... |
Artículo
Computing the Tutte polynomial of Archimedean tilings
(2014)
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ... |
Artículo
On the number of B-flows of a graph
(Elsevier, 2014)
We exhibit explicit constructions of contractors for the graph parameter counting the number of B-flows of a graph, where ... |
Artículo
The difference between the metric dimension and the determining number of a graph
(2014)
We study the maximum value of the difference between the metric dimension and the determining number of a graph as a ... |
Ponencia
Breaking symmetries of graphs with resolving sets
(2014)
We undertake a study on the maximum value of the difference between the metric dimension and the determining number of a ... |
Ponencia
Stabbing simplices of point sets with k-flats
(2013)
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 ... |
Ponencia
Computing the stretch of an embedded graph
(2013)
Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the ... |
Ponencia
Metaheuristic approaches for the minimum dilation triangulation problem
(2013)
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ... |
Ponencia
SensoGraph: Using proximity graphs for sensory analysis
(2013)
Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ... |
Ponencia
Reporting flock patterns on the GPU
(2013)
In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers ... |
Ponencia
The alternating path problem revisited
(2013)
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 ... |
Ponencia
Witness bar visibility
(2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ... |
Ponencia
Parallel constrained Delaunay triangulation
(2013)
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight ... |
Ponencia
Monotone crossing number of complete graphs
(2013)
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n-1/2/2 n−2/2 ... |
Ponencia
Simulating distributed algorithms for lattice agents
(2013)
We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional ... |
Ponencia
On the enumeration of permutominoes
(2013)
Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ... |
Ponencia
Solving common influence region queries with the GPU
(2013)
In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under ... |
Ponencia
Simulated annealing applied to the MWPT problem
(2013)
The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing ... |
Ponencia
On the barrier-resilience of arrangements of ray-sensors
(2013)
Given an arrangement A of n sensors and two points s and t in the plane, the barrier resilience of A with respect to s and ... |
Artículo
On the metric dimension, the upper dimension and the resolving number of graphs
(2013)
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We ... |
Ponencia
Phase transitions in the Ramsey-Turán theory
(2013)
Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an L-free graph on n ... |
Ponencia
On making a graph crossing-critical
(2013)
A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that ... |
Artículo
The resolving number of a graph
(2013)
We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by ... |
Artículo |
Ponencia
Equipartitioning triangles
(2013)
An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ... |
Artículo
The determining number of Kneser graphs
(2013)
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on ... |
Ponencia
Continuous surveillance of points by rotating floodlights
(2013)
Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the ... |
Ponencia
An algorithm that constructs irreducible triangulations of once-punctured surfaces
(2013)
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ... |
Ponencia
Three location tapas calling for CG sauce
(2013)
Based on some recent modelling considerations in location theory we call for study of three CG constructs of Voronoi type that seem not to have been studied much before. |
Ponencia |
Ponencia
On 4-connected geometric graphs
(2013)
Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S. |
Ponencia
Abstract Voronoi diagrams
(2013)
Abstract Voronoi diagrams are a unifying framework that covers many types of concrete Voronoi diagrams. This talk reports on the state of the art, including recent progress. |
Ponencia
A symbolic-numeric dynamic geometry environment for the computation of equidistant curves
(2013)
A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ... |
Ponencia
On the nonexistence of k-reptile simplices in R3 and R4
(2013)
A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices ... |
Artículo
Resolving sets for Johnson and Kneser graphs
(2013)
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such ... |
Ponencia
Drawing the double circle on a grid of minimum size
(2013)
In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ... |
Ponencia
Note on the number of obtuse angles in point sets
(2013)
In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines ... |
Ponencia
Guarding the vertices of thin orthogonal polygons is NP-hard
(2013)
An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards ... |
Ponencia
Distance domination, guarding and vertex cover for maximal outerplanar graphs
(2013)
In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and ... |
Ponencia
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
(2013)
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or ... |
Ponencia
On three parameters of invisibility graphs
(2013)
The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ... |
Ponencia
Empty convex polytopes in random point sets
(2013)
Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices ... |
Ponencia
Some results on open edge guarding of polygons
(2013)
This paper focuses on a variation of the Art Gallery problem that considers open edge guards. The “open” prefix means the ... |
Ponencia
Improved enumeration of simple topological graphs
(2013)
A simple topological graph T = (V (T ), E(T )) is a drawing of a graph in the plane where every two edges have at most one ... |
Ponencia
Stackable tessellations
(2013)
We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ... |
Artículo
Reporting Bichromatic Segment Intersections from Point Sets
(2012)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets ... |
Artículo
Minimizing the error of linear separators on linearly inseparable data
(Elsevier, 2012)
Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are ... |
Artículo
Separability of Point Sets by k-Level Linear Classification Trees
(2012)
Let R and B be sets of red and blue points in the plane in general position. We study the problem of computing a k-level ... |
Artículo
Stabbers of line segments in the plane
(2011)
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner ... |
Artículo
Distinguishing graphs by their left and right homomorphism profiles
(Elsevier, 2011)
We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, ... |
Artículo
Contractors for flows
(Elsevier, 2011)
We answer a question raised by Lovász and B. Szegedy [Contractors and connectors in graph algebras, J. Graph Theory 60:1 ... |
Artículo
On the determining number and the metric dimension of graphs
(Combinatorics.org, 2010)
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining ... |
Ponencia
Measuring the error of linear separators on linearly inseparable data
(Prensas Universitarias de Zaragoza, 2009)
Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are ... |
Artículo
Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”
(Elsevier, 2009)
We establish for which weighted graphs H homomorphism functions from multigraphs G to H are specializations of the Tutte ... |
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(2009)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ... |
Artículo
Homomorphisms and polynomial invariants of graphs
(Elsevier, 2009)
This paper initiates a general study of the connection between graph homomorphisms and the Tutte polynomial. This connection ... |
Ponencia
Separación y clasificación de puntos rojos y azules
(Universidad de Valladolid, 2007)
En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos en el plano son separables ... |
Ponencia
Homomorphisms and Polynomial Invariants of Graphs
(2007)
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables ... |
Ponencia
K-Factores en nubes bicromáticas
(2007)
Consideramos una colección de puntos bicromática y nos preguntamos cuántos puntos adicionales son necesarios considerar ... |
Ponencia
Weighted graph homomorphisms and the Tutte polynomial
(Universidad de Cádiz, 2007)
This work studies the connection between weighted graph parameters re lated to homomorphisms and the Tutte polynomial. In ... |
Artículo
Hexagonal Tilings and Locally C6 Graphs
(Cornell University, 2005)
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural ... |
Artículo
Hexagonal Tilings: Tutte Uniqueness
(Cornell University, 2005)
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling. |
Tesis Doctoral
Polinomio de tutte de teselaciones regulares
(2004)
En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo ... |
Artículo
Tutte uniqueness of locally grid graphs
(Departamento de Matemáticas CINVESTAV, 2004)
A graph is said to be locally grid if the structure around each of its vertices is a 3 × 3 grid. As a follow up of the ... |
Ponencia
Tutte unicidad: grafos localmente grid y grados localmente C6
(Alberto Márquez, 2002)
|