Data

NameMárquez Pérez, Alberto
DepartmentMatemática Aplicada I
Knowledge areaMatemática Aplicada
Professional categoryCatedrático de Universidad
E-mailRequest
           

  Statistics

  • Items

    148

  • Visits

    12084

  • Downloads

    13247

  Publications

 

Article
Icon

Continuous mean distance of a weighted graph

Garijo Royo, Delia; Márquez Pérez, Alberto; Silveira, Rodrigo I. (Cornell University, 2021-01-01)
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance ...
Article
Icon

A quantitative principle to understand 3D cellular connectivity in epithelial tubes

Gómez Gálvez, Pedro; Vicente Munuera, Pablo; Anbari, Samira; Tagua Jáñez, Antonio; Gordillo Vázquez, Carmen María; Palacios, Ana M.; Velasco, Antonio; Capitán Agudo, Carlos; Grima Ruiz, Clara Isabel; Robles Arias, Rafael; Márquez Pérez, Alberto; Buceta, Javier; Escudero Cuadrado, Luis María (BioRxiv, 2020-01-01)
Apico-basal cell intercalations (scutoids) optimize packing and energy expenditure in curved epithelia. Further consequences ...
Article
Icon

Hamiltonian triangular refinements and space-filling curves

Márquez Pérez, Alberto; Plaza, Ángel; Suárez, José P. (Elsevier, 2019-01-01)
We have introduced here the concept of Hamiltonian triangular refinement. For any Hamiltonian triangulation it is shown ...
Article
Icon

Author Correction: Scutoids are a geometrical solution to three-dimensional packing of epithelia

Gómez Gálvez, Pedro; Vicente Munuera, Pablo; Tagua Jáñez, Antonio Jesús; Forja, Cristina; Castro Rodríguez, Ana María; Grima Ruiz, Clara Isabel; Bermúdez Gallardo, Marina; Márquez Pérez, Alberto; Escudero Cuadrado, Luis María (Nature Research, 2018-01-01)
Article
Icon

Scutoids are a geometrical solution to three-dimensional packing of epithelia

; Gómez Gálvez, Pedro; Vicente Munuera, Pablo; Tagua Jáñez, Antonio; Forja Barbosa, Cristina; Castro Rodríguez, Ana María; Letrán, Marta; Grima Ruiz, Clara Isabel; Bermúdez Gallardo, Marina; Serrano Pérez-Higueras, Óscar; Márquez Pérez, Alberto; Escudero Cuadrado, Luis María (Nature Publishing Group, 2018-01-01)
As animals develop, tissue bending contributes to shape the organs into complex three-dimensional structures. However, the ...
Article
Icon

Shortcut sets for the locus of plane Euclidean networks

Cáceres, José; Garijo Royo, Delia; González, Antonio; Márquez Pérez, Alberto; Puertas, María Luz; Ribeiro, Paula (Elsevier, 2018-01-01)
We study the problem of augmenting the locus N of a plane Euclidean network N by in- serting iteratively a finite set ...
Presentation
Icon

Computing Optimal Shortcuts for Networks

Garijo Royo, Delia; Márquez Pérez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo I. (Dagsthul Publishing, 2018-01-01)
We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between ...
PhD Thesis
Icon

Modelo de computación evolutivo para redes sostenibles, eficientes y resistentes.

Márquez Pérez, Alberto; Machado Jesús, Mario Carlos; Mendes Guerreiro, Pedro Miguel (2017-09-29)
We present a new approach to adapt the differential evolution (DE) algorithm so that it can be applied in combinatorial ...
Article
Icon

Classical properties of algebras using a new graph association

Aquino, R. M.; Camacho Santana, Luisa María; Cañete Molero, Elisa María; Márquez Pérez, Alberto (Cornell University, 2017-01-01)
We study the relation between algebraic structures and Graph Theory. We have de ned ve di erent weighted digraphs associated ...
Article
Icon

Shortcut sets for plane Euclidean networks (Extended abstract)

Cáceres, José; Garijo Royo, Delia; González, A.; Márquez Pérez, Alberto; Puertas, María Luz; Ribeiro, Paula (Elsevier, 2016-01-01)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of ...
Presentation
Icon

Técnicas cuánticas para la evolución de grafos aleatorios

Fernández Borja, Enrique; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Zambrano, Reyes (Instituto de Matemáticas de la UNAM, 2015-01-01)
Con la idea de modelar el comportamiento de diversas redes sociales a lo largo del tiempo, mostramos algunos resultados ...
Article
Icon

