Now showing items 1-20 of 21

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

(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 ...
• 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 ...
• 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 ...
• Introducció a la lògica ﻿

(Edicions UPC, 2006)
Book
Restricted access to UB, UAB, UPC, UPF, UdG, UdL, URV, UOC, BC, UVic, UJI, URL, UIC users
Aquest llibre ha estat escrit amb el propòsit de facilitar l'aprenentatge de la lògica als estudiants d'Enginyeria Informàtica. Està orientat a l'adquisició dels coneixements bàsics que permetin tractar els raonaments d'una ...
• Lissajous curves: an experiment in creative coding ﻿

(2015)
Conference lecture
Restricted access - publisher's policy
Do you want to become a creative coder for a day? When artists use a computer to make art, they often experience the need of improving their mathematical skills. On the other hand, students with technical skills are less ...
• Online matching in regular bipartite graphs ﻿

(2018-06-01)
Article
Restricted access - publisher's policy
In an online problem, the input is revealed one piece at a time. In every time step, the online algorithm has to produce a part of the output, based on the partial knowledge of the input. Such decisions are irrevocable, ...
• On the Hierarchical Product of Graphs and the Generalized Binomial Tree ﻿

(2007-09)
Article
Open Access
In this paper we follow the study of the hierarchical product of graphs, an operation recently introduced in the context of networks. A well-known example of such a product is the binomial tree which is the (hierarchical) ...
• On the spectra of hypertrees ﻿

(2007-05)
Article
Open Access
In this paper we study the spectral properties of a family of trees characterized by two main features: they are spanning subgraphs of the hypercube, and their vertices bear a high degree of (connectedness) hierarchy. ...
• Sediment ﻿

(2018)
Conference report
Restricted access - publisher's policy
Sediment is a series of abstract narrations which combine the generative visuals of Lali Barrière with the static music of Ferran Fages, with a clearly minimalist approach. The visuals use a single graphic element: the ...
• Teaching mathematics and physics for animation in processing ﻿

(Tessellations Publishing, 2018)
Conference report
Restricted access - publisher's policy
This paper describes my teaching experience with first year undergraduate students, at the Centre de la Imatge i la Tecnologia Multimèdia (CITM), in Terrassa, a city near Barcelona (Catalonia) during the Fall 2017 semester. ...
• The Frobenius problem: a geometric approach ﻿

(2007-07)
Article
Open Access
For the well known Frobenius problem, we present a new geometric approach, based on the use of the $n$-dimensional lattice $\mathbb{Z}^n$, where $n$ is the number of generators. Within this approach we are able to study ...
• The generalized hierarchical product of graphs ﻿

(2008-01)
Article
Open Access
A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs ...