vix.ing · top · new · best · stats · spec

Monika Henzinger

  1. Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on\n One-Pass Dynamic Streams
    2015/04/09 by Sayan Bhattacharya, Monika Henzinger, Bhattacharya, Sayan +5 · 5 citations
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Advanced Graph Theory Research
  2. A New Deterministic Algorithm for Dynamic Set Cover
    2019/09/25 by Sayan Bhattacharya, Monika Henzinger, Bhattacharya, Sayan +3 · 5 citations
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Computational Geometry and Mesh Generation
  3. Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
    2020/02/25 by Sayan Bhattacharya, Monika Henzinger, Bhattacharya, Sayan +5 · 4 citations
    Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Mathematical Approximation and Integration
  4. Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
    2020/05/05 by Li Chen, Chen, Li, Gramoz Goranci +7 · 4 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  5. Design of Dynamic Algorithms via Primal-Dual Method
    2016/04/18 by Sayan Bhattacharya, Bhattacharya, Sayan, Monika Henzinger +3 · 3 citations
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Advanced Graph Theory Research
  6. Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity
    2020/02/24 by Monika Henzinger, Stefan Neumann, Henzinger, Monika +3 · 3 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  7. Fully Dynamic Exact Edge Connectivity in Sublinear Time
    2023/02/12 by Gramoz Goranci, Monika Henzinger, Goranci, Gramoz +9 · 4 citations
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Interconnection Networks and Systems
  8. Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
    2024/01/11 by Monika Henzinger, Jason Li, Henzinger, Monika +5 · 5 citations
    Computer Science · Physics and Astronomy · #Advanced Graph Neural Networks #Complex Network Analysis Techniques #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  9. Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
    2024/02/27 by Kyriakos Axiotis, Vincent Cohen-Addad, Axiotis, Kyriakos +13 · 5 citations
    Computer Science · #Anomaly Detection Techniques and Applications #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Face and Expression Recognition #Machine Learning (cs.LG) #Machine Learning and Data Classification
  10. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional\n Matching in O(1) Amortized Update Time
    2016/11/01 by Sayan Bhattacharya, Bhattacharya, Sayan, Deeparnab Chakrabarty +3 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  11. Analysis of a very large web search engine query log
    1999/09/01 by Craig Silverstein, Hannes Marais, Monika Henzinger +1 · 1 citation
    Computer Science · #Data Management and Algorithms #Information Retrieval and Search Behavior #Web Data Mining and Analysis
  12. New Deterministic Approximation Algorithms for Fully Dynamic Matching
    2016/04/19 by Sayan Bhattacharya, Bhattacharya, Sayan, Monika Henzinger +3 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Privacy-Preserving Technologies in Data
  13. Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with\n Applications
    2020/04/21 by Sebastian Förster, Forster, Sebastian, Gramoz Goranci +3 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods
  14. Online Min-Max Paging
    2022/12/06 by Ashish Chiplunkar, Monika Henzinger, Chiplunkar, Ashish +5 · 2 citations
    Computer Science · Engineering · #Optimization and Search Problems #Complexity and Algorithms in Graphs #Advanced Wireless Network Optimization
  15. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
    2017/04/10 by Sayan Bhattacharya, Monika Henzinger, Bhattacharya, Sayan +3 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Privacy-Preserving Technologies in Data
  16. Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing
    2019/07/10 by Monika Henzinger, Pan Peng, Henzinger, Monika +1 · 1 citation
    Computer Science · Engineering · #Advanced Graph Theory Research #Optimization and Search Problems #Vehicle Routing Optimization Methods
  17. A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
    2020/10/30 by Monika Henzinger, Billy Jin, Henzinger, Monika +3 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems
  18. Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation
    2023/06/17 by Monika Henzinger, Henzinger, Monika, A. R. Sricharan +3 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Privacy-Preserving Technologies in Data
  19. Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
    2024/12/19 by Antoine El-Hayek, Monika Henzinger, El-Hayek, Antoine +3 · 2 citations
    Engineering · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Manufacturing Process and Optimization #Optimization and Packing Problems #Scheduling and Optimization Algorithms
  20. Improved Differentially Private Continual Observation Using Group Algebra
    2024/12/03 by Monika Henzinger, Jalaj Upadhyay, Henzinger, Monika +1 · 2 citations
    Computer Science · #Cryptography and Data Security
  21. Correlated Noise Mechanisms for Differentially Private Learning
    2025/06/09 by Krishna Pillutla, Jalaj Upadhyay, Pillutla, Krishna +21 · 3 citations
    Computer Science · Mathematics · #Privacy-Preserving Technologies in Data #Stochastic Gradient Optimization Techniques #Random Matrices and Applications
  22. Efficient Contractions of Dynamic Graphs - With Applications
    2025/01/01 by Monika Henzinger, Evangelos Kosinas, Robin Münk +5 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Graph Theory and Algorithms
  23. Edit-Neighboring Data Streams and Privacy under Continual Observation
    2026/07/22 by Joel Daniel Andersson, Anamay Chaturvedi, Monika Henzinger +1
    #cs.DS #cs.CR