Please note that the authors of articles/papers in theoretical computer science are listed in alphabetical order of their last name. A list of my publications can be also found on my dblp and my Google scholar profiles.


Journal articles

  1. Polygon Simplification by Minimizing Convex Corners.
    Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, and Debajyoti Mondal.
    Accepted in Theoretical Computer Science. 2019.
  2. Packing Boundary-Anchored Rectangles and Squares.
    Therese Biedl, Ahmad Biniaz, Anil Maheshwari, and Saeed Mehrabi.
    Accepted in Computational Geometry: Theory and Applications. 2019.
  3. Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames.
    Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, and Subhash Suri.
    Computational Geometry: Theory and Applications. 82: 32-44. 2019. [doi]
  4. Approximability of Covering Cells with Line Segments.
    Paz Carmi, Anil Maheshwari, Saeed Mehrabi, and Luis Fernando S. X. da Silveira.
    Theoretical Computer Science. 784: 133-141. 2019. [doi]
  5. Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.
    Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, and Ziting Yu.
    Algorithmica. 81(1):69-97. 2019. [doi]
  6. Computing Conforming Partitions of Orthogonal Polygons with Minimum Stabbing Number.
    Stephane Durocher, and Saeed Mehrabi.
    Theoretical Computer Science. 689:157-168. 2017. [doi]
  7. Guarding Monotone Art Galleries with Sliding Cameras in Linear Time.
    Mark de Berg, Stephane Durocher, and Saeed Mehrabi.
    Journal of Discrete Algorithms. 44:39-47. 2017. [doi]
  8. On RAC Drawings of 1-Planar Graphs.
    Michael Bekos, Walter Didimo, Giuseppe Liotta. Saeed Mehrabi, and Fabrizio Montecchiani.
    Theoretical Computer Science. 689:48-57. 2017. [doi]
  9. Guarding Orthogonal Art Galleries with Sliding Cameras.
    Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, and Saeed Mehrabi.
    Computational Geometry: Theory and Applications. 65:12-26. 2017. [doi]

