Peer reviewed
- Maximizing a Submodular Function with Viability Constraints. Wolfgang Dvořák, Monika Henzinger and David P. Williamson. Algorithmica, 77(1): 152–172, 2015.
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai and Thatchaphol Saranurak. Proceedings of the Annual ACM Symposium on Theory of Computing, 21-30, 2015.
- Improved Algorithms for One-Pair and k-Pair Street Objectives. Krishnendu Chatterjee, Monika Henzinger and Veronika Loitzenbauer. Proceedings - Symposium on Logic in Computer Science, 269-280, 2015.
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai and Charalampos E. Tsourakakis. Proceedings of the Annual ACM Symposium on Theory of Computing, 173-182, 2015.
- Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. Proceedings of the Annual ACM Symposium on Theory of Computing, 674-683, 2014.
- New Deterministic Approximation Algorithms for Fully Dynamic Matching. Sayan Bhattacharya, Monika Henzinger and Danupon Nanongkai. Proceedings of the Annual ACM Symposium on Theory of Computing, 398-411, 2016.
- Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Veronika Loitzenbauer. Proceedings - Symposium on Logic in Computer Science, 197-206, 2016.
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. Proceedings of the Annual ACM Symposium on Theory of Computing, 489-498, 2016.
- Better Strategyproof Mechanisms without Payments or Prior — An Analytic Approach. Yun Kuen Cheung. International Journal of Artificial Intelligence, 1:194-200, 2016.
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. SIAM Journal on Computing, 45(3):947-1006, 2016.