Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.”10.1109/LICS52264.2021.9470595__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.

Bhattacharya, Sayan, et al. “Deterministic Dynamic Matching in O(1) Update Time.”10.1007/s00453-019-00630-4__Algorithmica, vol. 82, no. 4, Springer Nature, 2020, pp. 1057–80, doi:10.1007/s00453-019-00630-4.

Dvoák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.”10.1007/s00453-015-0066-y__Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y.

Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.”10.1145/2818357__ACM Transactions on Economics and Computation, vol. 4, no. 1, 2, Association for Computing Machinery, 2015, doi:10.1145/2818357.

Henzinger, Monika H., et al. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.”10.1007/pl00009268__Algorithmica, vol. 24, Springer Nature, 1999, pp. 1–13, doi:10.1007/pl00009268.