:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Karavasilis, Christodoulos
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2502.10314
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

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

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

Investigations on Algorithm Selection for Interval-Based Coding Methods
by: Strutz, Tilo, et al.
Published: (2024)

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

Online Interval Scheduling with Predictions
by: Boyar, Joan, et al.
Published: (2023)

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

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

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

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

Binary Search with Distributional Predictions
by: Dinitz, Michael, et al.
Published: (2024)

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)

Testing Robustness of Temporal Transportation Networks via Interval Separators
by: Dondi, Riccardo, et al.
Published: (2026)

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

A Lock-free Binary Trie
by: Ko, Jeremy
Published: (2024)

Designing Approximate Binary Trees for Trees
by: Kellerhals, Leon, et al.
Published: (2026)

Hardness Amplification for Dynamic Binary Search Trees
by: Jiang, Shunhua, et al.
Published: (2024)

Noisy (Binary) Searching: Simple, Fast and Correct
by: Dereniowski, Dariusz, et al.
Published: (2021)

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

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
by: Ghosal, Angikar, et al.
Published: (2025)

Binary $k$-Center with Missing Entries: Structure Leads to Tractability
by: Soheil, Farehe, et al.
Published: (2025)

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

Asymmetric Number Partitioning with Splitting and Interval Targets
by: Bismuth, Samuel, et al.
Published: (2022)

Online Prediction with Limited Selectivity
by: Liu, Licheng, et al.
Published: (2025)

Computing Time-varying Network Reliability using Binary Decision Diagrams
by: Nakahata, Yu, et al.
Published: (2025)

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
by: Joshi, Amit
Published: (2025)

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

Online Coloring of Short Intervals
by: Chybowska-Sokół, Joanna, et al.
Published: (2018)

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
by: Dinitz, Michael, et al.
Published: (2025)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
by: Hochbaum, Dorit S.
Published: (2024)

A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing
by: Bshouty, Nader H.
Published: (2026)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
by: Dempsey, Jordan, et al.
Published: (2024)

Robust Max Selection
by: Dang, Trung, et al.
Published: (2024)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
by: Prakash, Rudra, et al.
Published: (2026)

HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM)
by: Desai, Mahek, et al.
Published: (2025)

Succinct Encodings of Binary Trees with Application to AVL Trees
by: Chizewer, Jeremy, et al.
Published: (2023)

Hardness of sampling solutions from the Symmetric Binary Perceptron
by: Alaoui, Ahmed El, et al.
Published: (2024)

Combinatorial Selection with Costly Information
by: Chawla, Shuchi, et al.
Published: (2024)