There are simple and robust refinements (almost) as good as Delaunay

Márquez Pérez, Alberto; Moreno González, Auxiliadora; Plaza, Ángel; Suárez, José P. (2014-01-01)
A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The ...
Article
Icon

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-01-01)
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...
Article
Icon

The difference between the metric dimension and the determining number of a graph

Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2014-01-01)
We study the maximum value of the difference between the metric dimension and the determining number of a graph as a ...
Article
Icon

Monochromatic geometric k-factors for bicolored point sets with auxiliary points

Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2014-01-01)
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ...
Article
Icon

Resolving sets for breaking symmetries of graphs

Garijo Royo, Delia; González, Antonio; Márquez Pérez, Alberto (Cornell University, 2014-01-01)
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a ...
Presentation
Icon

Monotone crossing number of complete graphs

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Balko, Martin; Fulek, Radoslav; Kynčl, Jan (2013-01-01)
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 ...
Presentation
Icon

Phase transitions in the Ramsey-Turán theory

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Balogh, József (2013-01-01)
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 ...
Presentation
Icon

On 4-connected geometric graphs

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; García Olaverri, Alfredo; Huemer, Clemens; Tejel Altarriba, Francisco Javier; Valtr, Pavel (2013-01-01)
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.
Presentation
Icon

Flips in combinatorial pointed pseudo-triangulations with face degree at most four

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Aichholzer, Oswin; Hackl, Thomas; Orden Martín, David; Pilz, Alexander; Saumell Mendiola, María; Vogtenhuber, Birgit (2013-01-01)
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or ...
Presentation
Icon

Recent developments on the crossing number of the complete graph

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Ramos Alonso, Pedro Antonio (2013-01-01)
Article
Icon

The resolving number of a graph

Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2013-01-01)
We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by ...
Article
Icon

The determining number of Kneser graphs

Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto; Puertas González, María Luz (2013-01-01)
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 ...
Presentation
Icon

Reporting flock patterns on the GPU

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Fort i Masdevall, Marta; Sellarès Chiva, Joan Antoni; Valladares Cereceda, Ignacio (2013-01-01)
In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers ...
Presentation
Icon

Solving common influence region queries with the GPU

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Fort i Masdevall, Marta; Sellarès Chiva, Joan Antoni (2013-01-01)
In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under ...
Presentation
Icon

Guarding the vertices of thin orthogonal polygons is NP-hard

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Nunes Gomes Tomás, Ana Paula (2013-01-01)
An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards ...
Presentation
Icon

Three location tapas calling for CG sauce

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Plastria, Frank (2013-01-01)
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.
Presentation
Icon

On the barrier-resilience of arrangements of ray-sensors

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Kirkpatrick, David; Yang, Boting; Zilles, Sandra (2013-01-01)
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 ...
Presentation
Icon

On the enumeration of permutominoes

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Nunes Gomes Tomás, Ana Paula (2013-01-01)
Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...
Presentation
Icon

Distance domination, guarding and vertex cover for maximal outerplanar graphs

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Canales Cano, Santiago; Hernández Peñalver, Gregorio; Oliveira Martins, Ana Mafalda de; Matos. Inês (2013-01-01)
In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and ...
Presentation
Icon

Computing the stretch of an embedded graph

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Cabello Justo, Sergio; Chimani, Markus; Hliněný, Petr (2013-01-01)
Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the ...
Presentation
Icon

Abstract Voronoi diagrams

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Klein, Rolf (2013-01-01)
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.
Presentation
Icon

An algorithm that constructs irreducible triangulations of once-punctured surfaces

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Chávez de Diego, María José; Lawrecenko, Serge; Portillo Fernández, José Ramón; Villar Liñán, María Trinidad (2013-01-01)
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...
Presentation
Icon

Metaheuristic approaches for the minimum dilation triangulation problem

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Dorzán, María Gisela; Leguizamón, Mario Guillermo; Mezura Montes, Efrén; Hernández Peñalver, Gregorio (2013-01-01)
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ...
Presentation
Icon

Parallel constrained Delaunay triangulation

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Coll Arnau, Narcís; Guerrieri Basualdo, María Ethel (2013-01-01)
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight ...
Presentation
Icon

Equipartitioning triangles

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Ramos Alonso, Pedro Antonio; Steiger, William (2013-01-01)
An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ...
Presentation
Icon

