Schmid S, Svoboda J, Yeo MX. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. 2024;989. doi:10.1016/j.tcs.2023.114353

Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete &; Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7

Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 2023;36:29-43. doi:10.1007/s00446-022-00439-5

Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. 2023;35(2). doi:10.1145/3585391

Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2021.80

Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2

Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2022.86

Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 2022;29(4). doi:10.37236/10794

Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. Discrete &; Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z

Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete &; Computational Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8

Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 2018;23:1-22. doi:10.1145/3274662

Kaloshin V, Levi M. Geometry of Arnold diffusion. SIAM Review. 2008;50(4):702-720. doi:10.1137/070703235