Browsing by Author "Barrière Figueroa, Eulalia"
Now showing items 1-20 of 34
-
3.000 passos fins al blau gel
Agusti Cami, Maria Eugenia; Barrière Figueroa, Eulalia (El Cep i la Nansa Edicions, 2019)
Part of book or chapter of book
Restricted access - publisher's policy3.000 passos fins al blau gel es una animación generativa creada en Processing, inspirada en el poliedro de Albrecht Dürer. Es un proyecto de Eugènia Agustí y Lali Barrière desarrollado entre 2018 y 2019, en el contexto ... -
4-labelings and grid embeddings of plane quadrangulations
Barrière Figueroa, Eulalia; Huemer, Clemens (2009-06-03)
Research report
Open AccessWe show that each quadrangulation on $n$ vertices has a closed rectangle of influence drawing on the $(n-2) \times (n-2)$ grid. Further, we present a simple algorithm to obtain a straight-line drawing of a quadrangulation ... -
Ampliació de matemàtiques
Barrière Figueroa, Eulalia (Universitat Politècnica de Catalunya, 2016)
Lecture notes
Open Access -
Anells cordals:propietats estructurals i models de comunicacions
Barrière Figueroa, Eulalia (Universitat Politècnica de Catalunya, 1999-10-14)
Doctoral thesis
Open AccessEn els darrers anys hi ha hagut un gran desenvolupament de la recerca en l'àrea de les xarxes informàtiques. En aquest context, la utilització dels grafs com a models per a les xarxes, on els nodes són ordinadors o ... -
Apunts de Càlcul
Barrière Figueroa, Eulalia; Olm Miras, Josep Maria (Universitat Politècnica de Catalunya, 2014)
Lecture notes
Open Access -
Art i aleatorietat
Barrière Figueroa, Eulalia (Societat Catalana de Matemàtiques (SCM), 2019-07)
Article
Restricted access - publisher's policy -
CAL-T: Examen FQ: primavera 2018
Barrière Figueroa, Eulalia; Olm Miras, Josep Maria (Universitat Politècnica de Catalunya, 2018-06-06)
Exam
Restricted access to the UPC academic community -
CAL-T: Examen FQ: primavera 2019
Barrière Figueroa, Eulalia (Universitat Politècnica de Catalunya, 2019-06-11)
Exam
Restricted access to the UPC academic community -
CAL-T: Examen FQ: tardor 2018
Barrière Figueroa, Eulalia; Olm Miras, Josep Maria (Universitat Politècnica de Catalunya, 2019-01-15)
Exam
Restricted access to the UPC academic community -
CAL-T: Examen MQ: primavera 2018
Barrière Figueroa, Eulalia; Olm Miras, Josep Maria (Universitat Politècnica de Catalunya, 2018-04-06)
Exam
Restricted access to the UPC academic community -
CAL-T: Examen MQ: primavera 2019
Barrière Figueroa, Eulalia (Universitat Politècnica de Catalunya, 2019-04-01)
Exam
Restricted access to the UPC academic community -
CAL-T: Examen MQ: tardor 2018
Barrière Figueroa, Eulalia; Olm Miras, Josep Maria (Universitat Politècnica de Catalunya, 2018-11-05)
Exam
Restricted access to the UPC academic community -
CEL, Conversaciones en cursiva
Agusti Cami, Maria Eugenia; Barrière Figueroa, Eulalia; Pastó Aguilà, Cristina (2022-06-28)
Article
Open AccessCEL (2022) es una conversación a tres bandas que se plasma en el trazado de tres curvas que transcurren entrelazándose. Transita entre la escritura del código en lenguaje de programación que genera la imagen y la escritura ... -
Combinatorial artists: counting, permutations, and other discrete structures in art
Barrière Figueroa, Eulalia (Springer, 2021)
Part of book or chapter of book
Open AccessThis chapter is motivated by a question I asked myself: “How can combinatorial structures be used in a work of art?” Immediately, other questions arose: Are there artists that work or think combinatorially? If so, what ... -
Combinatorics in the Art of the Twentieth Century
Barrière Figueroa, Eulalia (2017)
Conference report
Open AccessThis paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially? If so, what ... -
Connected and internal graph searching
Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
Research report
Open AccessThis paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ... -
Connected graph searching
Barrière Figueroa, Eulalia; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2010-09-26)
Research report
Open AccessIn graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher ... -
Contiguous and internal graph searching
Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos, Dimitrios M. (2002)
Research report
Open AccessIn the graph searching problem, we are given a graph whose edges are all "contaminated", and, via a sequence of "steps" using "searchers", we want to obtain a state of the graph in which all edges are simultaneously "clear". ... -
Defensive alliances in regular graphs and circulant graphs
Araujo Pardo, M. Gabriela; Barrière Figueroa, Eulalia (2008-10)
Article
Open AccessIn this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph $G$ induce, if $G$ is $6$-regular and the cardinality of the alliance is ... -
Deterministic hierarchical networks
Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina (2006)
Article
Open AccessIt has recently been shown that many networks associated with complex systems are small-world (they have both a large local clustering and a small average distance and diameter) and they are also scale-free (the degrees ...