On the nonexistence of k-reptile simplices in R3 and R4

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Kynčl, Jan; Safernova, Zuzana (2013-01-01)
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 ...
Presentation
Icon

SensoGraph: Using proximity graphs for sensory analysis

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Miguel, David N. de; Orden Martín, David; Fernández Fernández, Encarnación; Rodríguez Nogales, José Manuel; Vila Crespo, Josefina (2013-01-01)
Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ...
Presentation
Icon

Drawing the double circle on a grid of minimum size

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Bereg, Sergey; Fabila Monroy, Ruy; Flores Peñaloza, David; Lopez, Mario A.; Pérez Lantero, Pablo (2013-01-01)
In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ...
Presentation
Icon

A symbolic-numeric dynamic geometry environment for the computation of equidistant curves

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Abánades Astudillo, Miguel Ángel; Botana Ferreiro, Francisco (2013-01-01)
A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ...
Presentation
Icon

Simulating distributed algorithms for lattice agents

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Aichholzer, Oswin; Hackl, Thomas; Sacristán Adinolfi, Vera; Vogtenhuber, Birgit; Wallner, Reinhardt (2013-01-01)
We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional ...
Presentation
Icon

Note on the number of obtuse angles in point sets

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Fabila Monroy, Ruy; Huemer, Clemens; Tramuns Figueras, Eulàlia (2013-01-01)
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 ...
Presentation
Icon

Empty convex polytopes in random point sets

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Balogh, József; González Aguilar, Hernán; Salazar Anaya, Gelasio (2013-01-01)
Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices ...
Presentation
Icon

Simulated annealing applied to the MWPT problem

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Gagliardi, Edilma Olinda; Leguizamón, Mario Guillermo; Hernández Peñalver, Gregorio (2013-01-01)
The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing ...
Presentation
Icon

Stabbing simplices of point sets with k-flats

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Cano Vila, Javier; Hurtado Díaz, Ferran; Urrutia Galicia, Jorge (2013-01-01)
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 ...
Presentation
Icon

Stackable tessellations

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Enrique Monzo, Lluís; Jaume Deyà, Rafel (2013-01-01)
We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ...
Presentation
Icon

Improved enumeration of simple topological graphs

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Kynčl, Jan (2013-01-01)
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 ...
Presentation
Icon

Continuous surveillance of points by rotating floodlights

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Bereg, Sergey; Díaz Báñez, José Miguel; Fort i Masdevall, Marta; Lopez, Mario A.; Pérez Lantero, Pablo; Urrutia Galicia, Jorge (2013-01-01)
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 ...
Article
Icon

The determining number of Kneser graphs

Puertas González, María Luz; Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2013-01-01)
Presentation
Icon

On three parameters of invisibility graphs

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Cibulka, Josef; Korbelář, Miroslav; Kynčl, Jan; Mészáros, Viola; Stolař, Rudolf; Valtr, Pavel (2013-01-01)
The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ...
Presentation
Icon

On making a graph crossing-critical

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Hernández Vélez, César Israel; Leaños Macías, Jesús (2013-01-01)
A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that ...
Presentation
Icon

Witness bar visibility

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Cortés Parejo, María del Carmen; Hurtado Díaz, Ferran; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (2013-01-01)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...
Presentation
Icon

The alternating path problem revisited

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Claverol Aguas, Mercè; Garijo Royo, Delia; Hurtado Díaz, Ferran; Lara Cuevas, María Dolores; Seara Ojea, Carlos (2013-01-01)
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 ...
Article
Icon

Resolving sets for Johnson and Kneser graphs

Bailey, Robert F.; Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto; Meagher, Karen; Puertas González, María Luz (2013-01-01)
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 ...
Article
Icon

On the metric dimension, the upper dimension and the resolving number of graphs

Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2013-01-01)
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We ...
Presentation
Icon

Some results on open edge guarding of polygons

Díaz Báñez, José Miguel; Garijo Royo, Delia; Márquez Pérez, Alberto; Urrutia Galicia, Jorge; Bajuelos Domínguez, António Leslie; Canales Cano, Santiago; Hernández Peñalver, Gregorio; Oliveira Martins, Ana Mafalda de; Matos. Inês (2013-01-01)
This paper focuses on a variation of the Art Gallery problem that considers open edge guards. The “open” prefix means the ...
Presentation
Icon

Witness-Bar Visibility Graphs

Cortés Parejo, María del Carmen; Hurtado, Ferrán; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (Instituto de Matemáticas de la UNAM, 2013-01-01)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...
Article
Icon

