Chatterjee K, Doyen L. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 2022;129:1-21. doi:10.1016/j.jcss.2022.04.003
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 . Bidding mechanisms in graph games. Journal of Computer and System Sciences. 2021;119(8):133-144. doi:10.1016/j.jcss.2021.02.008
LibreCat: https://research-explorer.ista.ac.at/record/9239
DOI: 10.1016/j.jcss.2021.02.008
WoS: 000634149800009
arXiv: 1905.03835

Henzinger MH, Leonardi S. Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences. 2003;66(3):567-611. doi:10.1016/s0022-0000(03)00043-6
LibreCat: https://research-explorer.ista.ac.at/record/11766
DOI: 10.1016/s0022-0000(03)00043-6

Henzinger MH, Klein P, Rao S, Subramanian S. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences. 1997;55(1):3-23. doi:10.1006/jcss.1997.1493
LibreCat: https://research-explorer.ista.ac.at/record/11767
DOI: 10.1006/jcss.1997.1493

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

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