Full Text Available
Access Full Text at Repository
Search Results - JDSA~
-
Constructing Suffixient Arrays Revisited
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
Online Article RSS Article -
Faster Iterative $φ$ Queries on the Positional BWT
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Nearly-Tight Bounds for Zonotope Containment and Beyond
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Fast decremental tree sums in forests
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Designing Capacitated Subnetworks for Shortest Path Routing
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Contrastive Identification and Generation in the Limit
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
The Pareto Frontier of Randomized Learning-Augmented Online Bidding
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Nearly Optimal Attention Coresets
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
A Separator for Minor-Free Graphs Beyond the Flow Barrier
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Towards Settling the Complexity of the Lettericity Problem
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Touring a Sequence of Orthogonal Polygons
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text