Reporting Bichromatic Segment Intersections from Point Sets

Cortés Parejo, María del Carmen; Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad (2012-01-01)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets ...
Article
Icon

Separability of Point Sets by k-Level Linear Classification Trees

Arkin, Esther M.; Garijo Royo, Delia; Márquez Pérez, Alberto; Mitchell, Joseph S. B.; Seara Ojea, Carlos (2012-01-01)
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 ...
Article
Icon

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-01-01)
We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by ...
Article
Icon

Towards a new framework for domination

Cáceres González, José; Márquez Pérez, Alberto; Morales, María; Puertas González, María Luz (2011-01-01)
Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding ...
Article
Icon

Stabbers of line segments in the plane

Claverol, Mercé; Garijo Royo, Delia; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Seara Ojea, Carlos (2011-01-01)
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner ...
Chapter of Book
Icon

Compact Grid Representation of Graphs

Cáceres González, José; Grima Ruiz, Clara Isabel; Cortés Parejo, María del Carmen; Hachimori, Masahiro; Márquez Pérez, Alberto; Mukae, Raiji; Nakamoto, Atsuhiro; Negami, Seiya; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2011-01-01)
A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges ...
Article
Icon

A sufficient degree condition for a graph to contain all trees of size k

Balbuena, Camino; Márquez Pérez, Alberto; Portillo Fernández, José Ramón (Springer, 2011-01-01)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of ...
Presentation
Icon

Differential evolution in shortest path problems

Guerreiro, Pedro; Jesus, Mário; Márquez Pérez, Alberto (Universidad de Almería, 2011-01-01)
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.
Chapter of Book
Icon

ϵ- DANTE : an ant colony oriented depth search procedure

Cardoso, Pedro; Jesus, Mário; Márquez Pérez, Alberto (2011-01-01)
The ϵ-Depth ANT Explorer (ϵ- DANTE ) algorithm applied to a multiple objective optimization problem is presented in this ...
Article
Icon

Transforming Triangulations on Nonplanar Surfaces

Cortés Parejo, María del Carmen; Grima Ruiz, Clara Isabel; Hurtado, Ferrán; Márquez Pérez, Alberto; Santos, F.; Valenzuela Muñoz, Jesús (2010-01-01)
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be ...
Article
Icon

Local refinement based on the 7-triangle longest-edge partition

Plaza, Ángel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Suárez, José P. (2009-01-01)
The triangle longest-edge bisection constitutes an efficient scheme for refining a mesh by reducing the obtuse triangles, ...
Article
Icon

Monochromatic geometric k-factors in red-blue sets with white and Steiner points

Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2009-01-01)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ...
Article
Icon

Steiner distance and convexity in graphs

Cáceres González, José; Márquez Pérez, Alberto; Puertas González, María Luz (2008-01-01)
We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known ...
Article
Icon

Geometric Realization of Möbius Triangulations

Chávez de Diego, María José; Fijavz, Gasper; Márquez Pérez, Alberto; Nakamoto, Atsuhiro; Suárez, Esperanza (2008-01-01)
A Möbius triangulation is a triangulation on the Möbius band. A geometric realization of a map M on a surface $\Sigma$ is ...
Article
Icon

Compatible Geometric Matchings

Aichholzer, Oswin; Bereg, Sergey; Dumitrescu, Adrian; García Olaverri, Alfredo; Huemer, Clemens; Hurtado, Ferrán; Kano, Mikio; Márquez Pérez, Alberto; Rappaport, David; Smorodinsky, Shakhar; Souvaine, Diane L.; Urrutia, Jorge; Wood, David R. (2008-01-01)
Chapter of Book
Icon

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-01-01)
The isin-DANTE method is an hybrid meta-heuristic. In combines the evolutionary ant colony optimization (ACO) algorithms ...
Article
Icon

The seven-triangle longest-side partition of triangles and mesh quality improvement

Márquez Pérez, Alberto; Moreno González, Auxiliadora; Plaza, Ángel; Suárez, José P. (Elsevier, 2008-01-01)
A new triangle partition, the seven-triangle longest-edge partition, based on the trisection of the edges is presented and ...
PhD Thesis
Icon

Algoritmos de colonias de hormigas para optimización combinatoria con múltiples objetivos: aplicaciones a los problemas de minimum spanning trees

