- idUS
- Listar por autor
Listar por autor "Márquez Pérez, Alberto"
Mostrando ítems 21-40 de 154
-
Artículo
Computing optimal shortcuts for networks
Garijo Royo, Delia; Márquez Pérez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo I. (ELSEVIER SCIENCE BV; ELSEVIER, 2019)We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between ...
-
Ponencia
Computing the stretch of an embedded graph
Cabello Justo, Sergio; Chimani, Markus; Hliněný, Petr (2013)Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the ...
-
Artículo
Computing the Tutte polynomial of Archimedean tilings
Garijo Royo, Delia; Gegúndez, M.E.; Márquez Pérez, Alberto; Revuelta Marchena, María Pastora; Sagols, F. (2014)We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...
-
Ponencia
Conexiones ortogonales con vértices prefijados
Garrido Vizuete, María de los Angeles; Márquez Pérez, Alberto; Portillo Fernández, José Ramón; Reyes Colume, Pedro (Alberto Márquez, 2002) -
Artículo
Continuous mean distance of a weighted graph
Garijo Royo, Delia; Márquez Pérez, Alberto; Silveira, Rodrigo I. (Cornell University, 2021)We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean ...
-
Ponencia
Continuous surveillance of points by rotating floodlights
Bereg, Sergey; Díaz Báñez, José Miguel; Fort i Masdevall, Marta; Lopez, Mario A.; Pérez Lantero, Pablo; Urrutia Galicia, Jorge (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 ...
-
Artículo
Cover Contact Graphs
Atienza Martínez, María Nieves; Castro Ochoa, Natalia de; Cortés Parejo, María del Carmen; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Hernández, Gregorio; Márquez Pérez, Alberto; Moreno, Auxiliadora; Nöllenburg, Martin; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad; Wolff, Alexander (2007)We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) ...
-
Artículo
Cover contact graphs
Atienza Martínez, María Nieves; Castro Ochoa, Natalia de; Cortés Parejo, María del Carmen; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Hernández, Gregorio; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Nöllenburg, Martin; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad; Wolff, Alexander (2012)We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) ...
-
Capítulo de Libro
DANTE The Combination between an Ant Colony Optimization Algorithm and a Depth Search Method
Cardoso, Pedro; Márquez Pérez, Alberto; Jesus, Mário (2008)The isin-DANTE method is an hybrid meta-heuristic. In combines the evolutionary ant colony optimization (ACO) algorithms ...
-
Tesis Doctoral
Deconvolución de imágenes bajo multirresolución
Robles Arias, Rafael (2003) -
Artículo
Diagonal flips in outer-triangulations on closed surfaces
Cortés Parejo, María del Carmen; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Nakamoto, Atsuhiro (2002)We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal flips, up to isotopy, if they have a sufficiently large and equal number of vertices.
-
Tesis Doctoral
El diagrama polar
Ortega Alvarado, Lidia (2002) -
Ponencia
Diameter of a set on the cylinder
Cobos, F.J.; Dana Jiménez, Juan Carlos; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto (Queen's University, 1997) -
Ponencia
Differential evolution in shortest path problems
Guerreiro, Pedro; Jesus, Mário; Márquez Pérez, Alberto (Universidad de Almería, 2011)This paper proves that the Di erential Evolution (DE) algorithm is valid to solve the Shortest Path (SP) problem in random, median sized networks. From the trials, we have obtained an 9% accuracy, in the worst case scenario.
-
Artículo
Dilation-free graphs in the l1 metric
Cáceres González, José; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora (2007)The dilation-free graph of a planar point set S is a graph that spans S in such a way that the distance between two points ...
-
Ponencia
Distance domination, guarding and vertex cover for maximal outerplanar graphs
Canales Cano, Santiago; Hernández Peñalver, Gregorio; Oliveira Martins, Ana Mafalda de; Matos. Inês (2013)In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and ...
-
Ponencia
Drawing the double circle on a grid of minimum size
Bereg, Sergey; Fabila Monroy, Ruy; Flores Peñaloza, David; Lopez, Mario A.; Pérez Lantero, Pablo (2013)In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ...
-
Artículo
Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
Garrido Vizuete, María de los Angeles; Márquez Pérez, Alberto (1997)This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model ...
-
Ponencia
Empty convex polytopes in random point sets
Balogh, József; González Aguilar, Hernán; Salazar Anaya, Gelasio (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
Equipartitioning triangles
Ramos Alonso, Pedro Antonio; Steiger, William (2013)An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ...