Now showing items 1-20 of 150

    • Presentation
      Icon

      A framework for digital topology 

      Domínguez, E.; Francés, A. R.; Márquez Pérez, Alberto (IEEE Computer Society, 1993)
      The main goal of this paper is to show the functional architecture of a framework for digital topology. This architecture ...
    • 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)
      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)
    • 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)
      The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but ...
    • 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; Annese, Valentina (Cell Systems, 2022)
      Apico-basal cell intercalations (scutoids) optimize packing and energy expenditure in curved epithelia. Further consequences ...
    • 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)
      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

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

      Abánades Astudillo, Miguel Ángel; Botana Ferreiro, Francisco (2013)
      A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ...
    • Presentation
      Icon

      Abstract Voronoi diagrams 

      Klein, Rolf (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.
    • PhD Thesis
      Icon

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

      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 ...
    • 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)
    • Presentation
      Icon

      An algorithm that constructs irreducible triangulations of once-punctured surfaces 

      Chávez de Diego, María José; Lawrecenko, Serge; Portillo Fernández, José Ramón; Villar Liñán, María Trinidad (2013)
      A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...
    • Article
      Icon

      An aperiodic tiles machine 

      Cáceres González, José; Márquez Pérez, Alberto (2002)
      The results we introduce in this work lead to get an algorithm which produces aperiodic sets of tiles using Voronoi diagrams. ...
    • 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)
    • 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)
      Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias ...
    • 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)
    • 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)
      We study the relation between algebraic structures and Graph Theory. We have de ned ve di erent weighted digraphs ...
    • 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)
      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

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

      Computing Optimal Shortcuts for Networks 

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

      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 ...