Schmid, S., Svoboda, J., &; Yeo, M. X. (2024). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.114353 

Boissonnat, J.-D., Dyer, R., Ghosh, A., &; Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00431-7 

Baig, M. A., Hendler, D., Milani, A., &; Travers, C. (2023). Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. Springer Nature.https://doi.org/10.1007/s00446-022-00439-5 

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

Henheik, S. J., &; Teufel, S. (2022). Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. Cambridge University Press.https://doi.org/10.1017/fms.2021.80 

Wagner, U., &; Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00436-2 

Cipolloni, G., Erdös, L., &; Schröder, D. J. (2022). Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. Cambridge University Press.https://doi.org/10.1017/fms.2022.86 

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

Avvakumov, S., &; Kudrya, S. (2021). Vanishing of all equivariant obstructions and the mapping degree. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-021-00299-z 

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

Henzinger, M. H., Noe, A., Schulz, C., &; Strash, D. (2018). Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. Association for Computing Machinery.https://doi.org/10.1145/3274662 

Kaloshin, V., &; Levi, M. (2008). Geometry of Arnold diffusion. SIAM Review. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/070703235