Items where Author is "Henzinger, Monika"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Category | No Grouping
Jump to: Journal Paper | Paper in Conference Proceedings or in Workshop Proceedings | Book Section/Chapter
Number of items: 175.

Journal Paper

  • Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian ISSN 1084-6654 (2022)

  • Constant-Time Dynamic (∆ + 1)-Coloring
    Henzinger, Monika and Peng, Pan ISSN 1549-6325 (2022)

  • A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
    Bernstein, Aaron and Forster, Sebastian and Henzinger, Monika ISSN 1549-6325 (2021)

  • Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest
    Henzinger, Monika and Peng, Pan ISSN 0890-5401 (2021)

  • Algorithms and conditional lower bounds for planning problems
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Svozil, Alexander and Henzinger, Monika ISSN 0004-3702 (2021)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 0097-5397 (2021)

  • Local Flow Partitioning for Faster Edge Connectivity
    Henzinger, Monika and Rao, Satish and Wang, Di ISSN 0097-5397 (2020)

  • Dynamic Clustering to Minimize the Sum of Radii
    Henzinger, Monika and Leniowski, Dariusz and Mathieu, Claire ISSN 1432-0541 (2020)

  • Local Flow Partitioning for Faster Edge Connectivity
    Henzinger, Monika and Rao, Satish and Wang, Di ISSN 0097-5397 (2019)

  • Improved Guarantees for Vertex Sparsification in Planar Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan ISSN 0895-4801 (2019)

  • Deterministic Dynamic Matching in O(1) Update Time
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika ISSN 1432-0541 (2019)

  • Efficient Distributed Workload (Re-)Embedding
    Henzinger, Monika and Neumann, Stefan and Schmid, Stefan ISSN 2476-1249 (2019)

  • New amortized cell-probe lower bounds for dynamic problems
    Bhattacharya, Sayan and Henzinger, Monika and Neumann, Stefan ISSN 0304-3975 (2019)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 0004-5411 (2018)

  • Practical Minimum Cut Algorithms
    Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren ISSN 1084-6654 (2018)

  • Valuation Compressions in VCG-Based Combinatorial Auctions
    Dütting, Paul and Henzinger, Monika and Starnberger, Martin ISSN 2167-8375 (2018)

  • Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. ISSN 0097-5397 (2018)

  • Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel ISSN 1549-6325 (2018)

  • Dynamic algorithms via the primal-dual method
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. ISSN 0890-5401 (2018)

  • Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 1549-6325 (2017)

  • Improved Algorithms for Parity and Streett objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika ISSN 1860-5974 (2017)

  • Welfare Maximization with Friends-of-Friends Network Externalities
    Bhattacharya, Sayan and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin Theory of Computing Systems. pp. 1-39 ISSN 1432-4350 Springer US (2017)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 947-1006 ISSN 0097-5397 (2016)

  • Maximizing a Submodular Function with Viability Constraints
    Dvořák, Wolfgang and Henzinger, Monika and Williamson, David P. ISSN 0178-4617 Springer US (2015)

  • Truthful unit-demand auctions with budgets revisited
    Henzinger, Monika and Loitzenbauer, Veronika pp. 1-15 ISSN 0304-3975 Elsevier (2015)

  • Split diversity in constrained conservation prioritization using integer linear programming
    von Haeseler, Arndt and Bui, Minh Q. and Chernomor, Olga and Henzinger, Monika pp. 83-91 ISSN 2041-210X WILEY-BLACKWELL (2015)

  • Auctions for Heterogeneous Items and Budget Limits
    Dütting, Paul and Henzinger, Monika and Starnberger, Martin ACM Trans. Economics and Comput., 4 (1). p. 4 ISSN 2167-8375 (2015)

  • An Expressive Mechanism for Auctions on the Web
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar ACM Trans. Economics and Comput., 4 (1). p. 1 ISSN 2167-8375 (2015)

  • On Multiple Keyword Sponsored Search Auctions with Budgets
    Colini-Baldeschi, Riccardo and Leonardi, Stefano and Henzinger, Monika and Starnberger, Martin ACM Trans. Economics and Comput., 4 (1). p. 2 ISSN 2167-8375 (2015)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika and Raskin, Michael A. pp. 104-116 ISSN 0304-3975 (2014)

  • Efficient and Dynamic Algorithms for Alternating Buchi Games and Maximal End-component Decomposition
    Chatterjee, Krishnendu and Henzinger, Monika 15:1-15:40 ISSN 0004-5411 ACM (2014)

  • Polynomial-Time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 457-492 ISSN 0178-4617 (2014)

  • Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Joglekar, Manas and Shah, Nisarg Formal Methods in System Design, 42 (3). pp. 301-327 ISSN 0925-9856 Kluwer (2013)

  • Bidder optimal assignments for general utilities
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar Theoretical Computer Science, 478 (1). pp. 22-32 Elsevier (2013)

  • A Comprehensive Study of Techniques for URL-Based Web Page Language Classification
    Baykan, Eda and Henzinger, Monika and Weber, Ingmar ACM Transactions on the Web, 7 (1). 3:1-3:37 ACM (2013)

  • Sponsored search, market equilibria, and the Hungarian Method
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar Information Processing Letters, 113 (3). pp. 67-73 Elsevier (In Press) (2013)

  • A Comprehensive Study of Features and Algorithms for URL-based Topic Classification
    Baykan, Eda and Henzinger, Monika and Marian, Ludmila and Weber, Ingmar ACM Transactions on the Web, 5 (3). 15:1-15:29 ISSN 1559-1131 ACM (2011)

  • Offline file assignments for online load balancing
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar Information Processing Letters, 111 (4). pp. 178-183 ISSN 0020-0190 Elsevier (2011)

  • The Stability of the H-Index
    Henzinger, Monika and Suñol, Jacob and Weber, Ingmar Scientometrics, online (appear). (2009)

  • Search Technologies for the Internet
    Henzinger, Monika Science, 317 (5837). p. 468 (2007)

  • Query-Free News Search
    Henzinger, Monika and Chang, Bay-Wei and Milch, Brian and Brin, Sergey World Wide Web, 8 (2). 101--126 (2005)

  • An online throughput-competitive algorithm for multicast routing and admission control
    Goel, Ashish and Henzinger, Monika and Plotkin, Serge J Algorithms, 55 (1). 1--20 (2005)

  • Scheduling Multicasts on Unit-Capacity Trees and Meshes
    Henzinger, Monika and Leonardi, Stefano J. Comput. Syst. Sci., 66 (3). pp. 567-611 (2003)

  • Scheduling data transfers in a network and the set scheduling problem
    Goel, Ashish and Henzinger, Monika and Plotkin, Serge and Tardos, Eva J Algorithms, 48 (2). 314--332 (2003)

  • Scheduling multicasts on unit-capacity trees and meshes
    Henzinger, Monika and Leonardi, Stefano J. Comput. Syst. Sci., 66 (3). 567--611 (2003)

  • Challenges in web search engines
    Henzinger, Monika and Motwani, Rajeev and Silverstein, Craig SIGIR Forum, 36 (2). 11--22 ACM Press (2002)

  • Hyperlink analysis for the Web
    Henzinger, Monika Internet Computing, IEEE, 5 (1). 45--50 (2001)

  • Maintaining minimum spanning forests in dynamic graphs
    Henzinger, Monika and King, Valerie SIAM J Comput, 31 (2). 364--374 (2001)

  • Computing Vertex Connectivity: New Bounds from Old Techniques
    Henzinger, Monika and Rao, Satish and Hal, N. J Algorithms, 34 (2). 222--250 (2000)

  • On near-uniform URL sampling
    Henzinger, Monika and Heydon, Allan and Mitzenmacher, Michael and Najork, Marc Comput. Networks, 33 (1). 295--308 (2000)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • Expander Hierarchies for Normalized Cuts on Graphs
    Hanauer, Kathrin and Henzinger, Monika and Münk, Robin and Räcke, Harald and Vötsch, Maximilian In: 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD ’24) , 25 August 2024 – 29 August 2024 , Barcelona, Spain (2024)

  • Private Counting of Distinct Elements in the Turnstile Model and Extensions
    Henzinger, Monika and Arunapuram, Sricharan and Steiner, Teresa Anna In: The 28th International Conference on Randomization and Computation , August 28-30, 2024 , London, UK (2024)

  • Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges
    El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan In: IGAFIT Highlights of Algorithms conferences (HALG) , June 3-5, 2024 , Zielna Conference Center, Warsaw, Poland (2024)

  • Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
    Henzinger, Monika and A.R., Sricharan and Zhu, Leqi In: IGAFIT Highlights of Algorithms conferences (HALG24) , June 3-5, 2024 , Zielna Conference Center, Warsaw, Poland (2024)

  • Dynamically Maintaining the Persistent Homology of Time Series
    Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert and Henzinger, Monika and Ost, Lara In: ACM-SIAM Symposium on Discrete Algorithms (SODA24) , January, 7-10, 2024 , Alexandria, Virginia, USA (2024)

  • Electrical Flows for Polylogarithmic Competitive Oblivious Routing
    Goranci, Gramoz and Henzinger, Monika and Räcke, Harald and Sachdeva, Sushant and A.R., Sricharan In: 15th Innovations in Theoretical Computer Science (ITCS) , January 30 to Friday February 2, 2024 , Simons Institute for the Theory of Computing on the University of California, Berkeley, USA (2024)

  • On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
    Henzinger, Monika and Saha, Barna and Seybold P., Martin and Ye, Christopher In: 15th Innovations in Theoretical Computer Science (ITCS) , January 30 to Friday February 2, 2024 , Simons Institute for the Theory of Computing on the University of California, Berkeley, USA (2024)

  • Simple, Scalable and Effective Clustering via One-Dimensional Projections
    Charikar, Moses and Henzinger, Monika and Hu, Lunjia and Vötsch, Maximilian and Waingarten, Erik In: Thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023) , 10.-16.12.2023 , New Orleans, Ernest N. Morial Convention Center (2023)

  • Efficient Data Structures for Incremental Exact and Approximate Maximum Flow
    Goranci, Gramoz and Henzinger, Monika In: 50th EATCS International Colloquium on Automata, Languages and Programming, ICALP 2023 , 10-14 July , Paderborn, Germany (2023)

  • Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
    Hanauer, Kathrin and Henzinger, Monika and Ost, Lara and Schmid, Stefan In: IEEE International Conference on Computer Communications (INFOCOM 2023) , 17–20 May 2023 , New York area, USA (2023)

  • Almost Tight Error Bounds on Differentially Private Continual Counting
    Henzinger, Monika and Upadhyay, Jalaj and Upadhyay, Sarvagya In: ACM-SIAM Symposium on Discrete Algorithms (SODA23) , January 22 - 25, 2023 , Florence, Italy (2023)

  • Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks
    El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan In: 14th Innovations in Theoretical Computer Science (ITCS 2023) , January 10 - January 13, 2023 , Cambridge, Massachusetts (USA) (2023)

  • Fully Dynamic Exact Edge Connectivity in Sublinear Time
    Goranci, Gramoz and Henzinger, Monika and Nanongkai, Danupon and Saranurak, Thatchaphol and Thorup, Mikkel and Wulff-Nilsen, Christian In: ACM-SIAM Symposium on Discrete Algorithms (SODA23) , January 22 - 25, 2023 , Florence, Italy (2023)

  • Online Min-Max Paging
    Chiplunkar, Ashish and Henzinger, Monika and Kale, Sagar Sudhir and Vötsch, Maximilian In: ACM-SIAM Symposium on Discrete Algorithms (SODA23) , January 22 - 25, 2023 , Florence, Italy (2023)

  • Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
    Bateni, MohammadHossein and Esfandiari, Hossein and Fichtenberger, Hendrik and Henzinger, Monika and Jayaram, Rajesh and Mirrokni, Vahab and Wiese, Andreas In: ACM-SIAM Symposium on Discrete Algorithms (SODA23) , January 22 - 25, 2023 , Florence, Italy (2023)

  • The augmentation-speed tradeoff for consistent network updates
    Henzinger, Monika and Paz, Ami and Pourdamghani, Arash and Schmid, Stefan In: The ACM SIGCOMM Symposium on SDN Research (SOSR) 2022 , October 20, 2022 , Virtual Event (2022)

  • Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
    Henzinger, Monika and Paz, Ami and Sricharan, A.R. In: European Symposium on Algorithms (ESA) 2022 , 5.-9.9.2022 , Potsdam, Germany (2022)

  • Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
    El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan In: ACM Symposium on Principles of Distributed Computing (PODC) 2022 , July 25-29, 2022 , Salerno, Italy (2022)

  • Leximax Approximations and Representative Cohort Selection
    Henzinger, Monika and Peale, Charlotte and Reingold, Omer and Hanwen Shen, Judy In: The 3rd annual Symposium on Foundations of Responsible Computing (FORC 2022) , June 6-8, 2022 , Cambridge, MA, USA (2022)

  • Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) , March 28-30, 2022 , Online Event (2022)

  • The Complexity of Average-Case Dynamic Subgraph Counting
    Henzinger, Monika and Lincoln, Andrea and Saha, Barna In: ACM-SIAM Symposium on Discrete Algorithms (SODA22) , January, 9-12, 2022 , Alexandria, Virginia, U.S. (2022)

  • Practical Fully Dynamic Minimum Cut Algorithms
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX22) , January 9 - 10, 2022 , Hybrid: Alexandria, Virginia, U.S. (2022)

  • Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
    El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan In: ACM Symposium on Principles of Distributed Computing (PODC) 2022 , July 25-29, 2022 , Salerno, Italy (2022)

  • Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
    Hanauer, Kathrin and Henzinger, Monika and Schmid, Stefan and Trummer, Jonathan In: IEEE Conference on Computer Communications (INFOCOM), Virtual Conference, May 2022 , 2-5/5/2022 , Virtual Conference (2022)

  • Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
    Hanauer, Kathrin and Henzinger, Monika and Schmid, Stefan and Trummer, Jonathan In: IEEE International Conference on Computer Communications (INFOCOM) 2022 , 2-5 May, 2022 , Virtual Online (2022)

  • Fully Dynamic Four-Vertex Subgraph Counting
    Hanauer, Kathrin and Henzinger, Monika and Hua, Qi Cheng In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) , March 28-30, 2022 , Online Event (2022)

  • Differentially Private Algorithms for Graphs Under Continual Observation
    Fichtenberger, Hendrik and Henzinger, Monika and Ost, Wolfgang In: European Symposium on Algorithms (ESA21) , 06.09.2021 - 10.09.2021 , Virtual conference (2021)

  • Upper and Lower Bounds for Fully Retroactive Graph Problems
    Henzinger, Monika and Wu, Xiaowei In: 17th Algorithms and Data Structures Symposium (WADS 2021) , August 9-11, 2021 , Virtual conference (2021)

  • Faster Algorithms for Bounded Liveness in Graphs and Game Graphs
    Chatterjee, Krishnendu and Henzinger, Monika and Kale, Sagar and Svozil, Alexander In: 48th International Colloquium on Automata, Languages, and Programming (ICALP) , 12th-16th July , virtual (2021)

  • Faster Parallel Multiterminal Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) , July 19 - 21, 2021 , Virtual Conference (2021)

  • On the Complexity of Weight-Dynamic Network Algorithms
    Henzinger, Monika and Paz, Ami and Schmid, Stefan In: 20th Annual IFIP Networking Conference , 21-24 June 2021 , Online (2021)

  • Symbolic Time and Space Tradeoffs for Probabilistic Verification
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Svozil, Alexander and Henzinger, Monika In: 36th Annual Symposium on Logic in Computer Science (LICS 2021) , 29 June - 02 July, 2021 , Online (2021)

  • Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
    Forster, Sebastian and Goranci, Gramoz and Henzinger, Monika In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon and Wu, Xiaowei In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • Fully Dynamic k-Center Clustering in Low Dimensional Metrics
    Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz and Schulz, Christian and Svozil, Alexander In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2021) , 10.-11.1.2021 , Virtual Online (Virginia, US) (2021)

  • New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
    Bergamaschi, Thiago and Henzinger, Monika and Probst Gutenberg, Maximilian In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • Tight Bounds for Online Graph Partitioning
    Henzinger, Monika and Neumann, Stefan and Räcke, Harald and Schmid, Stefan In: ACM-SIAM Symposium on Discrete Algorithms (SODA) , January 2021 , Alexandria, Virgina, USA (2021)

  • Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
    Chen, Li and Goranci, Gramoz and Henzinger, Monika and Peng, Richard and Saranurak, Thatchaphol In: 61st Annual IEEE Symposium on Foundations of Computer Science , 16.-19.11.2020 , Online Virtual Conference (2020)

  • Dynamic Matching Algorithms in Practice
    Henzinger, Monika and Khan, Shahbaz and Paul, Richard and Schulz, Christian In: 28th Annual European Symposium on Algorithms (ESA 2020) , 07.-11-09-2020 , Online Virtual Conference (2020)

  • Finding All Global Minimum Cuts In Practice
    Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren In: 28th Annual European Symposium on Algorithms (ESA 2020) , 07.09.-11.09.2020 , Pisa, Italy (2020)

  • Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles
    Henzinger, Monika and Neumann, Stefan and Wiese, Andreas In: 36th International Symposium on Computational Geometry 2020 , 23-26 Jun 2020 , Zurich, Switzerland (2020)

  • Faster Fully Dynamic Transitive Closure in Practice
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: 18th Symposium on Experimental Algorithms (SEA 2020) , June 16-18, 2020 , Catania, Italy (2020)

  • Constant-Time Dynamic (\Delta + 1)-Coloring
    Henzinger, Monika and Peng, Pan In: Symposium on Theoretical Aspects of Computer Science (STACS2020) , March 10-14, 2020 , Montpellier, France (2020)

  • Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: Algorithm Engineering and Experimentation (ALENEX 2020) , Jan 5-6, 2020 , Salt Lake City, Utah, U.S. (2020)

  • Shared-Memory Branch-and-Reduce for Multiterminal Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: Algorithm Engineering and Experimentation (ALENEX 2020) , Jan 5-6, 2020 , Salt Lake City, Utah, U.S. (2020)

  • Fully-Dynamic Coresets
    Henzinger, Monika and Kale, Sagar In: 28th Annual European Symposium on Algorithms (ESA 2020) , September 7 to September 11, 2020 , Virtual Online (Pisa, Italy) (2020)

  • A New Deterministic Algorithm for Dynamic Set Cover
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019) , November 9-12, 2019 , Baltimore, Maryland, USA (2019)

  • Near-linear time algorithms for Streett objectives in Graphs and MDPs
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Svozil, Alexander In: CONCUR 2019, the 30th International Conference on Concurrency Theory , August 26-31, 2019 , Amsterdam, The Netherlands (2019)

  • Algorithms and Hardness for Diameter in Dynamic Graphs
    Ancona, Bertie and Henzinger, Monika and Roditty, Liam and Vassilevska Williams, Virginia and Wein, Nicole In: 46th International Colloquium on Automata, Languages and Programming (ICALP 2019) , 8-12 July 2019 , Patras, Greece (2019)

  • Distributed edge connectivity in sublinear time.
    Daga, Mohit and Henzinger, Monika and Nanongkai, Danupon and Saranurak, Thatchaphol In: 51st Annual ACM Symposium on the Theory of Computing , June 23-26, 2019 , Phoenix, AZ, USA (2019)

  • Efficient Distributed Workload (Re-)Embedding
    Henzinger, Monika and Neumann, Stefan and Schmid, Stefan In: ACM SIGMETRICS / IFIP Performance 2019 , June 2019 , Phoenix, Arizona, USA (2019)

  • Shared-memory Exact Minimum Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: 33rd IEEE International Parallel & Distributed Processing Symposium , 20-24.5.2019 , Rio de Janeiro (2019)

  • A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
    Bernstein, Aaron and Forster, Sebastian and Henzinger, Monika In: ACM-SIAM Symposium on Discrete Algorithms (SODA19) , January 6-9, 2019 , San Diego, California, USA (2019)

  • Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Svozil, Alexander In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) , 16-21 November, 2018 , Awassa, Ethiopia (2018)

  • A Tree Structure For Dynamic Facility Location
    Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz In: 26th Annual European Symposium on Algorithms (ESA 2018) , 20-24 August 2018 , Helsinki, Finland (2018)

  • Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika and Oraee, Simin and Toman, Viktor In: 30th International Conference on Computer Aided Verification (CAV 2018) , July 14-17 , Oxford, UK (2018)

  • Memetic Graph Clustering
    Biedermann, Sonja and Henzinger, Monika and Schulz, Christian and Schuster, Bernhard In: 7th International Symposium on Experimental Algorithms (SEA 2018) , June 27-29 , L’Aquila, Italy (2018)

  • Algorithms and Conditional Lower Bounds for Planning Problems
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Svozil, Alexander In: The 28th International Conference on Automated Planning and Scheduling , 27-29 June 2018 , Delft, The Netherlands (2018)

  • Practical Minimum Cut Algorithms
    Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren In: 2018 20th Workshop on Algorithm Engineering and Experiments (ALENEX) , January 7-8, 2018 , New Orleans, USA (2018)

  • Dynamic Algorithms for Graph Coloring
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika and Nanongkai, Danupon In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) , January 7-10, 2018 , New Orleans, LA, USA (2018)

  • Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 26th Annual European Symposium on Algorithms (ESA 2018) , 20-24 August 2018 , Helsinki, Finland (2018)

  • Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) , January 7-10, 2018 , New Orleans, LA, USA (2018)

  • Improved Guarantees for Vertex Sparsification in Planar Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 25th Annual European Symposium on Algorithms (ESA 2017) , September 4-6, 2017 , Vienna, Austria (2017)

  • The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 25th Annual European Symposium on Algorithms (ESA 2017) , September 4-6, 2017 , Vienna, Austria (2017)

  • Capacity Releasing Diffusion for Speed and Locality
    Wang, Di and Fountoulakis, Kimon and Henzinger, Monika and Mahoney, Michael W. and Rao, Satish In: Thirty-fourth International Conference on Machine Learning 2017 , 06-11 Aug 2017 , Sydney, Australia (2017)

  • Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika In: 19th Conference on Integer Programming and Combinatorial Optimization , June 26 - 28, 2017 , Waterloo, Canada (2017)

  • Conditional Hardness for Sensitivity Problems
    Henzinger, Monika and Lincoln, Andrea and Neumann, Stefan and Vassilevska Williams, Virginia In: 8th Innovations in Theoretical Computer Science (ITCS) 2017 , 9-11 Jan 2017 , Berkeley, California, United States of America (2017)

  • Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log^3 n) Worst Case Update Time
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Local Flow Partitioning for Faster Edge Connectivity
    Henzinger, Monika and Rao, Satish and Wang, Di In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Dynamic Clustering to Minimize the Sum of Radii
    Henzinger, Monika and Leniowski, Dariusz and Mathieu, Claire In: 25th Annual European Symposium on Algorithms , 4-6 Sep 2017 , Vienna, Austria (2017)

  • Faster Algorithms for Mean-Payoff Parity Games
    Chatterjee, Krishnendu and Henzinger, Monika and Svozil, Alexander In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS) 2017 , 21-25 August 2017 , Aalborg, Denmark (2017)

  • Improved Set-Based Symbolic Algorithms for Parity Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden , 20-24 August 2017 , Stockholm (2017)

  • Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
    Henzinger, Monika and Neumann, Stefan In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Conditionally Optimal Algorithms for Generalized Büchi Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , August 22-26, 2016 , Krakow (Poland) (2016)

  • Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
    Cheung, Yun Kuen and Goranci, Gramoz and Henzinger, Monika In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) , 12-15 July 2016 , Rome, Italy (2016)

  • Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) , July 5-8, 2016 , New York City, USA (2016)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • New Deterministic Approximation Algorithms for Fully Dynamic Matching
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • Ad Exchange: Envy-free Auctions with Mediators
    Ben-Zwi, Oren and Henzinger, Monika and Loitzenbauer, Veronika In: 11th Conference on Web and Internet Economics (WINE 2015) , December 9-12, 2015 , Amsterdam, The Netherlands (2015)

  • Combinatorial Auctions with Conflict-Based Externalities
    Cheung, Yun Kuen and Henzinger, Monika and Hoefer, Martin and Starnberger, Martin In: 11th Conference on Web and Internet Economics (WINE 2015) , December 9-12, 2015 , Amsterdam, The Netherlands (2015)

  • Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon and Tsourakakis, Charalampos E. In: 47th ACM Symposium on Theory of Computing (STOC 2015) , June 14 - June 17 , Portland, OR, USA (2015)

  • Design of Dynamic Algorithms via Primal-Dual Method
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
    Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
    Henzinger, Monika and Nanongkai, Danupon and Krinninger, Sebastian In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Improved Algorithms for One-Pair and k-Pair Streett Objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika In: Thirtieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon and Saranurak, Thatchaphol In: 47th ACM Symposium on Theory of Computing (STOC 2015) , June 14 - June 17 , Portland, OR, USA (2015)

  • Welfare Maximization with Friends-of-Friends Network Externalities
    Bhattacharya, Sayan and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin In: 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015) , March, 4 - 7 2015 , Munich, Germany (2015)

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

  • Online Ad Assignment with an Ad Exchange
    Dvořák, Wolfgang and Henzinger, Monika In: Workshop on Approximation and Online Algorithms , September 11–12 , Wroclaw, Poland (2015)

  • Limiting Price Discrimination when Selling Products with Positive Network Externalities
    Cigler, Luděk and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin In: WINE 2014: The 10th Conference on Web and Internet Economics , Dec. 14-17 , Bejing, China (2014)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014) , October 18-21, 2014 , Philadelphia, USA (2014)

  • Online Bipartite Matching with Decomposable Weights
    Charikar, Moses and Henzinger, Monika and Nguyên, Huy L. In: 22nd European Symposium on Algorithms (ESA 2014) , September 8–10, 2014 , Wrocław, Poland (2014)

  • Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 46th ACM Symposium on Theory of Computing (STOC 2014) , June 1 – June 3, 2014 , New York, NY, USA (2014)

  • A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 25th ACM-SIAM Symposium on Discrete Algorithms (SODA14) , January 5-7, 2014 , Portland, USA (In Press) (2014)

  • Valuation Compressions in VCG-Based Combinatorial Auctions
    Dütting, Paul and Henzinger, Monika and Starnberger, Martin In: 9th Conference on Web and Internet Economics (WINE 2013) , 11-14 Dec 2013 , Harvard University, Cambridge, MA, USA (2013)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: FOCS 2013 54th Annual IEEE Symposium on Foundations of Computer Science , October 27-29, 2013 , Berkeley, USA (In Press) (2013)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: Fourth International Symposion on Games, Automata, Logics and Formal Verification (GandALF 2013) , 29 - 31 Aug 2013 , Borca di Cadore, Dolomites, Italy (2013)

  • Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 40th International Colloquium on Automata, Languages and Programming (ICALP 2013) , 8-12 July 2013 , Riga, Latvia (In Press) (2013)

  • Maximizing a Submodular Function with Viability Constraints
    Dvořák, Wolfgang and Henzinger, Monika and Williamson, David P. In: 21st European Symposium on Algorithms (ESA 2013) , 02-04 Sep 2013 , Sophia Antipolis, France (2013)

  • Polynomial-time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 20th Annual European Symposium on Algorithms (ESA 2012) , 10-12 Sep 2012 , Ljubljana, Slovenia (2012)

  • Auctions with Heterogeneous Items and Budget Limits
    Dütting, Paul and Henzinger, Monika and Starnberger, Martin In: 8th Workshop on Internet & Network Economics (WINE 2012) , 9-12 Dec 2012 , Liverpool, United Kingdom (2012)

  • Maximizing revenue from strategic recommendations under decaying trust
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar In: 21st ACM International Conference on Information and Knowledge Management (CIKM) , 29 Oct - 02 Nov 2012 , Maui, USA (2012)

  • An O(n²) Time Algorithm for Alternating Büchi Games
    Chatterjee, Krishnendu and Henzinger, Monika In: ACM Symposium on Discrete Algorithms (SODA12) , 17-19 Jan, 2012 , Kyoto, Japan (2012)

  • On Multiple Keyword Sponsored Search Auctions with Budgets
    Colini Baldeschi, Riccardo and Henzinger, Monika and Leonardi, Stefano and Starnberger, Martin In: 39th International Colloquium on Automata, Languages and Programming (ICALP 2012) , 9-13 Jul 2012 , Warwick, United Kingdom (2012)

  • On Multiple Keyword Sponsored Search Auctions with Budgets
    Colini Baldeschi, Riccardo and Henzinger, Monika and Leonardi, Stefano and Starnberger, Martin In: 8th Workshop on Ad Auctions , 8 Jun 2012 , Valencia, Spain (2012)

  • Multi-parameter mechanism design under budget and matroid constraints
    Henzinger, Monika and Vidali, Angelina In: 19th Annual European Symposium on Algorithms (ESA 2011) , September 5-9, 2011 , Saarbruecken, Germany (In Press) (2011)

  • Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with "Buchi Objectives"
    Chatterjee, Krishnendu and Henzinger, Monika and Manas, Joglekar and Nisarg, Shah In: Proc. 23rd International Conference on Computer Aided Verification (CAV) , July 14-20, 2011 , Cliff Lodge, Snowbird, Utah (In Press) (2011)

  • An Expressive Mechanism for Auctions on the Web.
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar In: Proc. 20th IW3C2 International World Wide Web Conference (WWW) , March 28 - April 1, 2011 , HICC Hyderabad, India (2011)

  • Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification
    Henzinger, Monika and Chatterjee, Krishnendu In: Symposium on Discrete Algorithms (SODA) , 2010-09-28 , San Francisco, USA (2011)

  • Online Stochastic Packing applied to Display Ad Allocation
    Feldman, Jon and Henzinger, Monika and Korula, Nitish and Mirrokni, Vahab and Stein, Cliff In: 18th Annual European Symposium on Algorithms, 6th - 8th of September 2010 , 2010-09-06 , University of Liverpool, United Kingdom (2010)

  • Mechanisms for the Marriage and the Assignment Game
    Duetting, Paul and Henzinger, Monika In: International Conference on Algorithms and Complexity (CIAC 2010) , 2010-03-18 , Rome (2010)

  • Sponsored Search, Market Equilibria, and the Hungarian Method.
    Dütting, Paul and Henzinger, Monika and Weber, Ingmar In: 27th International Symposium on Theoretical Aspects of Computer Science , 2010-03-04 , Nancy, France (2010)

  • Mechanisms for the Marriage and the Assignment Game
    Dütting, Paul and Henzinger, Monika In: 7th International Conference, CIAC 2010, , May 26-28, 2010. , Italy, Rome (2010)

  • How Much is Your Personal Recommendation Worth?
    Duetting, Paul and Henzinger, Monika and Weber, Ingmar In: International World Wide Web Conference , 2010-05-10 , Raleigh, NC, USA (2010)

  • Detecting the Origin of Text Segments Efficiently
    Abdel-Hamid, Ossama and Behzadi, Behshad and Christoph, Stefan and Henzinger, Monika In: Proc. 18th IW3C2 International World Wide Web Conference , April 20 - 24, 2009 , Madrid (2009)

  • Purely URL-based Topic Classification
    Baykan, Eda and Henzinger, Monika and Marian, Ludmila and Weber, Ingmar In: World Wide Web , 2009-04-20 , Madrid (2009)

  • Bidder Optimal Assignments for General Utilities
    Duetting, Paul and Henzinger, Monika and Weber, Ingmar In: Workshop on Network and Internet Economics (WINE) , 2009-10-23 , Rome (2009)

  • A Comparison of Techniques for Sampling Web Pages
    Baykan, Eda and Henzinger, Monika and Keller, Stefan and De Castelberg, Sebastian and Kinzler, Markus In: STACS , 2009-10-23 , Freiburg (2009)

  • Web Page Language Identification Based on URLs
    Baykan, Eda and Henzinger, Monika and Weber, Ingmar In: Very Large Data Bases (VLDB) , 2009-10-23 , Auckland (2008)

  • Finding Near-Duplicate Web Pages: A Large-Scale Evaluation of Algorithms
    Henzinger, Monika In: ACM SIGIR , 2009-10-23 , Seattle (2006)

    • Book Section/Chapter

  • Vienna Graph Clustering
    Biedermann, Sonja and Henzinger, Monika and Schulz, Christian and Schuster, Bernhard In: Protein-Protein Interaction Networks. Methods in Molecular Biology. Humana, New York, NY (2019)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: Encyclopedia of Algorithms. Springer, pp. 600-602 (2016)

  • PageRank Algorithm
    Henzinger, Monika In: Encyclopedia of Algorithms. Springer, pp. 1509-1511 (2016)

  • PageRank Algorithm
    Henzinger, Monika In: Encyclopedia of Algorithms. UNSPECIFIED (2008)

    • This list was generated on Wed Nov 20 14:18:16 2024 CET.
    Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
    EPrints Logo
    CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.