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
Chan TM, Chang HC, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. Charting the diameter computation landscape of intersection graphs in 3D and above. In: 42nd International Symposium on Computational Geometry. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.SoCG.2026.29
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 21159 | OA | PlanS
Kwan MA, Safavi Hemami R, Wang Y. Counting perfect matchings in Dirac hypergraphs. Combinatorica. 2026;46. doi:10.1007/s00493-025-00194-8
[Published Version] View | Files available | DOI | arXiv
 

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

2026 | Published | Conference Paper | IST-REx-ID: 22246 | OA
Chang HC, Conroy J, Tan Z, Zheng DW. Cutting planarians: Planar emulators for string graphs. In: 58th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2026:2140-2151. doi:10.1145/3798129.3800917
[Published Version] View | Files available | DOI | arXiv
 

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

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

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

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

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

2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:10.15479/AT-ISTA-22281
[Published Version] View | Files available | DOI
 

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

2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
Chan TM, Chang H-C, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. Charting the landscape of diameter computation on geometric intersection graphs in the plane. In: 53rd International Colloquium on Automata, Languages, and Programming. Vol 374. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPICS.ICALP.2026.54
[Published Version] View | Files available | DOI | arXiv
 

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

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

2026 | Published | Conference Paper | IST-REx-ID: 22146 | OA
Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization for private training. In: 7th Symposium on Foundations of Responsible Computing. Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.FORC.2026.2
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22916 | OA
De Berg S, Bække NMF, Eriksen FA, Van Der Hoog I, Rotenberg E, Rutschmann DP. Instance optimal and universally optimal bounds for imprecise pareto fronts. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.106
[Published Version] View | Files available | DOI | arXiv
 

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

2026 | Published | Conference Paper | IST-REx-ID: 22914 | OA
Zheng DW. Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.61
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22918 | OA
Bhore S, Chang HC, Conroy J, et al. DAG covers for structured graphs: The Steiner point effect. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.94
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22917 | OA
Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. Near-optimal working-set heaps and dijkstra on pointer machines. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.45
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

department=MoHe

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed