default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillem Perarnau
Person information
- affiliation: Polytechnic University of Catalonia, Department of Mathematics, Barcelona, Spain
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j34]Amarja Kathapurkar, Patrick Morris, Guillem Perarnau:
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs. Comb. Probab. Comput. 35(2): 149-177 (2026)- [i24]Guillaume Chapuy, Guillem Perarnau:
Composition of random functions and word reconstruction. CoRR abs/2603.28936 (2026) - 2025
- [j33]Guillem Perarnau, Oriol Serra
:
The Lonely Runner Conjecture turns 60. Comput. Sci. Rev. 58: 100798 (2025) - [j32]Guillaume Chapuy, Guillem Perarnau:
Short Synchronizing Words for Random Automata. ACM Trans. Algorithms 21(4): 41:1-41:55 (2025) - [i23]Lucas de Meyer, Frantisek Kardos, Aurélie Lagoutte, Guillem Perarnau:
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors. CoRR abs/2501.11541 (2025) - 2024
- [j31]Jaroslav Nesetril, Guillem Perarnau, Juanjo Rué, Oriol Serra:
Preface. Eur. J. Comb. 121: 103834 (2024) - [j30]Lyuben Lichev, Dieter Mitsche, Guillem Perarnau:
Percolation on dense random graphs with given degrees. J. Comb. Theory B 167: 250-282 (2024) - [j29]Guillaume Chapuy, Guillem Perarnau:
A Telescopic Proof of Cayley's Formula. Am. Math. Mon. 131(10): 899-902 (2024) - [i22]Alberto Larrauri, Guillem Perarnau:
First Order Logic of Sparse Graphs with Given Degree Sequences. CoRR abs/2405.14836 (2024) - 2023
- [c8]Guillaume Chapuy, Guillem Perarnau:
Short Synchronizing Words for Random Automata. SODA 2023: 581-604 - 2022
- [j28]Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau:
Percolation on Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 36(1): 1-46 (2022) - [i21]Guillaume Chapuy, Guillem Perarnau:
Short Synchronizing Words for Random Automata. CoRR abs/2207.14108 (2022) - [i20]Alberto Espuny Díaz, Patrick Morris, Guillem Perarnau, Oriol Serra:
Speeding up random walk mixing by starting from a uniform vertex. CoRR abs/2208.07462 (2022) - 2021
- [j27]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. 30(3): 330-343 (2021) - [j26]Guillaume Chapuy, Guillem Perarnau:
On the Number of Coloured Triangulations of d-Manifolds. Discret. Comput. Geom. 65(3): 601-617 (2021) - [i19]Xing Shi Cai, Pietro Caputo, Guillem Perarnau, Matteo Quattropani:
Rankings in directed configuration models with heavy tailed in-degrees. CoRR abs/2104.08389 (2021) - 2020
- [j25]Louigi Addario-Berry, Borja Balle, Guillem Perarnau:
Diameter and Stationary Distribution of Random $r$-Out Digraphs. Electron. J. Comb. 27(3): 3 (2020) - [j24]Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois:
Two lower bounds for p-centered colorings. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j23]Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan:
Rainbow factors in hypergraphs. J. Comb. Theory A 172: 105184 (2020) - [j22]Michelle Delcourt, Marc Heinrich, Guillem Perarnau:
The Glauber dynamics for edge-colorings of trees. Random Struct. Algorithms 57(4): 1050-1076 (2020) - [j21]Matthew Coulson, Guillem Perarnau:
A Rainbow Dirac's Theorem. SIAM J. Discret. Math. 34(3): 1670-1692 (2020) - [i18]Xing Shi Cai, Guillem Perarnau:
The diameter of the directed configuration model. CoRR abs/2003.04965 (2020) - [i17]Xing Shi Cai, Guillem Perarnau:
The giant component of the directed configuration model revisited. CoRR abs/2004.04998 (2020) - [i16]Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois:
Two lower bounds for $p$-centered colorings. CoRR abs/2006.04113 (2020) - [i15]Xing Shi Cai, Guillem Perarnau:
Minimum stationary values of sparse random directed graphs. CoRR abs/2010.07246 (2020)
2010 – 2019
- 2019
- [j20]Guillaume Chapuy, Guillem Perarnau:
Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture. J. Comb. Theory B 136: 44-71 (2019) - [j19]Matthew Coulson, Guillem Perarnau:
Rainbow matchings in Dirac bipartite graphs. Random Struct. Algorithms 55(2): 271-289 (2019) - [c7]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Preface. BCC 2019: vii-viii - [c6]Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle:
Improved Bounds for Randomly Sampling Colorings via Linear Programming. SODA 2019: 2216-2234 - [e1]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019. Cambridge University Press 2019, ISBN 978-1-108-74072-2 [contents] - 2018
- [j18]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. 68: 167-172 (2018) - [j17]Guillem Perarnau, Will Perkins:
Counting independent sets in cubic graphs of given girth. J. Comb. Theory B 133: 211-242 (2018) - [i14]Michelle Delcourt, Guillem Perarnau, Luke Postle:
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. CoRR abs/1804.04025 (2018) - [i13]Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle:
Improved Bounds for Randomly Sampling Colorings via Linear Programming. CoRR abs/1810.12980 (2018) - [i12]Michelle Delcourt, Marc Heinrich, Guillem Perarnau:
The Glauber dynamics for edges colourings of trees. CoRR abs/1812.05577 (2018) - 2017
- [j16]Guillem Perarnau, Bruce A. Reed:
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. 26(3): 448-467 (2017) - [j15]Pilar Cano, Guillem Perarnau, Oriol Serra:
Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. Electron. Notes Discret. Math. 61: 199-205 (2017) - [j14]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50(4): 511-533 (2017) - [j13]Dieter Mitsche, Guillem Perarnau:
On Treewidth and Related Parameters of Random Geometric Graphs. SIAM J. Discret. Math. 31(2): 1328-1354 (2017) - 2016
- [j12]Guillem Perarnau, Oriol Serra:
Correlation Among Runners and Some Results on the Lonely Runner Conjecture. Electron. J. Comb. 23(1): 1 (2016) - [j11]Nicolas Bousquet, Guillem Perarnau:
Fast recoloring of sparse graphs. Eur. J. Comb. 52: 1-11 (2016) - [j10]Pilar Cano, Guillem Perarnau, Oriol Serra:
Rainbow perfect matchings in r-partite graph structures. Electron. Notes Discret. Math. 54: 193-198 (2016) - [c5]Guillaume Chapuy, Guillem Perarnau:
Local Convergence and Stability of Tight Bridge-Addable Graph Classes. APPROX-RANDOM 2016: 26:1-26:11 - [c4]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS 2016: 695-703 - [c3]Guillaume Chapuy, Guillem Perarnau:
Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture. SODA 2016: 1580-1588 - [i11]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to determine if a random graph with a fixed degree sequence has a giant component. CoRR abs/1601.03714 (2016) - [i10]Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau:
Percolation on random graphs with a fixed degree sequence. CoRR abs/1611.08496 (2016) - 2015
- [j9]Ross J. Kang, Guillem Perarnau:
Decomposition of bounded degree graphs into C4-free subgraphs. Eur. J. Comb. 44: 99-105 (2015) - [j8]Florent Foucaud, Michael Krivelevich, Guillem Perarnau:
Large Subgraphs without Short Cycles. SIAM J. Discret. Math. 29(1): 65-78 (2015) - [i9]Louigi Addario-Berry, Borja Balle, Guillem Perarnau:
Diameter and Stationary Distribution of Random $r$-out Digraphs. CoRR abs/1504.06840 (2015) - 2014
- [j7]Guillem Perarnau, Oriol Serra:
On the tree-depth of random graphs. Discret. Appl. Math. 168: 119-126 (2014) - [i8]Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez:
On the relation between graph distance and Euclidean distance in random geometric graphs. CoRR abs/1404.4757 (2014) - [i7]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. CoRR abs/1411.3047 (2014) - [i6]Nicolas Bousquet, Guillem Perarnau:
Fast Recoloring of Sparse Graphs. CoRR abs/1411.6997 (2014) - 2013
- [j6]Guillem Perarnau, Giorgis Petridis:
Matchings in Random Biregular Bipartite Graphs. Electron. J. Comb. 20(1): 60 (2013) - [j5]Guillem Perarnau, Oriol Serra:
Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting. Comb. Probab. Comput. 22(5): 783-799 (2013) - [j4]Guillem Perarnau:
A probabilistic approach to consecutive pattern avoiding in permutations. J. Comb. Theory A 120(5): 998-1011 (2013) - [i5]Florent Foucaud, Guillem Perarnau, Oriol Serra:
Random subgraphs make identification affordable. CoRR abs/1306.0819 (2013) - 2012
- [j3]Florent Foucaud, Guillem Perarnau:
Bounds for Identifying Codes in Terms of Degree Parameters. Electron. J. Comb. 19(1): 32 (2012) - [j2]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. Discret. Math. 312(10): 1832-1837 (2012) - [c2]Dieter Mitsche, Guillem Perarnau:
On the treewidth and related parameters of random geometric graphs. STACS 2012: 408-419 - 2011
- [j1]Guillem Perarnau, Oriol Serra:
Rainbow Matchings: existence and counting. Electron. Notes Discret. Math. 38: 711-716 (2011) - [i4]Florent Foucaud, Guillem Perarnau:
Bounds for identifying codes in terms of degree parameters. CoRR abs/1103.3756 (2011) - [i3]Guillem Perarnau, Oriol Serra:
On the tree-depth of Random Graphs. CoRR abs/1104.2132 (2011) - [i2]Guillem Perarnau, Oriol Serra:
Rainbow Matchings: existence and counting. CoRR abs/1104.2702 (2011) - [i1]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. CoRR abs/1108.2769 (2011) - 2010
- [c1]Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Julian Pfeifle, Victor Muntés-Mulero:
Overlapping Community Search for social networks. ICDE 2010: 992-995
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-19 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
