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 | OA
K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 9239 | OA
G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” Journal of Computer and System Sciences, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2003 | Journal Article | IST-REx-ID: 11766 | OA
M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees and meshes,” Journal of Computer and System Sciences, vol. 66, no. 3. Elsevier, pp. 567–611, 2003.
[Published Version] View | DOI | Download Published Version (ext.)
 

1997 | Journal Article | IST-REx-ID: 11767 | OA
M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” Journal of Computer and System Sciences, vol. 55, no. 1. Elsevier, pp. 3–23, 1997.
[Published Version] View | DOI | Download Published Version (ext.)
 

1991 | Journal Article | IST-REx-ID: 4057 | OA
H. Edelsbrunner, “Corrigendum,” Journal of Computer and System Sciences, vol. 42, no. 2. Elsevier, pp. 249–251, 1991.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4082 | OA
H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” Journal of Computer and System Sciences, vol. 38, no. 1. Elsevier, pp. 165–194, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

issn=0022-0000

Search

Filter Publications