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 | Published | Journal Article | IST-REx-ID: 11402 | 
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9239 |
Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 2021;119(8):133-144. doi:10.1016/j.jcss.2021.02.008
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2003 | Published | Journal Article | IST-REx-ID: 11766 |
Henzinger M, 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
[Published Version]
View
| DOI
| Download Published Version (ext.)
1997 | Published | Journal Article | IST-REx-ID: 11767 |
Henzinger M, 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
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Published | Journal Article | IST-REx-ID: 4057 |
Edelsbrunner H. Corrigendum. Journal of Computer and System Sciences. 1991;42(2):249-251. doi:10.1016/0022-0000(91)90013-U
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Published | Journal Article | IST-REx-ID: 4082 |
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
[Published Version]
View
| DOI
| Download Published Version (ext.)