The following pages link to David G. Kirkpatrick (Q489752):
Displaying 50 items.
- Computational aspects of M. C. Escher's ribbon patterns (Q489754) (← links)
- (Q742416) (redirect page) (← links)
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience (Q742417) (← links)
- A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
- Fast detection of polyhedral intersection (Q759483) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- On pseudosimilarity in trees (Q791542) (← links)
- Parallel algorithms for fractional and maximal independent sets in planar graphs (Q913519) (← links)
- (Q919824) (redirect page) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- The projection median of a set of points (Q1025289) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- A note on f-factors in directed and undirected multigraphs (Q1076696) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- On generalized matching problems (Q1149783) (← links)
- A note on Delaunay and optimal triangulations (Q1151398) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Polygonal intersection searching (Q1165007) (← links)
- Quantitative Steinitz's theorems with applications to multifingered grasping (Q1182994) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Forest embeddings in regular graphs of large girth (Q1252244) (← links)
- Unit disk graph recognition is NP-hard (Q1384186) (← links)
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592) (← links)
- Pseudo approximation algorithms with applications to optimal motion planning (Q1424321) (← links)
- Generalizing ham sandwich cuts to equitable subdivisions (Q1591052) (← links)
- Simplifying analyses of chemical reaction networks for approximate majority (Q1694434) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Parallel construction of binary trees with near optimal weighted path length (Q1907235) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- Determining bar-representability for ordered weighted graphs (Q1917046) (← links)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Equitable subdivisions within polygonal regions (Q2489545) (← links)
- (Q2753927) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems (Q2842143) (← links)
- Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 (Q2848968) (← links)
- $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (Q2922595) (← links)
- (Q2934670) (← links)
- Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ (Q2944535) (← links)
- On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case (Q2945663) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- On the Complexity of General Graph Factor Problems (Q3038617) (← links)
- (Q3044349) (← links)
- Can Nearest Neighbor Searching Be Simple and Always Fast? (Q3092219) (← links)
- Input-Thrifty Extrema Testing (Q3104656) (← links)
