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

Henzinger, Monika

  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. Online Stochastic Packing Applied to Display Ad Allocation
    2010/01/28 by Feldman, Jon, Henzinger, Monika, Korula, Nitish +2 · 4 citations
    #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences
  3. Dynamic Algorithms for Graph Coloring
    2017/11/12 by Bhattacharya, Sayan, Chakrabarty, Deeparnab, Henzinger, Monika +1 · 5 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  4. 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
  5. Fully-Dynamic Coresets
    2020/04/30 by Henzinger, Monika, Kale, Sagar · 4 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  6. Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
    2020/02/25 by Sayan Bhattacharya, Bhattacharya, Sayan, Monika Henzinger +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
  7. Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
    2020/05/05 by Li Chen, Gramoz Goranci, Chen, Li +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
  8. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
    2014/12/03 by Bhattacharya, Sayan, Henzinger, Monika, Italiano, Giuseppe F. · 3 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  9. 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
  10. 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
  11. Recent Advances in Fully Dynamic Graph Algorithms
    2021/02/22 by Hanauer, Kathrin, Henzinger, Monika, Schulz, Christian · 3 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  12. Fully Dynamic Exact Edge Connectivity in Sublinear Time
    2023/02/12 by Gramoz Goranci, Goranci, Gramoz, Monika Henzinger +9 · 4 citations
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Interconnection Networks and Systems
  13. 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
  14. Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
    2024/02/27 by Kyriakos Axiotis, Axiotis, Kyriakos, Vincent Cohen-Addad +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
  15. 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
  16. Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
    2022/02/23 by Fichtenberger, Hendrik, Henzinger, Monika, Upadhyay, Jalaj · 3 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  17. 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
  18. Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with\n Applications
    2020/04/21 by Sebastian Förster, Gramoz Goranci, Forster, Sebastian +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
  19. Differentially Private Algorithms for Graphs Under Continual Observation
    2021/06/28 by Fichtenberger, Hendrik, Henzinger, Monika, Ost, Lara · 2 citations
    #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  20. Online Min-Max Paging
    2022/12/06 by Ashish Chiplunkar, Chiplunkar, Ashish, Monika Henzinger +5 · 2 citations
    Computer Science · Engineering · #Optimization and Search Problems #Complexity and Algorithms in Graphs #Advanced Wireless Network Optimization
  21. A Unifying Framework for Differentially Private Sums under Continual Observation
    2023/07/18 by Henzinger, Monika, Upadhyay, Jalaj, Upadhyay, Sarvagya · 2 citations
    #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  22. Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
    2016/04/28 by Cheung, Yun Kuen, Goranci, Gramoz, Henzinger, Monika · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
  23. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
    2017/04/10 by Sayan Bhattacharya, Bhattacharya, Sayan, Monika Henzinger +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
  24. Shared-memory Exact Minimum Cuts
    2018/08/16 by Henzinger, Monika, Noe, Alexander, Schulz, Christian · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  25. Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing
    2019/07/10 by Monika Henzinger, Henzinger, Monika, Pan Peng +1 · 1 citation
    Computer Science · Engineering · #Advanced Graph Theory Research #Optimization and Search Problems #Vehicle Routing Optimization Methods
  26. Finding All Global Minimum Cuts In Practice
    2020/02/17 by Henzinger, Monika, Noe, Alexander, Schulz, Christian +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  27. Faster Fully Dynamic Transitive Closure in Practice
    2020/02/03 by Hanauer, Kathrin, Henzinger, Monika, Schulz, Christian · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  28. Almost Tight Error Bounds on Differentially Private Continual Counting
    2022/11/09 by Henzinger, Monika, Upadhyay, Jalaj, Upadhyay, Sarvagya · 2 citations
    #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  29. Fully Dynamic Four-Vertex Subgraph Counting
    2021/06/29 by Hanauer, Kathrin, Henzinger, Monika, Hua, Qi Cheng · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  30. A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
    2020/10/30 by Monika Henzinger, Henzinger, Monika, Billy Jin +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
  31. Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
    2018/02/26 by Goranci, Gramoz, Henzinger, Monika, Peng, Pan · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  32. A Tree Structure For Dynamic Facility Location
    2019/09/14 by Goranci, Gramoz, Henzinger, Monika, Leniowski, Dariusz · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  33. 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
  34. On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
    2023/07/31 by Henzinger, Monika, Saha, Barna, Seybold, Martin P. +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  35. Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
    2024/12/19 by Antoine El-Hayek, El-Hayek, Antoine, Monika Henzinger +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
  36. 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
  37. Fully Dynamic k-Means Coreset in Near-Optimal Update Time
    2024/06/28 by la Tour, Max Dupré, Henzinger, Monika, Saulpic, David · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  38. Correlated Noise Mechanisms for Differentially Private Learning
    2025/06/09 by Krishna Pillutla, Pillutla, Krishna, Jalaj Upadhyay +21 · 3 citations
    Computer Science · Mathematics · #Privacy-Preserving Technologies in Data #Stochastic Gradient Optimization Techniques #Random Matrices and Applications
  39. Concurrent Composition for Differentially Private Continual Mechanisms
    2024/11/05 by Henzinger, Monika, Safavi, Roodabeh, Vadhan, Salil · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  40. 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