Now showing items 1-20 of 30

• 4-labelings and grid embeddings of plane quadrangulations ﻿

(2009-06-03)
External research report
Open Access
We 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 ﻿

(Universitat Politècnica de Catalunya, 2016)
Lecture notes
Open Access
• Anells cordals:propietats estructurals i models de comunicacions ﻿

(Universitat Politècnica de Catalunya, 1999-10-14)
Doctoral thesis
Open Access
En 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 ﻿

(Universitat Politècnica de Catalunya, 2014)
Lecture notes
Open Access
• Art i aleatorietat ﻿

(Societat Catalana de Matemàtiques (SCM), 2019-07)
Article
Restricted access - publisher's policy
• CAL-T: Examen FQ: primavera 2018 ﻿

(Universitat Politècnica de Catalunya, 2018-06-06)
Exam
• CAL-T: Examen FQ: primavera 2019 ﻿

(Universitat Politècnica de Catalunya, 2019-06-11)
Exam
• CAL-T: Examen FQ: tardor 2018 ﻿

(Universitat Politècnica de Catalunya, 2019-01-15)
Exam
• CAL-T: Examen MQ: primavera 2018 ﻿

(Universitat Politècnica de Catalunya, 2018-04-06)
Exam
• CAL-T: Examen MQ: primavera 2019 ﻿

(Universitat Politècnica de Catalunya, 2019-04-01)
Exam
• CAL-T: Examen MQ: tardor 2018 ﻿

(Universitat Politècnica de Catalunya, 2018-11-05)
Exam
• Combinatorics in the Art of the Twentieth Century ﻿

(2017)
Conference report
Open Access
This 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 ﻿

(2002-07)
External research report
Open Access
This 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 ﻿

(2010-09-26)
External research report
Open Access
In 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 ...
• Defensive alliances in regular graphs and circulant graphs ﻿

(2008-10)
Article
Open Access
In 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 ﻿

(2006)
Article
Open Access
It 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 ...
• Deterministic hierarchical networks ﻿

(2016)
Article
Open Access
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and also scale-free (the degrees are distributed according ...
• Deterministic hierarchical networks ﻿

(2007-11-20)
Article
Open Access
Recently it has been shown that many networks associated with complex systems are small-world (they have both a large local clustering and a small diameter) and they are also scale-free (the degrees are distributed according ...
• Genera Esfera: Interacting with a trackball mapped onto a sphere to explore generative visual worlds ﻿

(2016)
Conference report
Open Access
Genera Esfera is an interactive installation that allows the audience to interact and easily become a VJ (visual DJ) in a world of generative visuals. It is an animated and generative graphic environment with a music ...
• Gossiping in chordal rings under the line model ﻿

(2000)
Article
Open Access
The line model assumes long distance calls between non neighboring processors. In this sense, the line model is strongly related to circuit-switched networks, wormhole routing, optical networks supporting wavelength ...