Guillem Perarnau School of Computer Science (McGill University) - PDF document

Guillem Perarnau School of Computer Science (McGill University) ◇ Office 311, McConnell Building ◇ 845 Sherbrooke Street West, Montreal (QC), Canada, H3A 0G4 H (514) 655-5992 ◇ B p.melliug@gmail.com ◇ http://cgi.cs.mcgill.ca/ � guillem/ POSITION Since October 2013, I am a Postdoctoral researcher at McGill University. RESEARCH INTERESTS Probabilistic and Extremal Combinatorics, Random Combinatorial Structures, Graph Colorings, Randomized Algorithm Analysis. EDUCATION PhD in Applied Mathematics 2010 – 2013 Department of Applied Mathematics IV (UPC-BarcelonaTech). Barcelona, Spain Thesis dissertation: Random Combinatorial Structures with low dependencies: existence and enumeration (click here to download it). Supervised by Oriol Serra. Master’s degree in Applied Mathematics 2009 – 2010 School of Mathematics and Statistics (UPC-Barcelona Tech). Barcelona, Spain Bachelor’s degree in mathematics 2004 – 2009 School of Mathematics and Statistics (UPC-Barcelona Tech). Barcelona, Spain FELLOWSHIPS AND AWARDS FPU PhD fellowship from the Spanish Ministry of Science 2011 – 2013 FPI-UPC PhD fellowship from the UPC-BarcelonaTECH 2009– 2011 CERMET Scholarship 2009 Scholarship for undergraduate research 2008 JOURNAL PUBLICATIONS Forthcoming ● F. Joos, G. Perarnau, D. Rautenbach and B. Reed. The giant component in random graphs with given degree sequence . In preparation. ● G. Chapuy and G. Perarnau. Connectivity in bridge-addable graph classes: the McDiarmid- Steger-Welsh conjecture . Submitted. ArXiv Preprint ● L. Addario-Berry, B. Balle and G. Perarnau. Diameter and Stationary Distribution of Random r -out Digraphs . Submitted. ArXiv Preprint ● X.S. Cai, G. Perarnau, B. Reed and A.B. Watts. Acyclic edge colourings of graphs with large girth . Submitted. ArXiv Preprint. Last updated: October 8, 2015 Guillem Perarnau, Page 1of 6

● G. Perarnau and O. Serra. Correlation among runners and some results on the Lonely Runner Conjecture . Submitted. ArXiv Preprint. ● G. Perarnau and B. Reed. Existence of spanning F-free subgraphs with large minimum degree . Submitted. ArXiv Preprint. ● J. Diaz, D. Mitsche, G. Perarnau and X. P´ erez-Gim´ enez. On the relation between graph distance and Euclidean distance in random geometric graphs . Submitted. ArXiv Preprint. ● F. Foucaud, G. Perarnau and O. Serra. Random subgraphs make identification affordable . Submitted. ArXiv Preprint. ● D. Mitsche and G. Perarnau. On the treewidth and related parameters of random geometric graphs . Submitted. Published ● N. Bousquet and G. Perarnau. Fast Recoloring of Sparse Graphs . European Journal of Combinatorics, 52(A):1–11, 2016. ArXiv Preprint. ● F. Foucaud, M. Krivelevich and G. Perarnau. Large subgraphs without short cycles . SIAM Journal of Discrete Mathematics 29(1):65-78, 2015. ArXiv Preprint. ● R. Kang and G. Perarnau. Decomposition of bounded degree graphs into C 4 -free subgraphs , European Journal of Combinatorics, 44(A):99-105, 2015. ArXiv Preprint. ● A. Abiad, M.A. Fiol, W.H. Haemers and G. Perarnau. An interlacing approach for bounding the sum of laplacian eigenvalues of graphs , Linear Algebra and its Applications, 448:1121, 2014. ArXiv Preprint. ● G. Perarnau and O. Serra. On the tree-depth of random graphs , Discrete Applied Mathematics, 168:119-126, 2014. ArXiv Preprint. ● G. Perarnau and O. Serra. Rainbow Perfect Matchings in Complete Bipartite Graphs: Exis- tence and Counting , Combinatorics, Probability and Computing, 22(5):783-799, 2013. ArXiv Preprint. ● G. Perarnau. A probabilistic approach to consecutive pattern avoiding in permutations , Journal of Combinatorial Theory, Series A, 120(5):998-1011, 2013. ArXiv Preprint. ● G. Perarnau and G. Petridis. Matchings in Random Biregular Bipartite Graphs , The Elec- tronic Journal of Combinatorics 20(1):P60, 2013. ArXiv Preprint. ● F. Foucaud, I. Honkala, T. Laihonen, A. Parreau and G. Perarnau. Locally identifying colour- ings for graphs with given maximum degree , Discrete Mathematics, 312(10):1832-1837, 2012. ArXiv Preprint. ● F. Foucaud and G. Perarnau. Bounds for identifying codes in terms of degree parameters , The Electronic Journal of Combinatorics 19(1):P32, 2012. ArXiv Preprint. CONFERENCE PUBLICATIONS ● G. Chapuy and G. Perarnau. Connectivity in bridge-addable graph classes: the McDiarmid- Steger-Welsh conjecture . To appear in SODA 2016. ● F. Foucaud, G. Perarnau and O. Serra. Random subgraphs make identification affordable ,The Seventh European Conference on Combinatorics, Graph Theory and Applications (EURO- COMB 2013) CRM Series Volume 16, pp 415-420. Pisa, Italy, 2013. Last updated: October 8, 2015 Guillem Perarnau, Page 2of 6

