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.

59 Publications


2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
Charting the diameter computation landscape of intersection graphs in 3D and above
T.M. Chan, H.C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D.W. Zheng, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 21159 | OA | PlanS
Counting perfect matchings in Dirac hypergraphs
M.A. Kwan, R. Safavi Hemami, Y. Wang, Combinatorica 46 (2026).
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 21719 | OA
Dynamic hierarchical j-tree decomposition and its applications
G. Goranci, M. Henzinger, P. Kiss, A. Momeni, G. Zöcklein, in:, Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 1128–1180.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22246 | OA
Cutting planarians: Planar emulators for string graphs
H.C. Chang, J. Conroy, Z. Tan, D.W. Zheng, in:, 58th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2026, pp. 2140–2151.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 22318 | OA | PlanS
Concurrent composition for differentially private continual mechanisms
M. Henzinger, R. Safavi Hemami, S. Vadhan, Proceedings of the ACM on Management of Data 4 (2026) 1–26.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 22322 | OA | PlanS
Improved lower bounds for privacy under continual release
B. Aryanfard, M. Henzinger, D. Saulpic, A.R. Sricharan, Proceedings of the ACM on Management of Data 4 (2026) 1–27.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22368 | OA
Order statistics in population protocols via simple dynamics
N. D’Archivio, H. Almahmoud, E. Natale, F. Mallmann-Trenn, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 425–436.
[Published Version] View | Files available | DOI
 

2026 | Published | Conference Paper | IST-REx-ID: 22367 | OA
Undecided state dynamics with many opinions
C. Cooper, F. Mallmann-Trenn, T. Radzik, N. Shimizu, T. Shiraga, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 77–87.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Ranking opinions with few states in population protocols
T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–424.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks
A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 

2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time
A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
Charting the landscape of diameter computation on geometric intersection graphs in the plane
T.M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D.W. Zheng, in:, 53rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 22716 | OA | PlanS
Incremental approximate maximum flow via residual graph sparsification
G. Goranci, M. Henzinger, H. Räcke, A.R. Sricharan, ACM Transactions on Algorithms 22 (2026).
[Published Version] View | Files available | DOI | arXiv
 

2026 | Epub ahead of print | Journal Article | IST-REx-ID: 22812
Tight bounds on the performance of dynamic directed cutset data structures based on OMv
N. Hahn, M. Henzinger, Z. Stefankovic, Information Processing Letters 195 (2026).
View | DOI
 

2026 | Published | Conference Paper | IST-REx-ID: 22146 | OA
Learning rate scheduling with matrix factorization for private training
N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22916 | OA
Instance optimal and universally optimal bounds for imprecise pareto fronts
S. De Berg, N.M.F. Bække, F.A. Eriksen, I. Van Der Hoog, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22915 | OA
Tight Better-Than-Worst-Case bounds for element distinctness and set intersection
I. Van Der Hoog, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22914 | OA
Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time
D.W. Zheng, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22918 | OA
DAG covers for structured graphs: The Steiner point effect
S. Bhore, H.C. Chang, J. Conroy, A. Filtser, E. Oh, N. Wein, D.W. Zheng, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22917 | OA
Near-optimal working-set heaps and dijkstra on pointer machines
I. Van Der Hoog, J. Iacono, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

department=MoHe

Search

Filter Publications

Display / Sort

Export / Embed