:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Dondi, Riccardo, Hosseinzadeh, Mohammad Mehdi
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2604.25589
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Novel Complexity Results for Temporal Separators with Deadlines
by: Dondi, Riccardo, et al.
Published: (2025)

Matching and Edge Cover in Temporal Graphs
by: Cioni, Lapo, et al.
Published: (2025)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
by: Aubian, Guillaume, et al.
Published: (2025)

Instance Dependent Testing of Samplers using Interval Conditioning
by: Bhattacharyya, Rishiraj, et al.
Published: (2025)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
by: Stamm, Felix I., et al.
Published: (2025)

Interval Selection with Binary Predictions
by: Karavasilis, Christodoulos
Published: (2025)

Exactly Hittable Interval Graphs
by: Dhannya, S. M., et al.
Published: (2023)

Interval Selection in Sliding Windows
by: Alexandru, Cezar-Mihail, et al.
Published: (2024)

Random-Order Interval Selection
by: Borodin, Allan, et al.
Published: (2024)

Temporal Betweenness Centrality on Shortest Walks Variants
by: Naima, Mehdi
Published: (2023)

Computational Complexity of the Interval Ordering Problem
by: Pawlowski, Simeon, et al.
Published: (2026)

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
by: Gribelyuk, Elena, et al.
Published: (2024)

Unit Interval Selection in Random Order Streams
by: Alexandru, Cezar-Mihail, et al.
Published: (2026)

Interval-Constrained Bipartite Matching over Time
by: Abels, Andreas, et al.
Published: (2024)

Hitting Geodesic Intervals in Structurally Restricted Graphs
by: Gima, Tatsuya, et al.
Published: (2025)

Distributionally Robust $k$-of-$n$ Sequential Testing
by: Tan, Rayen, et al.
Published: (2026)

On the FirstFit Algorithm for Online Unit-Interval Coloring
by: Krekelberg, Bob, et al.
Published: (2025)

Property Testing of Computational Networks
by: Czumaj, Artur, et al.
Published: (2025)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
by: Honorato-Droguett, Nicolás, et al.
Published: (2023)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
by: Wlodarczyk, Michal
Published: (2023)

Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks
by: Srikanth, Mithinti, et al.
Published: (2024)

Implementation Of Dynamic De Bruijn Graphs Via Learned Index
by: Nigrelli, Riccardo
Published: (2024)

Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)

Maximizing Reachability via Shifting of Temporal Paths
by: Deligkas, Argyrios, et al.
Published: (2026)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
by: Chaplick, Steven, et al.
Published: (2024)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
by: Anand, Aditya, et al.
Published: (2025)

Connectivity-Preserving Minimum Separator in AT-free Graphs
by: Kenig, Batya
Published: (2025)

Separating $k$-Median from the Supplier Version
by: Anand, Aditya, et al.
Published: (2024)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
by: Bérczi, Kristóf, et al.
Published: (2025)

New Separations and Reductions for Directed Preservers and Hopsets
by: Hoppenworth, Gary, et al.
Published: (2024)

Top-k Stabbing Interval Queries
by: Akram, Waseem, et al.
Published: (2024)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)

Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
by: Nadimpalli, Shivam, et al.
Published: (2024)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
by: Aamand, Anders, et al.
Published: (2024)

Separator Theorem for Minor-Free Graphs in Linear Time
by: Bonnet, Édouard, et al.
Published: (2025)

Sublinear Algorithms for TSP via Path Covers
by: Behnezhad, Soheil, et al.
Published: (2023)

Competitive Online Transportation Simplified
by: Arndt, Stephen, et al.
Published: (2025)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
by: Heck, Sophia, et al.
Published: (2026)

Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
by: Woodruff, David P., et al.
Published: (2024)