ISTA Research Explorer

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

2023 | Journal Article | IST-REx-ID: 12563 |

Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.

[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv

2023 | Journal Article | IST-REx-ID: 12960 |

Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations
J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing 52 (2023) 452–486.

[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS

2023 | Journal Article | IST-REx-ID: 14558

Deterministic near-optimal approximation algorithms for dynamic set cover
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, SIAM Journal on Computing 52 (2023) 1132–1192.

View | DOI

2023 | Journal Article | IST-REx-ID: 14364 |

Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, SIAM Journal on Computing 52 (2023) 913–944.

2021 | Journal Article | IST-REx-ID: 11886 |

A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50 (2021) STOC16-98-STOC16-137.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv