| Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture M Henzinger, S Krinninger, D Nanongkai, T Saranurak Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 270 | 2015 |
| Online signature verification with support vector machines based on LCSS kernel functions C Gruber, T Gruber, S Krinninger, B Sick IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 40 …, 2009 | 172 | 2009 |
| A deterministic almost-tight distributed algorithm for approximating single-source shortest paths M Henzinger, S Krinninger, D Nanongkai Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 120 | 2016 |
| Near-optimal approximate shortest paths and transshipment in distributed and streaming models R Becker, S Forster, A Karrenbauer, C Lenzen SIAM Journal on Computing 50 (3), 815-856, 2021 | 98* | 2021 |
| Decremental single-source shortest paths on undirected graphs in near-linear total update time M Henzinger, S Krinninger, D Nanongkai Journal of the ACM (JACM) 65 (6), 1-40, 2018 | 95 | 2018 |
| Dynamic Approximate All-Pairs Shortest Paths: Breaking the Barrier and Derandomization M Henzinger, S Krinninger, D Nanongkai SIAM Journal on Computing 45 (3), 947-1006, 2016 | 76 | 2016 |
| On fully dynamic graph sparsifiers I Abraham, D Durfee, I Koutis, S Krinninger, R Peng 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 70 | 2016 |
| Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs M Henzinger, S Krinninger, D Nanongkai Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 63 | 2014 |
| A faster distributed single-source shortest paths algorithm S Forster, D Nanongkai 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 61 | 2018 |
| Fully dynamic all-pairs shortest paths with worst-case update-time revisited I Abraham, S Chechik, S Krinninger Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 57 | 2017 |
| A deamortization approach for dynamic spanner and dynamic maximal matching A Bernstein, S Forster, M Henzinger ACM Transactions on Algorithms (TALG) 17 (4), 1-51, 2021 | 56 | 2021 |
| Finding 2-edge and 2-vertex strongly connected components in quadratic time M Henzinger, S Krinninger, V Loitzenbauer Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 46 | 2015 |
| Improved algorithms for decremental single-source reachability on directed graphs M Henzinger, S Krinninger, D Nanongkai Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 42 | 2015 |
| A subquadratic-time algorithm for decremental single-source shortest paths M Henzinger, S Krinninger, D Nanongkai Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 42 | 2014 |
| Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms S Forster, D Nanongkai, L Yang, T Saranurak, S Yingchareonthawornchai Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 36 | 2020 |
| Dynamic low-stretch trees via dynamic low-diameter decompositions S Forster, G Goranci Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 28* | 2019 |
| Polynomial-time algorithms for energy games with special weight structures K Chatterjee, M Henzinger, S Krinninger, D Nanongkai Algorithmica 70 (3), 457-492, 2014 | 28 | 2014 |
| Fully Dynamic Spanners with Worst-Case Update Time G Bodwin, S Krinninger 24th Annual European Symposium on Algorithms (ESA 2016), 17:1--17:18, 2016 | 23 | 2016 |
| Dynamic maintenance of low-stretch probabilistic tree embeddings with applications S Forster, G Goranci, M Henzinger Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 15 | 2021 |
| Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks M Henzinger, S Krinninger, D Nanongkai ACM Transactions on Algorithms (TALG) 13 (4), 1-24, 2017 | 15 | 2017 |
Monika HenzingerProfessor of Computer Science, University of ViennaVerified email at univie.ac.at
