The following pages link to Stephane Durocher (Q181833):
Displayed 40 items.
- The Hausdorff core problem on simple polygons (Q2968107) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
- Range Majority in Constant Time and Linear Space (Q3012810) (← links)
- Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order (Q3111650) (← links)
- Hamiltonian Paths and Cycles in Planar Graphs (Q3167351) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- Competitive Online Routing on Delaunay Triangulations (Q3188885) (← links)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942) (← links)
- Balancing Traffic Load Using One-Turn Rectilinear Routing (Q3502670) (← links)
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES (Q3520427) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190) (← links)
- Untangled Monotonic Chains and Adaptive Range Search (Q3652206) (← links)
- Reconstructing Polygons from Scanner Data (Q3652273) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- (Q4598142) (← links)
- Competitive Online Routing on Delaunay Triangulations (Q4605336) (← links)
- On Combinatorial Depth Measures (Q4631012) (← links)
- Robust Nonparametric Data Approximation of Point Sets via Data Reduction (Q4909549) (← links)
- On Graphs That Are Not PCGs (Q4914459) (← links)
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane (Q4924647) (← links)
- Local Routing in Convex Subdivisions (Q5149568) (← links)
- Indexed Geometric Jumbled Pattern Matching (Q5165597) (← links)
- Bounding the locality of distributed routing algorithms (Q5170322) (← links)
- Local Routing in Convex Subdivisions (Q5175100) (← links)
- Faster Optimal Algorithms for Segment Minimization with Small Maximal Value (Q5199233) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- Kinetic Maintenance of Mobile k-Centres on Trees (Q5387769) (← links)
- Drawing HV-Restricted Planar Graphs (Q5405036) (← links)
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks (Q5445787) (← links)
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION (Q5485790) (← links)
- The projection median as a weighted average (Q5745386) (← links)
- Drawing Planar Graphs with Reduced Height (Q5892031) (← links)
- Drawing Planar Graphs with Reduced Height (Q5892364) (← links)
- The rectilinear crossing number of \(K_{10}\) is 62 (Q5934081) (← links)
- (Q6059187) (← links)
- Minimum ply covering of points with unit squares (Q6091141) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon (Q6179409) (← links)
- Cops and Robbers on 1-Planar Graphs (Q6449668) (← links)