Márquez Pérez, Alberto; Machado Jesús, Mario Carlos; Sequeira Cardoso, Pedro Jorge (2007-03-02)
El estudio de soluciones meta-heurísticas basadas en el paradigma del Ant Colony Optimization (ACO) para el Multiple ...
Article
Icon

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-01-01)
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 ...
Article
Icon

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-01-01)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) ...
Presentation
Icon

Separación y clasificación de puntos rojos y azules

Garijo Royo, Delia; Márquez Pérez, Alberto; Mitchell, Joseph S. B.; Seara, Carlos (Universidad de Valladolid, 2007-01-01)
En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos en el plano son separables ...
Article
Icon

A new 2D tessellation for angle problems: The polar diagram

Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Ortega Alvarado, Lidia (2006-01-01)
The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but ...
Presentation
Icon

Quadrangulations and 2-Colorations

Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Nakamoto, Atsuhiro; Valenzuela Muñoz, Jesús (2005-01-01)
Any metric quadrangulation (made by segments of straight line) of a point set in the plane determines a 2-coloration of ...
Article
Icon

Rebuilding convex sets in graphs

Cáceres González, José; Márquez Pérez, Alberto; Oellermann, Ortrud R.; Puertas González, María Luz (2005-01-01)
The usual distance between pairs of vertices in a graph naturally gives rise to the notion of an interval between a pair ...
Article
Icon

Hexagonal Tilings and Locally C6 Graphs

Garijo Royo, Delia; Gitler, I.; Márquez Pérez, Alberto; Revuelta Marchena, María Pastora (Cornell University, 2005-01-01)
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural ...
Article
Icon

Hexagonal Tilings: Tutte Uniqueness

Garijo Royo, Delia; Márquez Pérez, Alberto; Revuelta Marchena, María Pastora (Cornell University, 2005-01-01)
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.
Presentation
Icon

Multiple criteria minimum spanning trees

Cardoso, Pedro; Jesus, Mário; Márquez Pérez, Alberto (Universidad de Cantabria, 2005-01-01)
The NP multiple criteria minimum spanning tree as several applications into the network design problems. In this paper, ...
PhD Thesis
Icon

Polinomio de tutte de teselaciones regulares

Márquez Pérez, Alberto; Revuelta Marchena, María Pastora; Garijo Royo, Delia (2004-10-14)
En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo ...
Article
Icon

Euclidean position in Euclidean 2-orbifolds

Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (2004-01-01)
Intuitively, a set of sites on a surface is in Euclidean position if points are so close to each other that planar algorithms ...
Article
Icon

Extremal Graphs without Topological Complete Subgraphs

