Cover Image

Dynamic Hierarchical $j$-Tree Decomposition and Its Applications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goranci, Gramoz, Henzinger, Monika, Kiss, Peter, Momeni, Ali, Zöcklein, Gernot
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fully Dynamic Spectral Sparsification of Hypergraphs
by: Goranci, Gramoz, et al.
Published: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
by: Forster, Sebastian, et al.
Published: (2025)

Fully Dynamic Algorithms for Transitive Reduction
by: Goranci, Gramoz, et al.
Published: (2025)

Fully Dynamic Algorithms for Chamfer Distance
by: Goranci, Gramoz, et al.
Published: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
by: Goranci, Gramoz, et al.
Published: (2023)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
by: Goranci, Gramoz, et al.
Published: (2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
by: Goranci, Gramoz, et al.
Published: (2025)

Bootstrapping Dynamic APSP via Sparsification
by: Kyng, Rasmus, et al.
Published: (2024)

A Simple Dynamic Spanner via APSP
by: Kyng, Rasmus, et al.
Published: (2024)

Dynamic algorithms for k-center on graphs
by: Cruciani, Emilio, et al.
Published: (2023)

Faster Graph Embeddings via Coarsening
by: Fahrbach, Matthew, et al.
Published: (2020)

Efficient Contractions of Dynamic Graphs -- with Applications
by: Henzinger, Monika, et al.
Published: (2025)

An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time
by: Henzinger, Monika, et al.
Published: (2025)

Improved Differentially Private Continual Observation Using Group Algebra
by: Henzinger, Monika, et al.
Published: (2024)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
by: El-Hayek, Antoine, et al.
Published: (2023)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
by: El-Hayek, Antoine, et al.
Published: (2024)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
by: Zheng, Da Wei, et al.
Published: (2023)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
by: Henzinger, Monika, et al.
Published: (2024)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
by: la Tour, Max Dupré, et al.
Published: (2024)

Concurrent Composition for Differentially Private Continual Mechanisms
by: Henzinger, Monika, et al.
Published: (2024)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
by: El-Hayek, Antoine, et al.
Published: (2025)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
by: Henzinger, Monika, et al.
Published: (2024)

Improved Lower Bounds for Privacy under Continual Release
by: Aryanfard, Bardiya, et al.
Published: (2025)

Catalytic Tree Evaluation From Matching Vectors
by: Henzinger, Alexandra, et al.
Published: (2026)

Near-Optimal Generalized Private Testing
by: Chaturvedi, Anamay, et al.
Published: (2026)

Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
by: Fichtenberger, Hendrik, et al.
Published: (2022)

Differentially Private Algorithms for Graphs Under Continual Observation
by: Fichtenberger, Hendrik, et al.
Published: (2021)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
by: Bhattacharya, Sayan, et al.
Published: (2023)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
by: Assadi, Sepehr, et al.
Published: (2024)

Dynamically Maintaining the Persistent Homology of Time Series
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
by: Hanauer, Kathrin, et al.
Published: (2023)

Binned Group Algebra Factorization for Differentially Private Continual Counting
by: Henzinger, Monika, et al.
Published: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
by: Bernstein, Aaron, et al.
Published: (2025)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
by: Bhattacharya, Sayan, et al.
Published: (2023)

Differentially Private Continual Release of Histograms and Related Queries
by: Henzinger, Monika, et al.
Published: (2023)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
by: Henzinger, Monika, et al.
Published: (2024)

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
by: Bernstein, Aaron, et al.
Published: (2025)

Almost Tight Error Bounds on Differentially Private Continual Counting
by: Henzinger, Monika, et al.
Published: (2022)

Expander Hierarchies for Normalized Cuts on Graphs
by: Hanauer, Kathrin, et al.
Published: (2024)

Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting
by: Henzinger, Monika, et al.
Published: (2025)