Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6 Publications
2022 | Journal Article | IST-REx-ID: 11402 | 
Chatterjee, K., & Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2022.04.003
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9239 |
Avni, G., Henzinger, T. A., & Žikelić, Đ. (2021). Bidding mechanisms in graph games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2021.02.008
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2003 | Journal Article | IST-REx-ID: 11766 |
Henzinger, M. H., & Leonardi, S. (2003). Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/s0022-0000(03)00043-6
[Published Version]
View
| DOI
| Download Published Version (ext.)
1997 | Journal Article | IST-REx-ID: 11767 |
Henzinger, M. H., Klein, P., Rao, S., & Subramanian, S. (1997). Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1006/jcss.1997.1493
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4057 |
Edelsbrunner, H. (1991). Corrigendum. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/0022-0000(91)90013-U
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4082 |
Edelsbrunner, H., & Guibas, L. (1989). Topologically sweeping an arrangement. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/0022-0000(89)90038-X
[Published Version]
View
| DOI
| Download Published Version (ext.)