Cera López, Martín; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (2004-01-01)
The exact values of the function $ex(n;TK_{p})$ are known for ${\lceil \frac{2n+5}{3}\rceil}\leq p < n$ (see [Cera, Diánez, ...
Article
Icon

Locally grid graphs: classification and Tutte uniqueness

Márquez Pérez, Alberto; Mier, Anna de; Noy, Marc; Revuelta Marchena, María Pastora (2003-01-01)
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞, the canonical examples ...
PhD Thesis
Icon

Geometría computacional en superficies de órbitas

Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (2003-01-01)
En los casi treinta años de historia de la Geometría Computacional, sólo recientemente se han comenzado a estudiar problemas ...
PhD Thesis
Icon

Deconvolución de imágenes bajo multirresolución

Fernández Pérez-Rendón, Antonio; Márquez Pérez, Alberto; Robles Arias, Rafael (2003-01-01)
Article
Icon

Transforming triangulations on non planar-surfaces

Cortés Parejo, María del Carmen; Grima Ruiz, Clara Isabel; Hurtado, Ferrán; Márquez Pérez, Alberto; Santos, F.; Valenzuela Muñoz, Jesús (2003-01-01)
We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be ...
Presentation
Icon

More results about spanners in the l1-metric

Cáceres, J.; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, A. (Universidad de Sevilla, 2003-01-01)
In this work we study more questions about spanners in the l1-metric. Concretely, we will see that adding some Steiner ...
Presentation
Icon

Motion Planning and Visibility Problems using the Polar Diagram

Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Ortega, L. (European Association for Computer Graphics, 2003-01-01)
Motion planning and visibility problems are some of the most important topics studied in Computer Graphics, Computational ...
Presentation
Icon

MONACO - Multi-Objective Network Optimisation Based on an ACO

Cardoso, Pedro; Jesus, Mário; Márquez Pérez, Alberto (Universidad de Sevilla, 2003-01-01)
The Ant Colony Optimisation Algorithm (ACO) supports the development of a system for a multi-objective network ...
Presentation
Icon

Multiple Objective TSP based on ACO

Cardoso, Pedro; Jesus, Mário; Márquez Pérez, Alberto (Universidad de Almería, 2003-01-01)
In this paper we present an Ant Colony Optimisation based algorithm to determine the Pareto set for the Multiple Objective Travelling Salesman Problem. Our results are then compared with the ones obtained with a genetic algorithm.
Article
Icon

Resultados recientes sobre mosaicos de Penrose

Cáceres, J.; Gégundez, M. E.; Mestre, M.; Márquez Pérez, Alberto; Moreno González, Auxiliadora (Real Sociedad Matemática Española, 2003-01-01)
PhD Thesis
Icon

Problemas de conexiones ortogonales

Márquez Pérez, Alberto; Garrido Vizuete, María de los Angeles; Portillo Fernández, José Ramón (2002-01-01)
El área de investigación sobre dibujos de grafos constituye una importante conexión entre diversos campos de la Matemática, ...
Article
Icon

An aperiodic tiles machine

Cáceres González, José; Márquez Pérez, Alberto (2002-01-01)
The results we introduce in this work lead to get an algorithm which produces aperiodic sets of tiles using Voronoi diagrams. ...
Article
Icon

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-01-01)
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.
Article
Icon

Single bend wiring on surfaces

Garrido Vizuete, María de los Angeles; Márquez Pérez, Alberto; Morgana, A.; Portillo Fernández, José Ramón (2002-01-01)
The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible ...
Article
Icon

Triangle-Free Planar Graphs as Segment Intersection Graphs

Castro Ochoa, Natalia de; Cobos Gavala, Javier; Dana Jiménez, Juan Carlos; Márquez Pérez, Alberto; Noy, Marc (2002-01-01)
We prove that every triangle-free planar graph is the intersection graph of a set of segments in the plane. Moreover, the ...
PhD Thesis
Icon

Problemas de etiquetado complejidad computacional

Márquez Pérez, Alberto; Garrido Vizuete, María de los Angeles; Reyes Colume, Pedro (2002-01-01)
El etiquetado es una de las grandes áreas de investigación dentro de la Geometría Computacional. Así lo avalan, tanto la ...
Article
Icon

On the connectivity of skeletons of pseudomanifolds with boundary

Ayala Gómez, Rafael; Chávez de Diego, María José; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (Mathematical Institute, Academy of Sciences of the Czech Republic, 2002-01-01)
In this note we show that 1-skeletons and 2-skeletons of n-pseudomanifolds with full boundary are (n+ 1)-connected graphs and n-connected 2-complexes, respectively. This generalizes previous results due to Barnette and Woon.
PhD Thesis
Icon

El diagrama polar

Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Ortega Alvarado, Lidia (2002-01-01)
Presentation
Icon

Reconstrucción de conjuntos convexos en grafos

Cáceres González, José; Márquez Pérez, Alberto; Puertas González, María Luz (Alberto Márquez, 2002-01-01)
Presentation
Icon

Análisis multirresolución de métodos iterativos para la deconvolución de imágenes bidimensionales

Márquez Pérez, Alberto; Fernández Pérez-Rendón, Antonio; Robles Arias, Rafael (Alberto Márquez, 2002-01-01)
Presentation
Icon

Puntos en posición general para una λ-distancia

Cáceres González, José; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora (Alberto Márquez, 2002-01-01)
Presentation
Icon

Optimization system in networks using ACO

Sequeira Cardoso, Pedro Jorge; Machado Jesús, Mario Carlos; Márquez Pérez, Alberto (Alberto Márquez, 2002-01-01)
Presentation
Icon

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-01-01)
Presentation
Icon

NP-completitud fuerte y débil en problemas de etiquetado

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-01-01)
Presentation
Icon

Algunas notas sobre mosaicos de Penrose

Cáceres González, José; Gegúndez Arias, Manuel Emilio; Maestre Hachero, Manuel; Márquez Pérez, Alberto (Alberto Márquez, 2002-01-01)
Presentation
Icon

Posición euclídea en superficies de órbitas euclídeas

Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (Alberto Márquez, 2002-01-01)
Presentation
Icon

Grafos localmente grid: clasificación y Tutte unicidad

Márquez Pérez, Alberto; Mier Vinue, Anna de; Noy Serrano, Marc; Revuelta Marchena, María Pastora (Alberto Márquez, 2002-01-01)
Presentation
Icon

