default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyle Fox
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52(1): 156-195 (2023)- [j10]Kyle Fox
, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. ACM Trans. Algorithms 19(2): 13:1-13:22 (2023) - 2022
- [j9]Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. Algorithmica 84(9): 2395-2413 (2022) - [j8]Kyle Fox, Jiashuai Lu:
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread. J. Comput. Geom. 13(1): 204-225 (2022) - [c30]Kyle Fox, Hongyao Huang, Benjamin Raichel:
Clustering with Faulty Centers. ISAAC 2022: 10:1-10:14 - [c29]Kyle Fox, Thomas Stanley:
Computation of Cycle Bases in Surface Embedded Graphs. ISAAC 2022: 13:1-13:13 - [i15]Kyle Fox, Jiashuai Lu:
A deterministic near-linear time approximation scheme for geometric transportation. CoRR abs/2211.03891 (2022) - 2021
- [c28]Connor Colombe, Kyle Fox:
Approximating the (Continuous) Fréchet Distance. SoCG 2021: 26:1-26:14 - [c27]Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes:
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. ISAAC 2021: 72:1-72:16 - 2020
- [j7]Ka Yaw Teo, Ovidiu Daescu, Kyle Fox:
Trajectory planning for an articulated probe. Comput. Geom. 90: 101655 (2020) - [c26]Kyle Fox, Jiashuai Lu:
A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread. SoCG 2020: 45:1-45:18 - [i14]Connor Colombe, Kyle Fox:
Approximating the (continuous) Fréchet distance. CoRR abs/2007.07994 (2020)
2010 – 2019
- 2019
- [j6]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Non-clairvoyantly Scheduling to Minimize Convex Functions. Algorithmica 81(9): 3746-3764 (2019) - [c25]Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. ISAAC 2019: 23:1-23:16 - [c24]Kyle Fox, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. SODA 2019: 881-896 - [p1]Pankaj K. Agarwal, Esther Ezra, Kyle Fox:
Geometric Optimization Revisited. Computing and Software Science 2019: 66-84 - [i13]Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. CoRR abs/1903.08263 (2019) - [i12]Kyle Fox, Jiashuai Lu:
A near-linear time approximation scheme for geometric transportation with real supplies. CoRR abs/1907.04426 (2019) - [i11]Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. CoRR abs/1910.00773 (2019) - [i10]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. CoRR abs/1910.04278 (2019) - 2018
- [j5]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. ACM Trans. Algorithms 14(2): 24:1-24:20 (2018) - [j4]Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. ACM Trans. Algorithms 14(4): 46:1-46:21 (2018) - [j3]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726: 30-40 (2018) - [c23]Ovidiu Daescu, Kyle Fox, Ka Yaw Teo:
Trajectory Planning for an Articulated Probe. CCCG 2018: 296-303 - [c22]Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath, Jiangwei Pan, Erin Taylor:
Subtrajectory Clustering: Models and Algorithms. PODS 2018: 75-87 - [c21]Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren:
Holiest minimum-cost paths and flows in surface graphs. STOC 2018: 1319-1332 - [i9]Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren:
Holiest Minimum-Cost Paths and Flows in Surface Graphs. CoRR abs/1804.01045 (2018) - 2017
- [j2]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface-embedded graphs. J. Comput. Geom. 8(2): 58-79 (2017) - [c20]Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. SoCG 2017: 7:1-7:16 - [c19]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath:
Maintaining Reeb Graphs of Triangulated 2-Manifolds. FSTTCS 2017: 8:1-8:14 - [i8]Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. CoRR abs/1706.02939 (2017) - 2016
- [c18]Pankaj K. Agarwal, Kyle Fox, Jiangwei Pan, Rex Ying:
Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences. SoCG 2016: 6:1-6:16 - [c17]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum Cycle and Homology Bases of Surface Embedded Graphs. SoCG 2016: 23:1-23:15 - [c16]Rex Ying, Jiangwei Pan, Kyle Fox, Pankaj K. Agarwal:
A simple efficient approximation algorithm for dynamic time warping. SIGSPATIAL/GIS 2016: 21:1-21:10 - [c15]Abhinandan Nath, Kyle Fox, Kamesh Munagala, Pankaj K. Agarwal:
Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains. SIGSPATIAL/GIS 2016: 25:1-25:10 - [c14]Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath:
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures. PODS 2016: 429-440 - [c13]Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. SODA 2016: 1179-1192 - [r1]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global Minimum Cuts in Surface-Embedded Graphs. Encyclopedia of Algorithms 2016: 852-856 - [i7]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface embedded graphs. CoRR abs/1607.05112 (2016) - 2015
- [c12]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. ISAAC 2015: 529-540 - [c11]Kyle Fox, Philip N. Klein, Shay Mozes:
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. STOC 2015: 841-850 - [i6]Kyle Fox, Philip N. Klein, Shay Mozes:
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. CoRR abs/1504.08008 (2015) - [i5]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. CoRR abs/1509.05751 (2015) - [i4]Pankaj K. Agarwal, Kyle Fox, Jiangwei Pan, Rex Ying:
Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences. CoRR abs/1512.01876 (2015) - 2014
- [j1]Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs. Discret. Comput. Geom. 52(3): 450-475 (2014) - [c10]Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network. LATIN 2014: 610-621 - 2013
- [c9]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. APPROX-RANDOM 2013: 142-157 - [c8]Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and sampling minimum cuts in genus g graphs. SoCG 2013: 249-258 - [c7]Kyle Fox, Madhukar Korupolu:
Weighted Flowtime on Capacitated Machines. SODA 2013: 129-143 - [c6]Kyle Fox:
Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs. SODA 2013: 352-364 - [c5]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy Efficient Scheduling of Parallelizable Jobs. SODA 2013: 948-957 - 2012
- [c4]Kyle Fox, Laurie Thiel:
An Application of System Health Management Theory for a Simple Sun Pointed Space Vehicle. Infotech@Aerospace 2012 - [c3]Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global minimum cuts in surface embedded graphs. SODA 2012: 1309-1318 - 2011
- [c2]Kyle Fox, Benjamin Moseley:
Online Scheduling on Identical Machines using SRPT. SODA 2011: 120-128 - [c1]Kyle Fox:
Upper Bounds for Maximally Greedy Binary Search Trees. WADS 2011: 411-422 - [i3]Kyle Fox:
Upper Bounds for Maximally Greedy Binary Search Trees. CoRR abs/1102.4884 (2011) - [i2]Kyle Fox:
Faster Shortest Non-contractible Cycles in Directed Surface Graphs. CoRR abs/1111.6990 (2011) - 2010
- [i1]Kyle Fox, Benjamin Moseley:
Online Scheduling on Identical Machines using SRPT. CoRR abs/1011.2187 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
