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

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

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

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

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

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