The following pages link to Pat Morin (Q223041):
Displaying 50 items.
- Approximating majority depth (Q364853) (← links)
- Crossings in grid drawings (Q405129) (← links)
- A distribution-sensitive dictionary with low space overhead (Q414433) (← links)
- Memoryless routing in convex subdivisions: random walks are optimal (Q419369) (← links)
- Skip lift: a probabilistic alternative to red-black trees (Q450539) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Ordered theta graphs (Q598550) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- A generalized Winternitz theorem (Q657008) (← links)
- More Turán-type theorems for triangles in convex point sets (Q668054) (← links)
- Oja centers and centers of gravity (Q691766) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Biased predecessor search (Q727976) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Geodesic ham-sandwich cuts (Q878384) (← links)
- Reconfiguring triangulations with edge flips and point moves (Q879960) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Towards tight bounds on theta-graphs: more is not always better (Q906396) (← links)
- Reprint of: Approximating majority depth (Q906835) (← links)
- Realizing partitions respecting full and partial order information (Q954955) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- Cuckoo hashing: Further analysis (Q1007604) (← links)
- Distinct distances in graph drawings (Q1010836) (← links)
- Rotationally monotone polygons (Q1025304) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Clamshell casting (Q1031870) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- Anagram-free chromatic number is not pathwidth-bounded (Q1627156) (← links)
- (Q1693319) (redirect page) (← links)
- A note on interference in random networks (Q1693320) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Asymmetric communication protocols via hotlink assignments (Q1762995) (← links)
- The geometry of carpentry and joinery (Q1765245) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
- Translating a regular grid over a point set (Q1873153) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- Testing the quality of manufactured disks and balls (Q1889589) (← links)
- Absolute approximation of Tukey depth: theory and experiments (Q1941220) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Geodesic obstacle representation of graphs (Q2096390) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Sigma-local graphs (Q2266933) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
