The following pages link to Kyle Fox (Q471137):
Displayed 32 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- Geometric optimization revisited (Q2075763) (← links)
- Approximating the geometric edit distance (Q2165024) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions (Q2851854) (← links)
- A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (Q2941581) (← links)
- Minimum cycle and homology bases of surface-embedded graphs (Q2970476) (← links)
- Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences (Q3132838) (← links)
- Computing the Gromov-Hausdorff Distance for Metric Trees (Q3459891) (← links)
- An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (Q4575663) (← links)
- (Q4580079) (← links)
- An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (Q4629959) (← links)
- (Q5136297) (← links)
- Counting and sampling minimum cuts in genus g graphs (Q5174485) (← links)
- Upper Bounds for Maximally Greedy Binary Search Trees (Q5199261) (← links)
- Holiest minimum-cost paths and flows in surface graphs (Q5230385) (← links)
- Minimum Cut and Minimum <i>k</i>-Cut in Hypergraphs via Branching Contractions (Q5236238) (← links)
- (Q5365026) (← links)
- (Q5413467) (← links)
- Weighted Flowtime on Capacitated Machines (Q5741718) (← links)
- Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs (Q5741734) (← links)
- Energy Efficient Scheduling of Parallelizable Jobs (Q5741776) (← links)
- (Q5743478) (← links)
- (Q5875584) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- (Q6059996) (← links)
- Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions (Q6075748) (← links)
- (Q6104070) (← links)
- (Q6187842) (← links)