Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/FOCS52979.2021.00075__In 62nd Annual IEEE Symposium on Foundations of Computer Science, 2022:720–26. IEEE, 2022.https://doi.org/10.1109/FOCS52979.2021.00075 .

Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”https://doi.org/10.1109/FOCS54457.2022.00091__In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022.https://doi.org/10.1109/FOCS54457.2022.00091 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.”https://doi.org/10.1109/focs.2014.24__In 55th Annual Symposium on Foundations of Computer Science, 146–55. Institute of Electrical and Electronics Engineers, 2014.https://doi.org/10.1109/focs.2014.24 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.”https://doi.org/10.1109/focs.2013.64__In 54th Annual Symposium on Foundations of Computer Science, 538–47. Institute of Electrical and Electronics Engineers, 2013.https://doi.org/10.1109/focs.2013.64 .

Agarwal, P. K., D. EppsteinL. J. Guibas, and Monika H Henzinger. “Parametric and Kinetic Minimum Spanning Trees.”https://doi.org/10.1109/SFCS.1998.743510__In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 596–605, 1998.https://doi.org/10.1109/SFCS.1998.743510 .

Henzinger, Monika H, and V. King. “Fully Dynamic Biconnectivity and Transitive Closure.”https://doi.org/10.1109/SFCS.1995.492668__In Proceedings of IEEE 36th Annual Foundations of Computer Science, 664–72. Institute of Electrical and Electronics Engineers, 1995.https://doi.org/10.1109/SFCS.1995.492668 .

Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra.” In Proceedings of IEEE 36th Annual Foundations of Computer Science, 248–57. IEEE, 1995.

Henzinger, Monika H, Thomas A Henzinger, and Peter Kopke. “Computing Simulations on Finite and Infinite Graphs.”https://doi.org/10.1109/SFCS.1995.492576__In Proceedings of IEEE 36th Annual Foundations of Computer Science, 453–62. IEEE, 1995.https://doi.org/10.1109/SFCS.1995.492576 .

Edelsbrunner, Herbert, János Pach, Jacob Schwartz, and Micha Sharir. “On the Lower Envelope of Bivariate Functions and Its Applications.”https://doi.org/10.1109/SFCS.1987.44__In 28th Annual Symposium on Foundations of Computer Science , 27–37. IEEE, 1987.https://doi.org/10.1109/SFCS.1987.44 .