Kyle Fox

Orcid: 0000-0002-2446-8594

According to our database1, Kyle Fox authored at least 39 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Minimum Cut and Minimum <i>k</i>-Cut in Hypergraphs via Branching Contractions.
ACM Trans. Algorithms, April, 2023

Minimum Cuts in Surface Graphs.
SIAM J. Comput., February, 2023

2022
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread.
J. Comput. Geom., 2022

A deterministic near-linear time approximation scheme for geometric transportation.
CoRR, 2022

Approximating the Geometric Edit Distance.
Algorithmica, 2022

Computation of Cycle Bases in Surface Embedded Graphs.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Clustering with Faulty Centers.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Approximating the (Continuous) Fréchet Distance.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Trajectory planning for an articulated probe.
Comput. Geom., 2020

2019
Geometric Optimization Revisited.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

A near-linear time approximation scheme for geometric transportation with real supplies.
CoRR, 2019

Non-clairvoyantly Scheduling to Minimize Convex Functions.
Algorithmica, 2019

Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Energy efficient scheduling of parallelizable jobs.
Theor. Comput. Sci., 2018

An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles.
ACM Trans. Algorithms, 2018

Computing the Gromov-Hausdorff Distance for Metric Trees.
ACM Trans. Algorithms, 2018

Holiest minimum-cost paths and flows in surface graphs.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Subtrajectory Clustering: Models and Algorithms.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2017
Minimum cycle and homology bases of surface-embedded graphs.
J. Comput. Geom., 2017

Maintaining Reeb Graphs of Triangulated 2-Manifolds.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Faster Algorithms for the Geometric Transportation Problem.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Global Minimum Cuts in Surface-Embedded Graphs.
Encyclopedia of Algorithms, 2016

Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

A simple efficient approximation algorithm for dynamic time warping.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs.
Discret. Comput. Geom., 2014

Packet Forwarding Algorithms in a Line Network.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Weighted Flowtime on Capacitated Machines.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Counting and sampling minimum cuts in genus g graphs.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Global minimum cuts in surface embedded graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

An Application of System Health Management Theory for a Simple Sun Pointed Space Vehicle.
Proceedings of the Infotech@Aerospace 2012, 2012

2011
Faster Shortest Non-contractible Cycles in Directed Surface Graphs
CoRR, 2011

Upper Bounds for Maximally Greedy Binary Search Trees.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Online Scheduling on Identical Machines using SRPT.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011


  Loading...