Conference or workshop proceedings

• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. Sayan Bhattacharya, Monika Henzinger and Giuseppe F. Italiano. ACM/SIAM Symposium on Discrete Algorithms (SODA), January 4-6, 2015, 785-804.

• Online Ad Assignment with an Ad Exchange. Wolfgang Dvořák and Monika Henzinger. 12^th Workshop on Approximation and Online Algorithms, September 11-12, 2014, 156-167.

• Online Bipartite Matching with Decomposable Weights. Moses Charikar, Monika Henzinger and Huy L. Nguyên. 22th Annual European Symposium on Algorithms September 8-10, 2014, 260-271.

• Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. 55th Annual IEEE Symposium on Foundations of Computer Science, October 18-21, 2014, 146-155.

• Ad Exchange: Envy-Free Auctions with Mediators. Oren Ben-Zwi, Monika Henzinger and Veronika Loitzenbauer. 11^th Conference on Web and Internet Economics, December 9-12, 2015, 104-117.

• Conditionally Optimal Algorithms for Generalized Büchi Games. Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Veronika Loitzenbauer. 41st International Symposium on Mathematical Foundations of Computer Science, August 22-26, 2016, 25:1-25:15.

• Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. Gramoz Goranci, Monika Henzinger and Mikkel Thorup. 24th Annual European Symposium on Algorithms, August 22-26, 2016, 46:1-46:17.

• Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. Monika Henzinger and Stefan Neumann. 24th Annual European Symposium on Algorithms, August 22-26, 2016, 48:1-48:11.

• This House Proves That Debating Is Harder Than Soccer. Stefan Neumann and Andreas Wiese. Eighth International Conference on Fun with Algorithms. June 8-10, 2016, 25:1-25:14.

• Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer and Nikos Parotsidis. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 16-19, 2017, 1900-1918.

• Local Flow Partitioning for Faster Edge Connectivity. Monika Henzinger, Satish Rao and Di Wang. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 16-19, 2017, 1919-1938.

• Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³ n) Worst Case Update Time. Sayan Bhattacharya, Monika Henzinger and Danupon Nanongkai. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 16-19, 2017, 470-489.

• Conditional Hardness for Sensitivity Problems. Monika Henzinger, Andrea Lincoln, Stefan Neumann and Virginia Vassilevska Williams. 8th Innovations in Theoretical Computer Science, January 9-11, 2017.