Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”10.1016/j.tcs.2023.114353__Theoretical Computer Science, vol. 989, 114353, Elsevier, 2024, doi:10.1016/j.tcs.2023.114353.

Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.”10.1007/s00454-022-00431-7__Discrete &; Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7.

Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.”10.1007/s00446-022-00439-5__Distributed Computing, vol. 36, Springer Nature, 2023, pp. 29–43, doi:10.1007/s00446-022-00439-5.

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1145/3585391__Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.

Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.”10.1017/fms.2021.80__Forum of Mathematics, Sigma, vol. 10, e4, Cambridge University Press, 2022, doi:10.1017/fms.2021.80.

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.”10.1007/s00454-022-00436-2__Discrete &; Computational Geometry, vol. 68, no. 4, Springer Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2.

Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.”10.1017/fms.2022.86__Forum of Mathematics, Sigma, vol. 10, e96, Cambridge University Press, 2022, doi:10.1017/fms.2022.86.

Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.”10.37236/10794__The Electronic Journal of Combinatorics, vol. 29, no. 4, .13, The Electronic Journal of Combinatorics, 2022, doi:10.37236/10794.

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.”10.1007/s00454-021-00299-z__Discrete &; Computational Geometry, vol. 66, no. 3, Springer Nature, 2021, pp. 1202–16, doi:10.1007/s00454-021-00299-z.

Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.”10.1007/s00454-020-00250-8__Discrete &; Computational Geometry, vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:10.1007/s00454-020-00250-8.

Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.”10.1145/3274662__ACM Journal of Experimental Algorithmics, vol. 23, Association for Computing Machinery, 2018, pp. 1–22, doi:10.1145/3274662.

Kaloshin, Vadim, and Mark Levi. “Geometry of Arnold Diffusion.”10.1137/070703235__SIAM Review, vol. 50, no. 4, Society for Industrial &; Applied Mathematics, 2008, pp. 702–20, doi:10.1137/070703235.