Overlapping Community Search for social networks. - Arnau Padrol-Sureda; Guillem Perarnau-Llobet; Julian Pfeifle; Victor Muntés-Mulero (ICDE, 2010)

Rainbow Matchings: existence and counting. - Guillem Perarnau; Oriol Serra (Electron. Notes Discret. Math., 2011)

Bounds for Identifying Codes in Terms of Degree Parameters. - Florent Foucaud; Guillem Perarnau (Electron. J. Comb., 2012)

Locally identifying colourings for graphs with given maximum degree. - Florent Foucaud; Iiro S. Honkala; Tero Laihonen; Aline Parreau; Guillem Perarnau (Discret. Math., 2012)

Matchings in Random Biregular Bipartite Graphs. - Guillem Perarnau; Giorgis Petridis (Electron. J. Comb., 2013)

Random subgraphs make identification affordable. - Florent Foucaud; Guillem Perarnau; Oriol Serra (CoRR, 2013)

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting. - Guillem Perarnau; Oriol Serra (Comb. Probab. Comput., 2013)

A probabilistic approach to consecutive pattern avoiding in permutations. - Guillem Perarnau (J. Comb. Theory A, 2013)

On the relation between graph distance and Euclidean distance in random geometric graphs. - Josep Díaz; Dieter Mitsche; Guillem Perarnau; Xavier Pérez-Giménez (CoRR, 2014)

On the tree-depth of random graphs. - Guillem Perarnau; Oriol Serra (Discret. Appl. Math., 2014)

Decomposition of bounded degree graphs into C4-free subgraphs. - Ross J. Kang; Guillem Perarnau (Eur. J. Comb., 2015)

Large Subgraphs without Short Cycles. - Florent Foucaud; Michael Krivelevich; Guillem Perarnau (SIAM J. Discret. Math., 2015)

Local Convergence and Stability of Tight Bridge-Addable Graph Classes. - Guillaume Chapuy; Guillem Perarnau (APPROX-RANDOM, 2016)

How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. - Felix Joos; Guillem Perarnau; Dieter Rautenbach; Bruce A. Reed (FOCS, 2016)

Correlation Among Runners and Some Results on the Lonely Runner Conjecture. - Guillem Perarnau; Oriol Serra (Electron. J. Comb., 2016)

Fast recoloring of sparse graphs. - Nicolas Bousquet 001; Guillem Perarnau (Eur. J. Comb., 2016)

Rainbow perfect matchings in r-partite graph structures. - Pilar Cano; Guillem Perarnau; Oriol Serra (Electron. Notes Discret. Math., 2016)

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. - Guillem Perarnau; Bruce A. Reed (Comb. Probab. Comput., 2017)

Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. - Pilar Cano; Guillem Perarnau; Oriol Serra (Electron. Notes Discret. Math., 2017)

Acyclic edge colourings of graphs with large girth. - Xing Shi Cai; Guillem Perarnau; Bruce A. Reed; Adam Bene Watts (Random Struct. Algorithms, 2017)

On Treewidth and Related Parameters of Random Geometric Graphs. - Dieter Mitsche; Guillem Perarnau (SIAM J. Discret. Math., 2017)

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. - Michelle Delcourt; Guillem Perarnau; Luke Postle (CoRR, 2018)

The Glauber dynamics for edges colourings of trees. - Michelle Delcourt; Marc Heinrich; Guillem Perarnau (CoRR, 2018)

Frozen colourings of bounded degree graphs. - Marthe Bonamy; Nicolas Bousquet 001; Guillem Perarnau (Electron. Notes Discret. Math., 2018)

Counting independent sets in cubic graphs of given girth. - Guillem Perarnau; Will Perkins 001 (J. Comb. Theory B, 2018)

Preface. - Allan Lo; Richard Mycroft; Guillem Perarnau; Andrew Treglown (BCC, 2019)

Improved Bounds for Randomly Sampling Colorings via Linear Programming. - Sitan Chen; Michelle Delcourt; Ankur Moitra; Guillem Perarnau; Luke Postle (SODA, 2019)

Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture. - Guillaume Chapuy; Guillem Perarnau (J. Comb. Theory B, 2019)

Rainbow matchings in Dirac bipartite graphs. - Matthew Coulson; Guillem Perarnau (Random Struct. Algorithms, 2019)

Diameter and Stationary Distribution of Random $r$-Out Digraphs. - Louigi Addario-Berry; Borja Balle; Guillem Perarnau (Electron. J. Comb., 2020)

The diameter of the directed configuration model. - Xing Shi Cai; Guillem Perarnau (CoRR, 2020)

The giant component of the directed configuration model revisited. - Xing Shi Cai; Guillem Perarnau (CoRR, 2020)

Minimum stationary values of sparse random directed graphs. - Xing Shi Cai; Guillem Perarnau (CoRR, 2020)

Two lower bounds for p-centered colorings. - Loïc Dubois 001; Gwenaël Joret; Guillem Perarnau; Marcin Pilipczuk; François Pitois (Discret. Math. Theor. Comput. Sci., 2020)

Rainbow factors in hypergraphs. - Matthew Coulson; Peter Keevash; Guillem Perarnau; Liana Yepremyan (J. Comb. Theory A, 2020)

The Glauber dynamics for edge-colorings of trees. - Michelle Delcourt; Marc Heinrich; Guillem Perarnau (Random Struct. Algorithms, 2020)

A Rainbow Dirac's Theorem. - Matthew Coulson; Guillem Perarnau (SIAM J. Discret. Math., 2020)

Rankings in directed configuration models with heavy tailed in-degrees. - Xing Shi Cai; Pietro Caputo; Guillem Perarnau; Matteo Quattropani (CoRR, 2021)

Frozen (Δ + 1)-colourings of bounded degree graphs. - Marthe Bonamy; Nicolas Bousquet 001; Guillem Perarnau (Comb. Probab. Comput., 2021)

On the Number of Coloured Triangulations of d-Manifolds. - Guillaume Chapuy; Guillem Perarnau (Discret. Comput. Geom., 2021)

Speeding up random walk mixing by starting from a uniform vertex. - Alberto Espuny Díaz; Patrick Morris 001; Guillem Perarnau; Oriol Serra (CoRR, 2022)

Percolation on Random Graphs with a Fixed Degree Sequence. - Nikolaos Fountoulakis; Felix Joos; Guillem Perarnau (SIAM J. Discret. Math., 2022)

Short Synchronizing Words for Random Automata. - Guillaume Chapuy; Guillem Perarnau (SODA, 2023)

First Order Logic of Sparse Graphs with Given Degree Sequences. - Alberto Larrauri; Guillem Perarnau (CoRR, 2024)

Preface. - Jaroslav Nesetril; Guillem Perarnau; Juanjo Rué; Oriol Serra (Eur. J. Comb., 2024)

Percolation on dense random graphs with given degrees. - Lyuben Lichev; Dieter Mitsche; Guillem Perarnau (J. Comb. Theory B, 2024)

A Telescopic Proof of Cayley's Formula. - Guillaume Chapuy; Guillem Perarnau (Am. Math. Mon., 2024)

The Lonely Runner Conjecture turns 60. - Guillem Perarnau; Oriol Serra (Comput. Sci. Rev., 2025)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors. - Lucas de Meyer; Frantisek Kardos; Aurélie Lagoutte; Guillem Perarnau (CoRR, 2025)