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.

9 Publications


2022 | Published | Conference Paper | IST-REx-ID: 12432
Solving the Hamilton cycle problem fast on average
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
View | DOI | WoS
 

2022 | Published | Conference Paper | IST-REx-ID: 11145 | OA
List-decodability with large radius for Reed-Solomon codes
A. Ferber, M.A. Kwan, L. Sauermann, in:, 62nd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2022, pp. 720–726.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2014 | Published | Conference Paper | IST-REx-ID: 11855 | OA
Decremental single-source shortest paths on undirected graphs in near-linear total update time
M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–155.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 11856 | OA
Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization
M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–547.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

1998 | Published | Conference Paper | IST-REx-ID: 11682
Parametric and kinetic minimum spanning trees
P.K. Agarwal, D. EppsteinL. J. Guibas, M.H. Henzinger, in:, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 596–605.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 4034
Algebraic decomposition of non-convex polyhedra
H. Edelsbrunner, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 248–257.
View | Download None (ext.)
 

1995 | Published | Conference Paper | IST-REx-ID: 4498
Computing simulations on finite and infinite graphs
M.H. Henzinger, T.A. Henzinger, P. Kopke, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 453–462.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11684
Fully dynamic biconnectivity and transitive closure
M.H. Henzinger, V. King, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 1995, pp. 664–672.
View | DOI
 

1987 | Published | Conference Paper | IST-REx-ID: 3514
On the lower envelope of bivariate functions and its applications
H. Edelsbrunner, J. Pach, J. Schwartz, M. Sharir, in:, 28th Annual Symposium on Foundations of Computer Science , IEEE, 1987, pp. 27–37.
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0272-5428

Search

Filter Publications

Display / Sort

Export / Embed