Conference papers

  1. Constrained Orthogonal Segment Stabbing.
    Sayan Bandyapadhyay, and Saeed Mehrabi.
    In proceedings of the 31st Canadian Conference in Computational Geometry (CCCG 2019). 2019.
  2. Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.
    Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, and Michiel Smid.
    In proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2019). 2019.
  3. On the Minimum Consistent Subset Problem.
    Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, and Michiel Smid.
    In proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2019). 2019.
  4. Approximability of Covering Cells with Line Segments.
    Paz Carmi, Anil Maheshwari, Saeed Mehrabi, and Luis Fernando S. X. da Silveira.
    In proceedings of the 12th International Conference on Combinatorial Optimization and Applications (COCOA 2018), pages 436-448. 2018. [doi]
  5. Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames.
    Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, and Subhash Suri.
    In proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), 37:1-37:15. 2018. [doi]
  6. Geodesic Obstacle Representation of Graphs.
    Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, and Luis Fernando S. X. da Silveira.
    In proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 23:1-23:13. 2018. [doi]
  7. Boundary Labeling for Rectangular Diagrams.
    Prosenjit Bose, Paz Carmi, Saeed Mehrabi, J. Mark Keil, and Debajyoti Mondal.
    In proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 12:1-12:14. 2018. [doi]
  8. Approximating Domination on Intersection Graphs of Paths on a Grid.
    Saeed Mehrabi.
    In proceedings of the 15th International Workshop on Approximation and Online Algorithms (WAOA 2017), pages 76-89. 2017. [doi]
  9. Evacuating an Equilateral Triangle in the Face-to-Face Model.
    Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, and Jaroslav Opatrny.
    In proceedings of the 21st International Conference on Principles of Distributed Systems (OPODIS 2017), 11:1-11:16. 2017. [doi]
  10. Grid-Obstacle Representations with Connections to Staircase Guarding.
    Therese Biedl, and Saeed Mehrabi.
    In proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), pages 81-87. 2017. [doi]
  11. On Guarding Orthogonal Polygons with Sliding Cameras.
    Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, and Hamideh Vosoughpour.
    In proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), pages 54-65. 2017. [doi]
  12. Approximating Weighted Duo-Preservation in Comparative Genomics.
    Saeed Mehrabi.
    In proceedings of the 23rd International Computing and Combinatorics Conference (COCOON 2017), pages 396-406. 2016. [doi]
  13. Packing Boundary-Anchored Rectangles.
    Therese Biedl, Ahmad Biniaz, Anil Maheshwari, and Saeed Mehrabi.
    In proceedings of the 29th Canadian Conference on Computational Geometry (CCCG 2017), pages 138-143. 2017.
  14. On Guarding Orthogonal Polygons with Bounded Treewidth.
    Therese Biedl, and Saeed Mehrabi.
    In proceedings of the 29th Canadian Conference on Computational Geometry (CCCG 2017), pages 150-155. 2017.
  15. On r-Guarding Thin Orthogonal Polygons.
    Therese Biedl, and Saeed Mehrabi.
    In proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), 17:1-17:13. 2016. [doi]
  16. 1-Bend RAC Drawings of 1-Planar Graphs.
    Walter Didimo, Giuseppe Liotta. Saeed Mehrabi, and Fabrizio Montecchiani.
    In proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), pages 335-343. 2016. [doi]
  17. Polygon Simplification by Minimizing Convex Corners.
    Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, and Debajyoti Mondal.
    In proceedings of the 22nd International Computing and Combinatorics Conference (COCOON 2016), pages 547-559. 2016. [doi]
  18. Rectangle-of-influence Triangulations.
    Saeed Mehrabi.
    In proceedings of the 28th Canadian Conference on Computational Geometry (CCCG 2016), pages 195-200. 2016.
  19. Geometric Unique Set Cover on Unit Disks and Unit Squares.
    Therese Biedl, Anna Lubiw, Saeed Mehrabi, and Sander Verdonschot.
    In proceedings of the 28th Canadian Conference on Computational Geometry (CCCG 2016), pages 237-243. 2016.
  20. Sliding k-Transmitters: Hardness and Approximation.
    Therese Biedl, Saeed Mehrabi, and Ziting Yu.
    In proceedings of the 28th Canadian Conference on Computational Geometry (CCCG 2016), pages 63-68. 2016.
  21. Guarding Orthogonal Terrains.
    Stephane Durocher, Pak Ching Li, and Saeed Mehrabi.
    In proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015). 2015.
  22. Guarding Monotone Art Galleries with Sliding Cameras in Linear Time.
    Mark de Berg, Stephane Durocher, and Saeed Mehrabi.
    In proceedings of the 8th International Conference on Combinatorial Optimization and Applications (COCOA 2014), pages 113-125. 2014. [doi]
  23. A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
    Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, and Saeed Mehrabi.
    In proceedings of the 11th Latin American Theoretical Informatics Symposium (LATIN 2014), pages 294-305. 2014. [doi]
  24. Drawing HV-Restricted Planar Graphs.
    Stephane Durocher, Stefan Felsner, Saeed Mehrabi, and Debajyoti Mondal.
    In proceedings of the 11th Latin American Theoretical Informatics Symposium (LATIN 2014), pages 156-167. 2014. [doi]
  25. A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
    Stephane Durocher, and Saeed Mehrabi.
    In proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), pages 140-152. 2014. [doi]
  26. Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results.
    Stephane Durocher, and Saeed Mehrabi.
    In proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), pages 314-324. 2013. [doi]
  27. On k-Enclosing Objects in a Coloured Point Set.
    Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, and Mohammad Abdul Wahid.
    In proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013). 2013. [doi]
  28. Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number.
    Stephane Durocher, and Saeed Mehrabi.
    In proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON 2012), pages 228-239. 2012. [doi]
  29. The Cover Contact Graph of Discs Touching a Line.
    Stephane Durocher, Saeed Mehrabi, Matthew Skala, and Mohammad Abdul Wahid.
    In proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), pages 59-64. 2012. [doi]
  30. Realizing Site Permutations.
    Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, and Matthew Skala.
    In proceedings of the 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011). 2011. [doi]

Theses

  1. Geometric Optimization Problems on Orthogonal Polygons: Hardness Results and Approximation Algorithms.
    Saeed Mehrabi.
    PhD Thesis, University of Manitoba. August 2015. [doi]
  2. Online Problems in Facility Location.
    Saeed Mehrabi.
    Master's Thesis, University of Manitoba. August 2012. [doi]