activity
20062021
most citedApproximating Fixation Probabilities in the Generalized Moran Process

36 citations · 61 across the 14 of their papers we have counts for

collaborators
Showing 2006Show all

2 papers · 1 filter

cs.DS2006

Max-Cut and Max-Bisection are NP-hard on unit disk graphs

Josep Diaz, Marcin Kaminski

We prove that the Max-Cut and Max-Bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1 / \sqrt{2}$.

cs.DM2006

Sharp threshold for hamiltonicity of random geometric graphs

J. Diaz, D. Mitsche, X. Perez

We show for an arbitrary norm that the property that a random geometric graph contains a Hamiltonian cycle exhibits a sharp threshold at $r=r(n)=\sqrt{\f…