The following pages link to Stephane Durocher (Q181833):
Displayed 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- The projection median of a set of points (Q1025289) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics (Q1868837) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- Faster optimal algorithms for segment minimization with small maximal value (Q1932452) (← links)
- A note on improving the performance of approximation algorithms for radiation therapy (Q1944893) (← links)
- Range majority in constant time and linear space (Q1951579) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Polygon simplification by minimizing convex corners (Q2272403) (← links)
- Integrated rank-weighted depth (Q2274931) (← links)
- Computing the \(k\)-crossing visibility region of a point in a polygon (Q2301732) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Low space data structures for geometric range mode query (Q2345452) (← links)
- Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Robustness and asymptotics of the projection median (Q2657192) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- A Note on Minimum-Segment Drawings of Planar Graphs (Q2838235) (← links)
- Plane 3-trees: Embeddability and Approximation (Q2842167) (← links)
- Revisiting the Problem of Searching on a Line (Q2849311) (← links)
- Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results (Q2849920) (← links)
- Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees (Q2849921) (← links)
- Thickness and Colorability of Geometric Graphs (Q2864305) (← links)
- On Balanced -Contact Representations (Q2867651) (← links)
- On the Hardness of Point-Set Embeddability (Q2889908) (← links)
- Linear-Space Data Structures for Range Minority Query in Arrays (Q2904565) (← links)
- (Q2904770) (← links)
- Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number (Q2914327) (← links)
- ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS (Q2932518) (← links)
- Trade-Offs in Planar Polyline Drawings (Q2936936) (← links)
- Guarding Monotone Art Galleries with Sliding Cameras in Linear Time (Q2942386) (← links)
- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees (Q2959779) (← links)