Tutte unicidad: grafos localmente grid y grados localmente C6

Garijo Royo, Delia; Márquez Pérez, Alberto; Mier Vinue, Anna de; Noy Serrano, Marc; Revuelta Marchena, María Pastora (Alberto Márquez, 2002-01-01)
Article
Icon

Infinite graph embeddings on tubular surfaces

Boza Prieto, Luis; Fedriani Martel, Eugenio Manuel; Márquez Pérez, Alberto; Núñez Valdés, Juan; Revuelta Marchena, María Pastora (2001-01-01)
Article
Icon

Miscellaneous properties of embeddings of line, total and middle graphs

Boza Prieto, Luis; Dávila de Tena, María Teresa; Márquez Pérez, Alberto; Moyano Franco, Rafael (2001-01-01)
Chartrand et al. (J. Combin. Theory Ser. B 10 (1971) 12–41) proved that the line graph of a graph G is outerplanar if and ...
Chapter of Book
Icon

Labeling Subway Lines

Garrido Vizuete, María de los Angeles; Iturriaga, Claudia; Márquez Pérez, Alberto; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Wolff, Alexander (2001-01-01)
Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to ...
Article
Icon

Una máquina generadora de losetas aperiódicas

Cáceres González, José; Márquez Pérez, Alberto; Moreno González, Auxiliadora (Sociedad Matemática Española, 2000-01-01)
Article
Icon

The Size of a Graph Without Topological Complete Subgraphs

Cera López, Martín; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (2000-01-01)
In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n ...
Presentation
Icon

Spanners in l1

Cáceres, J.; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, A. (University of Fredericton, 2000-01-01)
PhD Thesis
Icon

Inmersiones de grafos en superficies tubulares de género finito

Boza Prieto, Luis; Márquez Pérez, Alberto; Revuelta Marchena, María Pastora (1999-02-12)
El matemático alemán Euler (1707-1782) resolvió en 1736 el famoso problema de los puentes de Königsberg. Dicha ciudad ...
PhD Thesis
Icon

Triangulaciones de superficies

Márquez Pérez, Alberto; Cortés Parejo, María del Carmen (1999-01-01)
El área de investigación sobre dibujos de grafos, la Teoría Topológica de Grafos, constituye una importante conexión entre ...
Article
Icon

Triangle-Free Planar Graphs as Segments Intersection Graphs

Castro Ochoa, Natalia de; Cobos Gavala, Javier; Dana Jiménez, Juan Carlos; Márquez Pérez, Alberto; Noy, Marc (1999-01-01)
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, ...
Article
Icon

Geometric tree graphs of points in convex position

Hernando, María del Carmen; Hurtado, Ferrán; Márquez Pérez, Alberto; Mora, Mercé; Noy, Marc (1999-01-01)
Given a set P of points in the plane, the geometric tree graph of P is defined as the graph T(P) whose vertices are ...
Article
Icon

On the connectivity of infinite graphs and 2-complexes

Ayala Gómez, Rafael; Chávez de Diego, María José; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (Elsevier, 1999-01-01)
This paper contains a study of the connectivity of infinite graphs and 2-complexes. Various connectivity types are defined ...
PhD Thesis
Icon

Geometría computaciones en superficies no planas

Márquez Pérez, Alberto; Grima Ruiz, Clara Isabel (1998-09-28)
De forma general, la Geometría Computaciones trata del estudio de algoritmos que resuelven problemas geométricos con el ...
PhD Thesis
Icon

El tamaño de un grafo sin subgrafos homeomorfos a un grafo completo

Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto; Cera López, Martín (1998-01-01)
"Desde el origen de la Teoría de Grafos Extremales, uno de los problemas más generales que pueden plantearse en este campo, ...
Article
Icon

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-01-01)
This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model ...
PhD Thesis
Icon

Inmersiones ortogonales de grafos en superficies no planas

Márquez Pérez, Alberto; Garrido Vizuete, María de los Angeles (1997-01-01)
El área de investigación sobre dibujos de grafos (graph drawing) se ha convertido en un campo extensamente estudiado, ...
Presentation
Icon

Anchura de un convexo en la esfera.

Grima Ruiz, Clara Isabel; Dana Jiménez, Juan Carlos; Cobos Aguirre, Francisco Javier; Márquez Pérez, Alberto (1997-01-01)
Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias ...
Presentation
Icon

the width of a convex set on the sphere

