Ponències/Comunicacions de congressos
Recent Submissions

Isolated cycles of critical random graphs
(Society for Industrial and Applied Mathematics (SIAM), 2017)
Conference report
Open AccessConsider the ErdosRenyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute ... 
Location in maximal outerplanar graphs
(2017)
Conference report
Restricted access  publisher's policyIn this work we study the metric dimension and the locationdomination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal ... 
Dynamic programming for graphs on surfaces
(Springer, 2010)
Conference report
Open AccessWe provide a framework for the design and analysis of dynamic programming algorithms for surfaceembedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where ... 
Random cubic planar graphs revisited
(Elsevier, 2016)
Other
Restricted access  publisher's policyThe goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices. ... 
Exploiting symmetry on the Universal Polytope
(2012)
Conference report
Restricted access  publisher's policyThe most successful method to date for finding lower bounds on the number of simplices needed to triangulate a given polytope P involves optimizing a linear functional over the associated Universal Polytope U(P). However, ... 
On two distributions of subgroups of free groups
(Society for Industrial and Applied Mathematics, 2010)
Conference report
Restricted access  publisher's policyWe study and compare two natural distributions of finitely generated subgroups of free groups. One is based on the random generation of tuples of reduced words; that is the one classically used by group theorists. The ... 
On the evaluation of the Tutte polynomial at the points (1,1) and (2,1)
(2010)
Conference report
Open AccessC. Merino proved recently the following identity between evaluations of the Tutte polynomial of complete graphs: t($K_{n+2}$; 1,−1) = t($K_n$;2,−1). In this work we extend this result by giving a large class of graphs with ... 
Rotational and dihedral symmetries in Steinhaus and Pascal binary triangles
(2010)
Conference report
Open AccessWe give explicit formulae for obtaining the binary sequences which produce Steinhaus triangles and generalized Pascal triangles with rotational and dihedral symmetries. 
An algorithm to design prescribed length codes for singletracked shaft encoders
(20090414)
Conference report
Open AccessAbstractMaximallength binary shift register sequences have been known for a long time. They have many interesting properties, one of them is that when taken in blocks of n consecutive positions they form 2n  1 different ... 
On polytopality of Cartesian products of graphs
(201007)
Conference report
Open AccessWe study the polytopality of Cartesian products of nonpolytopal graphs. On the one hand, we prove that a product of graphs is the graph of a simple polytope if and only if its factors are. On the other hand, we provide ... 
Graph operations and Laplacian eigenpolytopes
(201007)
Conference report
Open AccessWe introduce the Laplacian eigenpolytopes ("Lpolytopes") associated to a simple undirected graph G, investigate how they change under basic operations such as taking the union, join, complement, line graph and cartesian ... 
Overlapping community search for social networks
(IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
Conference report
Open AccessFinding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes, realworld datasets suggest the presence ...