Idan Shabat

According to our database, Idan Shabat authored at least 7 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Spanning and Metric Tree Covers Parameterized by Treewidth.

Michael Elkin, Idan Shabat

CoRR, November, 2025

2024

Path-Reporting Distance Oracles with Linear Size.

Ofer Neiman, Idan Shabat

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

On the Size Overhead of Pairwise Spanners.

Ofer Neiman, Idan Shabat

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Path-Reporting Distance Oracles with Near-Logarithmic Stretch and Linear Size.

Michael Elkin, Idan Shabat

CoRR, 2023

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n).

Michael Elkin, Idan Shabat

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

A Unified Framework for Hopsets.

Ofer Neiman, Idan Shabat

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A Unified Framework for Hopsets and Spanners.

Idan Shabat, Ofer Neiman

CoRR, 2021