### Data

 Name Márquez Pérez, Alberto Department Matemática Aplicada I Knowledge area Matemática Aplicada Professional category Catedrático de Universidad E-mail Request

• Items

• Visits

### Publications

Article

#### Continuous mean distance of a weighted graph

(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

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

(BioRxiv, 2020-01-01)
Apico-basal cell intercalations (scutoids) optimize packing and energy expenditure in curved epithelia. Further consequences ...
Article

#### Hamiltonian triangular refinements and space-filling curves

(Elsevier, 2019-01-01)
We have introduced here the concept of Hamiltonian triangular refinement. For any Hamiltonian triangulation it is shown ...
Article

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

(Nature Research, 2018-01-01)
Article

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

(Nature Publishing Group, 2018-01-01)
As animals develop, tissue bending contributes to shape the organs into complex three-dimensional structures. However, the ...
Article

#### Shortcut sets for the locus of plane Euclidean networks

(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

#### Computing Optimal Shortcuts for Networks

(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

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

(2017-09-29)
We present a new approach to adapt the differential evolution (DE) algorithm so that it can be applied in combinatorial ...
Article

#### Classical properties of algebras using a new graph association

(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

#### Shortcut sets for plane Euclidean networks (Extended abstract)

(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

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

(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

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

(2014-01-01)
A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The ...
Article

#### Computing the Tutte polynomial of Archimedean tilings

(2014-01-01)
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...
Article

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

(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

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

(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

#### Resolving sets for breaking symmetries of graphs

(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

#### Monotone crossing number of complete graphs

(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

#### Phase transitions in the Ramsey-Turán theory

(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

#### On 4-connected geometric graphs

(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

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

(2013-01-01)
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or ...
Presentation

(2013-01-01)
Article

#### The resolving number of a graph

(2013-01-01)
We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by ...
Article

#### The determining number of Kneser graphs

(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

#### Reporting flock patterns on the GPU

(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

#### Solving common influence region queries with the GPU

(2013-01-01)
In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under ...
Presentation

#### Guarding the vertices of thin orthogonal polygons is NP-hard

(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

#### Three location tapas calling for CG sauce

(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

#### On the barrier-resilience of arrangements of ray-sensors

(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

#### On the enumeration of permutominoes

(2013-01-01)
Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...
Presentation

#### Distance domination, guarding and vertex cover for maximal outerplanar graphs

(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

#### Computing the stretch of an embedded graph

(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

#### Abstract Voronoi diagrams

(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

#### An algorithm that constructs irreducible triangulations of once-punctured surfaces

(2013-01-01)
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...
Presentation

#### Metaheuristic approaches for the minimum dilation triangulation problem

(2013-01-01)
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ...
Presentation

#### Parallel constrained Delaunay triangulation

(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

#### Equipartitioning triangles

(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

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

(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

#### SensoGraph: Using proximity graphs for sensory analysis

(2013-01-01)
Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ...
Presentation

#### Drawing the double circle on a grid of minimum size

(2013-01-01)
In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ...
Presentation

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

(2013-01-01)
A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ...
Presentation

#### Simulating distributed algorithms for lattice agents

(2013-01-01)
We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional ...
Presentation

#### Note on the number of obtuse angles in point sets

(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

#### Empty convex polytopes in random point sets

(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

#### Simulated annealing applied to the MWPT problem

(2013-01-01)
The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing ...
Presentation

#### Stabbing simplices of point sets with k-flats

(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

#### Stackable tessellations

(2013-01-01)
We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ...
Presentation

#### Improved enumeration of simple topological graphs

(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

#### Continuous surveillance of points by rotating floodlights

(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

(2013-01-01)
Presentation

#### On three parameters of invisibility graphs

(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

#### On making a graph crossing-critical

(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

#### Witness bar visibility

(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

#### The alternating path problem revisited

(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

#### Resolving sets for Johnson and Kneser graphs

(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

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

(2013-01-01)
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We ...
Presentation

#### Some results on open edge guarding of polygons

(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

#### Witness-Bar Visibility Graphs

(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

#### Reporting Bichromatic Segment Intersections from Point Sets

(2012-01-01)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets ...
Article

#### Separability of Point Sets by k-Level Linear Classification Trees

(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

#### Cover contact graphs

(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

#### Towards a new framework for domination

(2011-01-01)
Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding ...
Article

#### Stabbers of line segments in the plane

(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

#### Compact Grid Representation of Graphs

(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

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

(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

#### Differential evolution in shortest path problems

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

#### ϵ- DANTE : an ant colony oriented depth search procedure

(2011-01-01)
The ϵ-Depth ANT Explorer (ϵ- DANTE ) algorithm applied to a multiple objective optimization problem is presented in this ...
Article

#### Transforming Triangulations on Nonplanar Surfaces

(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

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

(2009-01-01)
The triangle longest-edge bisection constitutes an efficient scheme for refining a mesh by reducing the obtuse triangles, ...
Article

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

(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

#### Steiner distance and convexity in graphs

(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

#### Geometric Realization of Möbius Triangulations

(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

(2008-01-01)
Chapter of Book

#### DANTE The Combination between an Ant Colony Optimization Algorithm and a Depth Search Method

(2008-01-01)
The isin-DANTE method is an hybrid meta-heuristic. In combines the evolutionary ant colony optimization (ACO) algorithms ...
Article

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

(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

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

(2007-03-02)
El estudio de soluciones meta-heurísticas basadas en el paradigma del Ant Colony Optimization (ACO) para el Multiple ...
Article

#### Dilation-free graphs in the l1 metric

(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

#### Cover Contact Graphs

(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

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

En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos en el plano son separables ...
Article

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

(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

(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

#### Rebuilding convex sets in graphs

(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

#### Hexagonal Tilings and Locally C6 Graphs

(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

#### Hexagonal Tilings: Tutte Uniqueness

(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

#### Multiple criteria minimum spanning trees

The NP multiple criteria minimum spanning tree as several applications into the network design problems. In this paper, ...
PhD Thesis

#### Polinomio de tutte de teselaciones regulares

(2004-10-14)
En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo ...
Article

#### Euclidean position in Euclidean 2-orbifolds

(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

#### Extremal Graphs without Topological Complete Subgraphs

(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

#### Locally grid graphs: classification and Tutte uniqueness

(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

#### Geometría computacional en superficies de órbitas

(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

(2003-01-01)
Article

#### Transforming triangulations on non planar-surfaces

(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

#### More results about spanners in the l1-metric

In this work we study more questions about spanners in the l1-metric. Concretely, we will see that adding some Steiner ...
Presentation

#### Motion Planning and Visibility Problems using the Polar Diagram

(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

#### MONACO - Multi-Objective Network Optimisation Based on an ACO

The Ant Colony Optimisation Algorithm (ACO) supports the development of a system for a multi-objective network ...
Presentation

#### Multiple Objective TSP based on ACO

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

PhD Thesis

#### Problemas de conexiones ortogonales

(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

#### An aperiodic tiles machine

(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

#### Diagonal flips in outer-triangulations on closed surfaces

(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

#### Single bend wiring on surfaces

(2002-01-01)
The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible ...
Article

#### Triangle-Free Planar Graphs as Segment Intersection Graphs

(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

(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

#### On the connectivity of skeletons of pseudomanifolds with boundary

(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

(2002-01-01)
Presentation

#### Reconstrucción de conjuntos convexos en grafos

(Alberto Márquez, 2002-01-01)
Presentation

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

(Alberto Márquez, 2002-01-01)
Presentation

#### Puntos en posición general para una λ-distancia

(Alberto Márquez, 2002-01-01)
Presentation

#### Optimization system in networks using ACO

(Alberto Márquez, 2002-01-01)
Presentation

#### Conexiones ortogonales con vértices prefijados

(Alberto Márquez, 2002-01-01)
Presentation

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

(Alberto Márquez, 2002-01-01)
Presentation

#### Algunas notas sobre mosaicos de Penrose

(Alberto Márquez, 2002-01-01)
Presentation

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

(Alberto Márquez, 2002-01-01)
Presentation

#### Grafos localmente grid: clasificación y Tutte unicidad

(Alberto Márquez, 2002-01-01)
Presentation

(Alberto Márquez, 2002-01-01)
Article

(2001-01-01)
Article

#### Miscellaneous properties of embeddings of line, total and middle graphs

(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

#### Labeling Subway Lines

(2001-01-01)
Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to ...
Article

Article

#### The Size of a Graph Without Topological Complete Subgraphs

(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

#### Spanners in l1

(University of Fredericton, 2000-01-01)
PhD Thesis

#### Inmersiones de grafos en superficies tubulares de género finito

(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

#### Triangulaciones de superficies

(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

#### Triangle-Free Planar Graphs as Segments Intersection Graphs

(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

#### Geometric tree graphs of points in convex position

(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

#### On the connectivity of infinite graphs and 2-complexes

(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

#### Geometría computaciones en superficies no planas

(1998-09-28)
De forma general, la Geometría Computaciones trata del estudio de algoritmos que resuelven problemas geométricos con el ...
PhD Thesis

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

(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

#### Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard

(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

#### Inmersiones ortogonales de grafos en superficies no planas

(1997-01-01)
El área de investigación sobre dibujos de grafos (graph drawing) se ha convertido en un campo extensamente estudiado, ...
Presentation

#### Anchura de un convexo en la esfera.

(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

#### the width of a convex set on the sphere

(Queen's University, 1997-01-01)
Presentation

#### Diameter of a set on the cylinder

(Queen's University, 1997-01-01)
Article

#### A linear algorithm to recognize maximal generalized outerplanar graphs

(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

#### A link between menger’s theorem and infinite euler graphs

PhD Thesis

(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

#### On a visibility representation of graphs

(1996-01-01)
We give a visibility representation of graphs which extends some very well-known representations considered extensively ...
Article

#### The center of an infinite graph

(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

#### Sobre visibilidad en espacios n-dimensionales y superficies no planas

(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

#### Moore spaces in proper homotopy

(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

#### On the Graphs which are the Edge of a Plane Tiling

(Mathematica Scandinavica, 1995-01-01)
PhD Thesis

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

(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

#### On infinite outerplanar graphs

(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

#### Transversalidad en grafos numerales localmente finitos

(1993-11-19)
Los primeros problemas que plantearon y resolvieron en Teoría de Grafos, son problemas referentes a la Transversalidad de ...
Presentation

#### A framework for digital topology

(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

#### On Sedlacek's C-Graphs

(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

#### Lusternik-Schnirelmann invariants in proper homotopy theory

(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

#### Proper Homotopy Classification of Graphs

(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

#### Grupos de homotopía propia uniformemente continua

(1987-01-01)
En el Capítulo 1, vamos a desarrollar el concepto de aplicaciones up (uniformemente continuas y propias) entre espacios ...