Xavier Pérez-Giménez

Orcid: 0000-0002-7969-1136

Affiliations:
  • University of Nebraska-Lincoln, USA


According to our database1, Xavier Pérez-Giménez authored at least 35 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Rainbow Hamilton cycles in random geometric graphs.
Random Struct. Algorithms, July, 2024

2023
The Phase Transition of Discrepancy in Random Hypergraphs.
SIAM J. Discret. Math., September, 2023

2021
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness.
Eur. J. Comb., 2021

2020
On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph.
Electron. J. Comb., 2020

2019
Perfect matchings and Hamiltonian cycles in the preferential attachment model.
Random Struct. Algorithms, 2019

2018
Arboricity and spanning-tree packing in random graphs.
Random Struct. Algorithms, 2018

Subhypergraphs in non-uniform random hypergraphs.
Internet Math., 2018

Randomly twisted hypercubes.
Eur. J. Comb., 2018

The robot crawler graph process.
Discret. Appl. Math., 2018

2017
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
Random Struct. Algorithms, 2017

The Game of Overprescribed Cops and Robbers Played on Graphs.
Graphs Comb., 2017

2016
A probabilistic version of the game of Zombies and Survivors on graphs.
Theor. Comput. Sci., 2016

The Bondage Number of Random Graphs.
Electron. J. Comb., 2016

Subgraphs in Non-uniform Random Hypergraphs.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015
Randomized Rumour Spreading: The Effect of the Network Topology.
Comb. Probab. Comput., 2015

Strong-majority bootstrap percolation on regular graphs with low dissemination threshold.
CoRR, 2015

On-line List Colouring of Random Graphs.
Electron. J. Comb., 2015

The Robot Crawler Number of a Graph.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

The Domination Number of On-line Social Networks and Random Geometric Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2015

2014
On the relation between graph distance and Euclidean distance in random geometric graphs.
CoRR, 2014

Arboricity and spanning-tree packing in random graphs with an application to load balancing.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Asymptotic enumeration of strongly connected digraphs by vertices and edges.
Random Struct. Algorithms, 2013

2011
Disjoint Hamilton cycles in the random geometric graph.
J. Graph Theory, 2011

2009
Large Connectivity for Dynamic Random Geometric Graphs.
IEEE Trans. Mob. Comput., 2009

On the satisfiability threshold of formulas with three literals per clause.
Theor. Comput. Sci., 2009

On the chromatic number of a random 5-regular graph.
J. Graph Theory, 2009

2008
Walkers on the Cycle and the Grid.
SIAM J. Discret. Math., 2008

On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
CoRR, 2008

On the connectivity of dynamic random geometric graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A new upper bound for 3-SAT.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007
Sharp Threshold for Hamiltonicity of Random Geometric Graphs.
SIAM J. Discret. Math., 2007

Dynamic Random Geometric Graphs
CoRR, 2007

2005
Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Connectivity for Wireless Agents Moving on a Cycle or Grid.
Proceedings of the STACS 2005, 2005

5-Regular Graphs are 3-Colorable with Positive Probability.
Proceedings of the Algorithms, 2005


  Loading...