Saeed Odak

20 papers A* 2A 2B 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree.
CoRR
Sándor Kisfaludi-Bak, Saeed Odak, Satyam Singh, Geert van Wordragen
2025 A* conf
Computing Oriented Spanners and Their Dilation.
SoCG
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong
2025 J jnl
Deciding if a DAG is Interesting is Hard.
CoRR
Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak, Bodhayan Roy, Michiel Smid, Marc Vicuna
2025 J jnl
Noncrossing Longest Paths and Cycles.
Graphs Comb.
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2025 J jnl
On Separating Path and Tree Systems in Graphs.
Discret. Math. Theor. Comput. Sci.
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
2025 J jnl
On k-planar Graphs without Short Cycles.
J. Graph Algorithms Appl.
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2025 A* conf
Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems.
SoCG
Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas C. Shermer, Jack Spalding-Jamieson, Rolf Svenning, Da Wei Zheng
2025 B conf
Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
WADS
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2025 J jnl
Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
CoRR
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2024 J jnl
Computing Oriented Spanners and their Dilation.
CoRR
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Michiel Smid, Carolin Rehs, Sampson Wong
2024 J jnl
Contiguous Boundary Guarding.
CoRR
Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Thomas C. Shermer
2024 — conf
Euclidean Freeze-Tag Problem on Plane.
CCCG
Saeed Odak, Cyril Gavoille, Nicolas Bonichon, Nicolas Hanusse
2024 A conf
Noncrossing Longest Paths and Cycles.
GD
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024 J jnl
Noncrossing Longest Paths and Cycles.
CoRR
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024 J jnl
On
CoRR
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2024 A conf
On k-Planar Graphs Without Short Cycles.
GD
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2023 J jnl
Connected Dominating Sets in Triangulations.
CoRR
Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak
2023 J jnl
On Separating Path and Tree Systems in Graphs.
CoRR
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
2022 — conf
An Optimal Algorithm for Product Structure in Planar Graphs.
SWAT
Prosenjit Bose, Pat Morin, Saeed Odak
2022 J jnl
An Optimal Algorithm for Product Structure in Planar Graphs.
CoRR
Prosenjit Bose, Pat Morin, Saeed Odak