● A. Abiad, M.A. Fiol, W.H. Haemers and G. Perarnau. An interlacing approach for bounding the sum of laplacian eigenvalues of graphs , The Seventh European Conference on Combi- natorics, Graph Theory and Applications (EUROCOMB 2013) CRM Series Volume 16, pp 111-116. Pisa, Italy, 2013. ● G. Perarnau. A probabilistic approach to consecutive pattern avoiding in permutations , Actas de las VIII Jornadas de Matematica Discreta y Algoritmica, Editorial Universidad de Almeria, 2012, ISBN:978-84-15487-13-5. ● D. Mitsche and G. Perarnau. On the treewidth and related parameters of random geometric graphs , Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), 408-419, 2012. ● G. Perarnau and O. Serra. Rainbow matchings: existence and counting , Electronic Notes in Discrete Mathematics, 28 (2011), 711-716. Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2011), Budapest, Hungary, 2011. ● G. Perarnau and O. Serra. On the treedepth of random graphs ,Actas de las VII Jornadas de Matematica Discreta y Algoritmica, 2010, ISBN:978-84-693-3063-0, pp. 517-528. ● A. Padrol, G. Perarnau, J. Pfeifle and V. Munt´ es-Mulero. Overlapping Community Search for social networks . Proceedings of ICDE 2010, 992-995. OTHER PUBLICATIONS ● G. Perarnau, Random Combinatorial Structures with low dependencies: existence and enu- meration , PhD Thesis, 2013. ● G. Perarnau, Probabilistic methods and coloring problems in graphs , Msc Thesis, 2010. RESEARCH EXPERIENCE Talks in Conferences or Workshops ● Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture . RSA 2015. Pittsburgh 2015. ● Decomposition of bounded degree graphs into C 4 -free subgraphs . CanaDAM. Saskatoon 2015. ● Acyclic colorings of graph with large girth . Barcelona Mathematical Days 2014. Barcelona 2014. ● Existence of spanning F -free subgraphs with large minimum degree . Siam Conference on Dis- crete Math. Minneapolis 2014. ● Existence of spanning F -free subgraphs with large minimum degree . Workshop on Graphs and Algorithms. Toronto 2014. ● Large subgraphs without short cycles . Workshop on Probability and Graphs. Eindhoven 2014. ● Random subgraphs make identification affordable . EUROCOMB 2013. Pisa 2013. ● Random subgraphs make identification affordable . 16th International Conference in Random Structures and Algorithms. Bordeaux 2013. ● Matchings in Random Biregular Bipartite Graphs . Bordeaux Graph Workshop. Bordeaux 2012. Last updated: October 8, 2015 Guillem Perarnau, Page 3of 6