Cobos, F.J.; Dana Jiménez, Juan Carlos; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto (Queen's University, 1997-01-01)
Presentation
Icon

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-01-01)
Article
Icon

A linear algorithm to recognize maximal generalized outerplanar graphs

Cáceres, José; Márquez Pérez, Alberto (Institute of Mathematics of the Czech Academy of Sciences, 1997-01-01)
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.
Article
Icon

A link between menger’s theorem and infinite euler graphs

Boza Prieto, Luis; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (Akadémiai Kiadó, 1997-01-01)
PhD Thesis
Icon

Transversalidad en 2-complejos

Fernández Fernández, Luis Manuel; Márquez Pérez, Alberto; Villar Liñán, María Trinidad (1996-01-01)
"Si bien el problema de la Transversalidad ha sido ampliamente estudiado en la Teoría de Grafos, los 2-complejos de Euler ...
Article
Icon

On a visibility representation of graphs

Cobos Gavala, Javier; Dana Jiménez, Juan Carlos; Hurtado, Ferrán; Márquez Pérez, Alberto; Mateos Mateos, Felipe (1996-01-01)
We give a visibility representation of graphs which extends some very well-known representations considered extensively ...
Article
Icon

The center of an infinite graph

Boza Prieto, Luis; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (1996-01-01)
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the ...
PhD Thesis
Icon

Sobre visibilidad en espacios n-dimensionales y superficies no planas

Márquez Pérez, Alberto; Mateos Mateos, Felipe; Cobos Gavala, Javier (1995-12-01)
Tres son los problemas fundamentales que presenta el estudio de los grafos de visibilidad: el de la construcción, el de ...
Article
Icon

Moore spaces in proper homotopy

Ayala Gómez, Rafael; Domínguez, E.; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (University of Tsukuba, 1995-01-01)
Moore spaces are de ned in proper homotopy theory. Some results on the existence and uniqueness of those spaces are proven. An example of two non properly equivalent Moore spaces is given.
Article
Icon

On the Graphs which are the Edge of a Plane Tiling

Ayala Gómez, Rafael; Domínguez, E.; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (Mathematica Scandinavica, 1995-01-01)
PhD Thesis
Icon

Grafos periódicos: Una familia de grafos infinitos que admiten una algorítmica constructiva

Márquez Pérez, Alberto; Dana Jiménez, Juan Carlos (1994-04-13)
El objetivo de esta Tesis es definir una familia de grafos infinitos en la cual es posible construir una algorítmica finita. ...
Article
Icon

On infinite outerplanar graphs

Boza Prieto, Luis; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (Institute of Mathematics of the Czech Academy of Sciences, 1994-01-01)
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden subgraphs
PhD Thesis
Icon

Transversalidad en grafos numerales localmente finitos

Márquez Pérez, Alberto; Boza Prieto, Luis (1993-11-19)
Los primeros problemas que plantearon y resolvieron en Teoría de Grafos, son problemas referentes a la Transversalidad de ...
Presentation
Icon

A framework for digital topology

Domínguez, E.; Francés, A. R.; Márquez Pérez, Alberto (IEEE Computer Society, 1993-01-01)
The main goal of this paper is to show the functional architecture of a framework for digital topology. This architecture ...
Article
Icon

On Sedlacek's C-Graphs

Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (Societatea de Științe Matematice din România, 1993-01-01)
In this Note, we study some properties of Sedlacek's C-graphs (see [3], [4] and [5]). In particular, we give new methods ...
Article
Icon

Lusternik-Schnirelmann invariants in proper homotopy theory

Ayala Gómez, Rafael; Domínguez Murillo, Eladio; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (University of California, 1992-01-01)
We introduce and study proper homotopy invariants of the Lusternik-Schnirelmann type, p-cat (-), p-Cat(-), and cat e(-) ...
Article
Icon

Proper Homotopy Classification of Graphs

Ayala Gómez, Rafael; Domínguez, E.; Márquez Pérez, Alberto; Quintero Toscano, Antonio Rafael (London Mathematical Society, 1990-01-01)
This work presents a classification of the proper homotopy types of locally finite 1-dimensional CW-complexes.
PhD Thesis
Icon

Grupos de homotopía propia uniformemente continua

Domínguez Murillo, Eladio; Márquez Pérez, Alberto (1987-01-01)
En el Capítulo 1, vamos a desarrollar el concepto de aplicaciones up (uniformemente continuas y propias) entre espacios ...