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