Homepage
Xavier Pérez Giménez
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 309
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone: +49 681 9325 109
Fax: +49 681 9325 199
- Random structures
- Probabilistic method
- Graph theory
- Asymptotic enumeration
- Asymptotic enumeration of strongly connected digraphs by vertices and edges (with N. Wormald). Submitted, 2010.
- Disjoint Hamilton cycles in the random geometric graph (with T. Müller and N. Wormald). Submitted, 2009.
- On the chromatic number of random d-regular graphs (with G. Kemkes and N. Wormald). Advances in Mathematics, 223(1):300-328, 2010.
- On the satisfiability threshold of formulas with three literals per clause (with J. Díaz, L. Kirousis and D. Mitsche). Theoretical Computer Science, 410(30-32):2920-2934, 2009.
- Large connectivity for dynamic random geometric graphs (with J. Díaz and D. Mitsche). IEEE Transactions on Mobile Computing, 8(6):821-835, 2009.
- On the probability of the existence of fixed-size components in random geometric graphs (with J. Díaz and D. Mitsche). Advances in Applied Probability, 41(2):344-357, 2009.
- On the chromatic number of a random 5-regular graph (with J. Díaz, A.C. Kaporis, G.D. Kemkes, L.M. Kirousis and N.Wormald). Journal of Graph Theory, 61(3):157-191, 2009.
- A new upper bound for 3-SAT (with J. Díaz, L. Kirousis and D. Mitsche). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'08), volume 08004 of Dagstuhl Seminar Proceedings, pages 353-364. Internationales Begegnungs- und Forschungszentrum fuer Informatik, 2008.
- Walkers on the cycle and the grid (with J. Díaz, M. J. Serna and N. C. Wormald). SIAM Journal on Discrete Mathematics, 22(2):747-775, 2008.
- On the connectivity of dynamic random geometric graphs (with J. Díaz and D. Mitsche). In 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), pages 601-610, 2008.
- Sharp threshold for hamiltonicity of random geometric graphs (with J. Díaz and D. Mitsche). SIAM Journal on Discrete Mathematics, 21(1):57-65, 2007.
- Walkers on the cycle and the grid (with J. Díaz, M. J. Serna and N. C. Wormald). Research Report CORR 2006-09, Faculty of Mathematics, University of Waterloo, 2006.
- Partitioning networks into classes of mutually isolated nodes (with J. Díaz, A. Kaporis and L. Kirousis). In European Conference on Complex Systems, 2005.
- 5-regular graphs are 3-colorable with positive probability (with J. Díaz, G. Grammatikopoulos, A. Kaporis, L. Kirousis and D. G. Sotiropoulos). In 13th Annual European Symposium on Algorithms (ESA'05), volume 3669 of Lecture Notes in Computer Science, pages 215-225. Springer, 2005.
- Empirical analysis of the connectivity threshold of mobile agents on the grid. In 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), volume 3503 of Lecture Notes in Computer Science, pages 253-264. Springer, 2005.
- Connectivity for wireless agents moving on a cycle or grid (with J. Díaz, M. J. Serna and N. C. Wormald). In 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), volume 3404 of Lecture Notes in Computer Science, pages 353-364. Springer, 2005.
- October 2010 - present:
Postdoctoral position at the Max-Planck-Institut für Informatik
- September 2008 - August 2010:
Postdoctoral fellowship at the University of Waterloo (Canada)
- September 2002 - July 2007:
Ph. D. in Mathematics at the Universitat Politècnica de Catalunya (Spain)
- September 1997 - July 2002:
Degree in Mathematics at the Universitat Politècnica de Catalunya (Spain)
Hobbies
- Outdoors: fishing, canoeing, snorkel/scuba diving, rock climbing, sailing, mountaneering, slacklining...
- Swing dancing
- Languages
- ...
