Dynamic Rank, Basis, and Matching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brand, Jan van den, Kumar, Vishal, Zhang, Daniel J.
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computing Flows in Subquadratic Space
par: Brand, Jan van den, et autres
Publié: (2026)

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
par: Brand, Jan van den, et autres
Publié: (2025)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
par: Brand, Jan van den, et autres
Publié: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
par: Brand, Jan van den, et autres
Publié: (2026)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
par: Feng, Yilong, et autres
Publié: (2025)

Greedy Dynamic Matching
par: Arnosti, Nick, et autres
Publié: (2025)

A Dynamic Low-Rank Fast Gaussian Transform
par: Huang, Baihe, et autres
Publié: (2022)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
par: Bernstein, Aaron, et autres
Publié: (2024)

Efficient Dynamic Rank Aggregation
par: Alimi, Morteza, et autres
Publié: (2025)

Dynamic Pattern Matching with Wildcards
par: Naeini, Arshia Ataee, et autres
Publié: (2026)

Dynamic PageRank: Algorithms and Lower Bounds
par: Jayaram, Rajesh, et autres
Publié: (2024)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
par: Behnezhad, Soheil, et autres
Publié: (2024)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Potential-Based Greedy Matching for Dynamic Delivery Pooling
par: Ma, Hongyao, et autres
Publié: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
par: Kuszmaul, William, et autres
Publié: (2025)

On the Parallel Complexity of Finding a Matroid Basis
par: Khanna, Sanjeev, et autres
Publié: (2025)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
par: Chuzhoy, Julia, et autres
Publié: (2026)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
par: El-Hayek, Antoine, et autres
Publié: (2023)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
par: Liu, Yang P.
Publié: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
par: Duyster, Anouk, et autres
Publié: (2025)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
par: Boneh, Itai, et autres
Publié: (2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
par: Goranci, Gramoz, et autres
Publié: (2025)

Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
par: Diwan, Haya, et autres
Publié: (2025)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
par: Kumar, Rinku, et autres
Publié: (2025)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
par: Assadi, Sepehr, et autres
Publié: (2024)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
par: Rahat, Md. Tanzeem, et autres
Publié: (2025)

QuadRank: Engineering a High Throughput Rank
par: Koerkamp, R. Groot
Publié: (2026)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
par: Arndt, Stephen, et autres
Publié: (2026)

Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
par: Hellerstein, Lisa, et autres
Publié: (2026)

From Dynamic Programs to Greedy Algorithms
par: van Melkebeek, Dieter
Publié: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
par: Bernstein, Aaron, et autres
Publié: (2025)

Consistent Low-Rank Approximation
par: Woodruff, David P., et autres
Publié: (2026)

Transversal Rank, Conformality and Enumeration
par: Schirneck, Martin
Publié: (2026)

Cartesian Forest Matching
par: Auvray, Bastien, et autres
Publié: (2025)

Caching Connections in Matchings
par: Sadeh, Yaniv, et autres
Publié: (2023)

Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
par: Jiang, Tianle, et autres
Publié: (2024)

Compressed Dictionary Matching on Run-Length Encoded Strings
par: Bille, Philip, et autres
Publié: (2025)