Hello there

xkcd comic
Problems solved with algorithms (and other papers)

Brand, S., Coopmans, T., and Elkouss, D. "Efficient computation of the waiting time and fidelity in quantum repeater chains." IEEE Journal on Selected Areas in Communications (2020). arXiv
Coopmans, T., Brand, S., and Elkouss, D. "Improved analytical bounds on delivery times of long-distance entanglement." Physical Review A (2022). arXiv
Brand, S., Bäck, T. and Laarman, A. "A decision diagram operation for reachability." Formal Methods: 25th International Symposium (2023). arXiv
Rennela, M., Brand, S., Laarman, A., and Dunjko V. "Hybrid divide-and-conquer approach for tree search algorithms." Quantum (2023). arXiv
Brand, S., Coopmans, T., Laarman, A. "Quantum graph-state synthesis with SAT." 14th International Workshop on Pragmatics of SAT (2023). arXiv