Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.
LibreCat: https://research-explorer.ista.ac.at/record/11402
DOI: 10.1016/j.jcss.2022.04.003
WoS: 000805002800001
arXiv: 1802.03642

Avni G, Henzinger TA, dikeli . 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.
LibreCat: https://research-explorer.ista.ac.at/record/9239
DOI: 10.1016/j.jcss.2021.02.008
WoS: 000634149800009
arXiv: 1905.03835

Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences. 42(2), 249–251.
LibreCat: https://research-explorer.ista.ac.at/record/4057
DOI: 10.1016/0022-0000(91)90013-U

Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.
LibreCat: https://research-explorer.ista.ac.at/record/4082
DOI: 10.1016/0022-0000(89)90038-X