The following pages link to Nicolas Hanusse (Q265064):
Displaying 13 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- Memoryless search algorithms in a network with faulty advice (Q935471) (← links)
- Cacti, braids and complex polynomials (Q1380710) (← links)
- Searching with mobile agents in networks with liars. (Q1422406) (← links)
- Could any graph be turned into a small-world? (Q2368969) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Broadcast in the rendezvous model (Q2495650) (← links)
- Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations (Q2912842) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation (Q3104647) (← links)
- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation (Q3378515) (← links)
