Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation
S. Schmid, J. Svoboda, M.X. Yeo, Theoretical Computer Science 989 (2024).

Long-lived counters with polylogarithmic amortized step complexity
M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023) 29–43.

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

Local criteria for triangulating general manifolds
J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete &; Computational Geometry 69 (2023) 156–191.

Loose cores and cycles in random hypergraphs
O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).

Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk
S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022).

Rank-uniform local law for Wigner matrices
G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).

Connectivity of triangulation flip graphs in the plane
U. Wagner, E. Welzl, Discrete &; Computational Geometry 68 (2022) 1227–1284.

Vanishing of all equivariant obstructions and the mapping degree
S. Avvakumov, S. Kudrya, Discrete &; Computational Geometry 66 (2021) 1202–1216.

Triangulating submanifolds: An elementary and quantified version of Whitney’s method
J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete &; Computational Geometry 66 (2021) 386–434.

Practical minimum cut algorithms
M. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22.

Geometry of Arnold diffusion
V. Kaloshin, M. Levi, SIAM Review 50 (2008) 702–720.