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, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences. Elsevier, 2022. 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, Guy, Thomas A Henzinger, and Đorđe Žikelić. “Bidding Mechanisms in Graph Games.” Journal of Computer and System Sciences. Elsevier, 2021. 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, Monika H, and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” Journal of Computer and System Sciences. Elsevier, 2003. 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, Monika H, Philip Klein, Satish Rao, and Sairam Subramanian. “Faster Shortest-Path Algorithms for Planar Graphs.” Journal of Computer and System Sciences. Elsevier, 1997. https://doi.org/10.1006/jcss.1997.1493.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4057 |
Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences. Elsevier, 1991. 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, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” Journal of Computer and System Sciences. Elsevier, 1989. https://doi.org/10.1016/0022-0000(89)90038-X.
[Published Version]
View
| DOI
| Download Published Version (ext.)