Saeed Odak

According to our database1, Saeed Odak authored at least 12 papers between 2022 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Deciding if a DAG is Interesting is Hard.
CoRR, March, 2025

On Separating Path and Tree Systems in Graphs.
Discret. Math. Theor. Comput. Sci., 2025

Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Computing Oriented Spanners and Their Dilation.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
Contiguous Boundary Guarding.
CoRR, 2024

On <i>k</i>-planar Graphs without Short Cycles.
CoRR, 2024

On k-Planar Graphs Without Short Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Noncrossing Longest Paths and Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Euclidean Freeze-Tag Problem on Plane.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023
Connected Dominating Sets in Triangulations.
CoRR, 2023

2022
An Optimal Algorithm for Product Structure in Planar Graphs.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022


  Loading...