An Optimal Algorithm for Product Structure in Planar Graphs. - Prosenjit Bose; Pat Morin; Saeed Odak (SWAT, 2022)

Connected Dominating Sets in Triangulations. - Prosenjit Bose; Vida Dujmovic; Hussein Houdrouge; Pat Morin; Saeed Odak (CoRR, 2023)

Euclidean Freeze-Tag Problem on Plane. - Saeed Odak; Cyril Gavoille; Nicolas Bonichon; Nicolas Hanusse (CCCG, 2024)

Noncrossing Longest Paths and Cycles. - Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth; Pavel Valtr 001 (GD, 2024)

On k-Planar Graphs Without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (GD, 2024)

On k-planar Graphs without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (CoRR, 2024)

Contiguous Boundary Guarding. - Ahmad Biniaz; Anil Maheshwari; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Thomas C. Shermer (CoRR, 2024)

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. - 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; et al. (SoCG, 2025)

Computing Oriented Spanners and Their Dilation. - Kevin Buchin; Antonia Kalb; Anil Maheshwari; Saeed Odak; Carolin Rehs; Michiel Smid; Sampson Wong (SoCG, 2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs. - Ahmad Biniaz; Prosenjit Bose; Chaeyoon Chung; Jean-Lou De Carufel; John Iacono; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth (WADS, 2025)

On Separating Path and Tree Systems in Graphs. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Babak Miraftab; Saeed Odak; Michiel Smid; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Math. Theor. Comput. Sci., 2025)

Deciding if a DAG is Interesting is Hard. - Jean-Lou De Carufel; Anil Maheshwari; Saeed Odak; Bodhayan Roy; Michiel Smid; Marc Vicuna (CoRR, 2025)