The following pages link to Nicolas Hanusse (Q265064):
Displaying 27 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)
- Plane Spanners of Maximum Degree Six (Q3587366) (← links)
- Euler Tour Lock-In Problem in the Rotor-Router Model (Q3646241) (← links)
- (Q4418676) (← links)
- (Q4525052) (← links)
- An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps (Q4900004) (← links)
- Skycube Materialization Using the Topmost Skyline or Functional Dependencies (Q5012569) (← links)
- A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation (Q5045449) (← links)
- Locating a target with an agent guided by unreliable local advice (Q5176212) (← links)
- STACS 2004 (Q5309731) (← links)
- Non-searchability of random scale-free graphs (Q5401475) (← links)
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings (Q5464194) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710808) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902512) (← links)
- Framing algorithms for approximate multicriteria shortest paths (Q6587171) (← links)
