_id,doi,title
11145,10.1109/FOCS52979.2021.00075,List-decodability with large radius for Reed-Solomon codes
12432,10.1109/FOCS54457.2022.00091,Solving the Hamilton cycle problem fast on average
11855,10.1109/focs.2014.24,Decremental single-source shortest paths on undirected graphs in near-linear total update time
11856,10.1109/focs.2013.64,Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization
11682,10.1109/SFCS.1998.743510,Parametric and kinetic minimum spanning trees
11684,10.1109/SFCS.1995.492668,Fully dynamic biconnectivity and transitive closure
4034,,Algebraic decomposition of non-convex polyhedra
4498,10.1109/SFCS.1995.492576,Computing simulations on finite and infinite graphs
3514,10.1109/SFCS.1987.44,On the lower envelope of bivariate functions and its applications