Seguir
Kyle Fox
Kyle Fox
Department of Computer Science, The University of Texas at Dallas
Email confirmado em utdallas.edu - Página inicial
Título
Citado por
Citado por
Ano
Computing the Gromov-Hausdorff distance for metric trees
PK Agarwal, K Fox, A Nath, A Sidiropoulos, Y Wang
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
522018
Online scheduling on identical machines using srpt
K Fox, B Moseley
22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 120-128, 2011
402011
Energy efficient scheduling of parallelizable jobs
K Fox, S Im, B Moseley
Theoretical Computer Science 726, 30-40, 2018
352018
Subtrajectory clustering: Models and algorithms
PK Agarwal, K Fox, K Munagala, A Nath, J Pan, E Taylor
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
302018
Parallel algorithms for constructing range and nearest-neighbor searching data structures
PK Agarwal, K Fox, K Munagala, A Nath
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016
292016
Approximating dynamic time warping and edit distance for a pair of point sequences
PK Agarwal, K Fox, J Pan, R Ying
arXiv preprint arXiv:1512.01876, 2015
262015
A unified platform for archival description and access
CJ Prom, CA Rishel, SW Schwartz, KJ Fox
Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries …, 2007
232007
An efficient algorithm for computing high-quality paths amid polygonal obstacles
PK Agarwal, K Fox, O Salzman
ACM Transactions on Algorithms (TALG) 14 (4), 1-21, 2018
222018
Global Minimum Cuts in Surface Embedded Graphs
J Erickson, K Fox, A Nayyeri
23rd Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
222012
Upper bounds for maximally greedy binary search trees
K Fox
Workshop on Algorithms and Data Structures, 411-422, 2011
222011
Faster algorithms for the geometric transportation problem
PK Agarwal, K Fox, D Panigrahi, KR Varadarajan, A Xiao
arXiv preprint arXiv:1903.08263, 2019
212019
Minimum cycle and homology bases of surface embedded graphs
G Borradaile, EW Chambers, K Fox, A Nayyeri
arXiv preprint arXiv:1607.05112, 2016
192016
Holiest minimum-cost paths and flows in surface graphs
J Erickson, K Fox, L Lkhamsuren
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
172018
Shortest non-trivial cycles in directed and undirected surface graphs
K Fox
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
172013
A simple efficient approximation algorithm for dynamic time warping
R Ying, J Pan, K Fox, PK Agarwal
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances …, 2016
162016
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions
K Fox, D Panigrahi, F Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
122019
Counting and Sampling Minimum Cuts in Genus g Graphs
EW Chambers, K Fox, A Nayyeri
Discrete & Computational Geometry 52 (3), 450-475, 2014
122014
Archon: A unified information storage and retrieval system for lone archivists, special collections librarians and curators
SW Schwartz, CJ Prom, CA Rishel, KJ Fox
Partnership: The Canadian Journal of Library and Information Practice and …, 2007
122007
Massively parallel algorithms for computing tin dems and contour trees for large terrains
A Nath, K Fox, PK Agarwal, K Munagala
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances …, 2016
112016
A polynomial-time bicriteria approximation scheme for planar bisection
K Fox, PN Klein, S Mozes
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
102015
O sistema não pode efectuar a operação agora. Tente novamente mais tarde.
Artigos 1–20