Guillem Perarnau

66 papers A* 4A 1Journal 58Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs. Comb. Probab. Comput. Amarja Kathapurkar, Patrick Morris, Guillem Perarnau
2026	J	`jnl`	Composition of random functions and word reconstruction. CoRR Guillaume Chapuy, Guillem Perarnau
2025	J	`jnl`	An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors. CoRR Lucas de Meyer, Frantisek Kardos, Aurélie Lagoutte, Guillem Perarnau
2025	J	`jnl`	Short Synchronizing Words for Random Automata. ACM Trans. Algorithms Guillaume Chapuy, Guillem Perarnau
2025	J	`jnl`	The Lonely Runner Conjecture turns 60. Comput. Sci. Rev. Guillem Perarnau, Oriol Serra
2024	J	`jnl`	A Telescopic Proof of Cayley's Formula. Am. Math. Mon. Guillaume Chapuy, Guillem Perarnau
2024	J	`jnl`	First Order Logic of Sparse Graphs with Given Degree Sequences. CoRR Alberto Larrauri, Guillem Perarnau
2024	J	`jnl`	Percolation on dense random graphs with given degrees. J. Comb. Theory B Lyuben Lichev, Dieter Mitsche, Guillem Perarnau
2024	J	`jnl`	Preface. Eur. J. Comb. Jaroslav Nesetril, Guillem Perarnau, Juanjo Rué, Oriol Serra
2023	A*	`conf`	Short Synchronizing Words for Random Automata. SODA Guillaume Chapuy, Guillem Perarnau
2022	J	`jnl`	Percolation on Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau
2022	J	`jnl`	Short Synchronizing Words for Random Automata. CoRR Guillaume Chapuy, Guillem Perarnau
2022	J	`jnl`	Speeding up random walk mixing by starting from a uniform vertex. CoRR Alberto Espuny Díaz, Patrick Morris, Guillem Perarnau, Oriol Serra
2021	J	`jnl`	Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
2021	J	`jnl`	On the Number of Coloured Triangulations of d-Manifolds. Discret. Comput. Geom. Guillaume Chapuy, Guillem Perarnau
2021	J	`jnl`	Rankings in directed configuration models with heavy tailed in-degrees. CoRR Xing Shi Cai, Pietro Caputo, Guillem Perarnau, Matteo Quattropani
2020	J	`jnl`	A Rainbow Dirac's Theorem. SIAM J. Discret. Math. Matthew Coulson, Guillem Perarnau
2020	J	`jnl`	Diameter and Stationary Distribution of Random $r$-Out Digraphs. Electron. J. Comb. Louigi Addario-Berry, Borja Balle, Guillem Perarnau
2020	J	`jnl`	Minimum stationary values of sparse random directed graphs. CoRR Xing Shi Cai, Guillem Perarnau
2020	J	`jnl`	Rainbow factors in hypergraphs. J. Comb. Theory A Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan
2020	J	`jnl`	The Glauber dynamics for edge-colorings of trees. Random Struct. Algorithms Michelle Delcourt, Marc Heinrich, Guillem Perarnau
2020	J	`jnl`	The diameter of the directed configuration model. CoRR Xing Shi Cai, Guillem Perarnau
2020	J	`jnl`	The giant component of the directed configuration model revisited. CoRR Xing Shi Cai, Guillem Perarnau
2020	J	`jnl`	Two lower bounds for $p$-centered colorings. CoRR Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
2020	J	`jnl`	Two lower bounds for p-centered colorings. Discret. Math. Theor. Comput. Sci. Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
2019	J	`jnl`	Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture. J. Comb. Theory B Guillaume Chapuy, Guillem Perarnau
2019	A*	`conf`	Improved Bounds for Randomly Sampling Colorings via Linear Programming. SODA Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle
2019	—	`conf`	Preface. BCC Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown
2019	J	`jnl`	Rainbow matchings in Dirac bipartite graphs. Random Struct. Algorithms Matthew Coulson, Guillem Perarnau
2019	—	`ed.`	Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019. BCC Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown
2018	J	`jnl`	Counting independent sets in cubic graphs of given girth. J. Comb. Theory B Guillem Perarnau, Will Perkins
2018	J	`jnl`	Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
2018	J	`jnl`	Improved Bounds for Randomly Sampling Colorings via Linear Programming. CoRR Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle
2018	J	`jnl`	Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. CoRR Michelle Delcourt, Guillem Perarnau, Luke Postle
2018	J	`jnl`	The Glauber dynamics for edges colourings of trees. CoRR Michelle Delcourt, Marc Heinrich, Guillem Perarnau
2017	J	`jnl`	Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
2017	J	`jnl`	Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. Guillem Perarnau, Bruce A. Reed
2017	J	`jnl`	On Treewidth and Related Parameters of Random Geometric Graphs. SIAM J. Discret. Math. Dieter Mitsche, Guillem Perarnau
2017	J	`jnl`	Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. Electron. Notes Discret. Math. Pilar Cano, Guillem Perarnau, Oriol Serra
2016	A*	`conf`	Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture. SODA Guillaume Chapuy, Guillem Perarnau
2016	J	`jnl`	Correlation Among Runners and Some Results on the Lonely Runner Conjecture. Electron. J. Comb. Guillem Perarnau, Oriol Serra
2016	J	`jnl`	Fast recoloring of sparse graphs. Eur. J. Comb. Nicolas Bousquet, Guillem Perarnau
2016	A*	`conf`	How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
2016	J	`jnl`	How to determine if a random graph with a fixed degree sequence has a giant component. CoRR Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
2016	—	`conf`	Local Convergence and Stability of Tight Bridge-Addable Graph Classes. APPROX-RANDOM Guillaume Chapuy, Guillem Perarnau
2016	J	`jnl`	Percolation on random graphs with a fixed degree sequence. CoRR Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau
2016	J	`jnl`	Rainbow perfect matchings in r-partite graph structures. Electron. Notes Discret. Math. Pilar Cano, Guillem Perarnau, Oriol Serra
2015	J	`jnl`	Decomposition of bounded degree graphs into C Eur. J. Comb. Ross J. Kang, Guillem Perarnau
2015	J	`jnl`	Diameter and Stationary Distribution of Random $r$-out Digraphs. CoRR Louigi Addario-Berry, Borja Balle, Guillem Perarnau
2015	J	`jnl`	Large Subgraphs without Short Cycles. SIAM J. Discret. Math. Florent Foucaud, Michael Krivelevich, Guillem Perarnau
2014	J	`jnl`	Acyclic edge colourings of graphs with large girth. CoRR Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
2014	J	`jnl`	Fast Recoloring of Sparse Graphs. CoRR Nicolas Bousquet, Guillem Perarnau
2014	J	`jnl`	On the relation between graph distance and Euclidean distance in random geometric graphs. CoRR Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez
2014	J	`jnl`	On the tree-depth of random graphs. Discret. Appl. Math. Guillem Perarnau, Oriol Serra
2013	J	`jnl`	A probabilistic approach to consecutive pattern avoiding in permutations. J. Comb. Theory A Guillem Perarnau
2013	J	`jnl`	Matchings in Random Biregular Bipartite Graphs. Electron. J. Comb. Guillem Perarnau, Giorgis Petridis
2013	J	`jnl`	Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting. Comb. Probab. Comput. Guillem Perarnau, Oriol Serra
2013	J	`jnl`	Random subgraphs make identification affordable. CoRR Florent Foucaud, Guillem Perarnau, Oriol Serra
2012	J	`jnl`	Bounds for Identifying Codes in Terms of Degree Parameters. Electron. J. Comb. Florent Foucaud, Guillem Perarnau
2012	J	`jnl`	Locally identifying colourings for graphs with given maximum degree. Discret. Math. Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
2012	A	`conf`	On the treewidth and related parameters of random geometric graphs. STACS Dieter Mitsche, Guillem Perarnau
2011	J	`jnl`	Bounds for identifying codes in terms of degree parameters CoRR Florent Foucaud, Guillem Perarnau
2011	J	`jnl`	Locally identifying colourings for graphs with given maximum degree CoRR Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
2011	J	`jnl`	On the tree-depth of Random Graphs CoRR Guillem Perarnau, Oriol Serra
2011	J	`jnl`	Rainbow Matchings: existence and counting CoRR Guillem Perarnau, Oriol Serra
2011	J	`jnl`	Rainbow Matchings: existence and counting. Electron. Notes Discret. Math. Guillem Perarnau, Oriol Serra