A New Hybrid Genetic Algorithm for Maximum Independent Set Problem. - Saeed Mehrabi 001; Abbas Mehrabi; Ali D. Mehrabi (ICSOFT (2), 2009)

On Efficiency of Evolutionary Algorithms for Finding Large Independent Sets. - Saeed Mehrabi 001 (IICAI, 2009)

A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem. - Ali D. Mehrabi; Saeed Mehrabi 001; Abbas Mehrabi (IJCCI, 2009)

Realizing Site Permutations. - Stephane Durocher; Saeed Mehrabi 001; Debajyoti Mondal; Matthew Skala (CCCG, 2011)

The Cover Contact Graph of Discs Touching a Line. - Stephane Durocher; Saeed Mehrabi 001; Matthew Skala; Mohammad Abdul Wahid (CCCG, 2012)

Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number. - Stephane Durocher; Saeed Mehrabi 001 (COCOON, 2012)

On k-Enclosing Objects in a Coloured Point Set. - Luis Barba; Stephane Durocher; Robert Fraser; Ferran Hurtado; Saeed Mehrabi 001; Debajyoti Mondal; Jason Morrison; Matthew Skala; Mohammad Abdul Wahid (CCCG, 2013)

Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results. - Stephane Durocher; Saeed Mehrabi 001 (MFCS, 2013)

A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. - Stephane Durocher; Robert Fraser; Saeed Mehrabi 001 (CoRR, 2013)

New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras - Stephane Durocher; Saeed Mehrabi 001 (CoRR, 2013)

Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. - Mark de Berg; Stephane Durocher; Saeed Mehrabi 001 (COCOA, 2014)

A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. - Stephane Durocher; Saeed Mehrabi 001 (IWOCA, 2014)

Drawing HV-Restricted Planar Graphs. - Stephane Durocher; Stefan Felsner; Saeed Mehrabi 001; Debajyoti Mondal (LATIN, 2014)

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. - Stephane Durocher; Omrit Filtser; Robert Fraser; Ali D. Mehrabi; Saeed Mehrabi 001 (LATIN, 2014)

Guarding Orthogonal Terrains. - Stephane Durocher; Pak Ching Li; Saeed Mehrabi 001 (CCCG, 2015)

A Note on Approximating 2-Transmitters. - Saeed Mehrabi 001; Abbas Mehrabi (CoRR, 2015)

Guarding the Vertices of an Orthogonal Terrain using Vertex Guards. - Saeed Mehrabi 001 (CoRR, 2015)

Sliding k-Transmitters: Hardness and Approximation. - Therese Biedl; Saeed Mehrabi 001; Ziting Yu (CCCG, 2016)

Rectangle-of-influence triangulations. - Therese Biedl; Anna Lubiw; Saeed Mehrabi 001; Sander Verdonschot (CCCG, 2016)

Geometric Unique Set Cover on Unit Disks and Unit Squares. - Saeed Mehrabi 001 (CCCG, 2016)

Polygon Simplification by Minimizing Convex Corners. - Yeganeh Bahoo; Stephane Durocher; J. Mark Keil; Saeed Mehrabi 001; Sahar Mehrpour; Debajyoti Mondal (COCOON, 2016)

1-Bend RAC Drawings of 1-Planar Graphs. - Walter Didimo; Giuseppe Liotta; Saeed Mehrabi 001; Fabrizio Montecchiani (GD, 2016)

On r-Guarding Thin Orthogonal Polygons. - Therese Biedl; Saeed Mehrabi 001 (ISAAC, 2016)

Unique Set Cover on Unit Disks and Unit Squares. - Saeed Mehrabi 001 (CoRR, 2016)

Packing Boundary-Anchored Rectangles. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (CCCG, 2017)

On Guarding Orthogonal Polygons with Bounded Treewidth. - Therese Biedl; Saeed Mehrabi 001 (CCCG, 2017)

Approximating Weighted Duo-Preservation in Comparative Genomics. - Saeed Mehrabi 001 (COCOON, 2017)

Grid-Obstacle Representations with Connections to Staircase Guarding. - Therese Biedl; Saeed Mehrabi 001 (GD, 2017)

Evacuating an Equilateral Triangle in the Face-to-Face Model. - Huda Chuangpishit; Saeed Mehrabi 001; Lata Narayanan; Jaroslav Opatrny (OPODIS, 2017)

On Guarding Orthogonal Polygons with Sliding Cameras. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour (WALCOM, 2017)

Approximating Domination on Intersection Graphs of Paths on a Grid. - Saeed Mehrabi 001 (WAOA, 2017)

Guarding orthogonal art galleries with sliding cameras. - Stephane Durocher; Omrit Filtser; Robert Fraser; Ali D. Mehrabi; Saeed Mehrabi 001 (Comput. Geom., 2017)

Approximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs. - Saeed Mehrabi 001 (CoRR, 2017)

A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid. - Saeed Mehrabi 001 (CoRR, 2017)

On RAC drawings of 1-planar graphs. - Michael A. Bekos; Walter Didimo; Giuseppe Liotta; Saeed Mehrabi 001; Fabrizio Montecchiani (Theor. Comput. Sci., 2017)

Computing conforming partitions of orthogonal polygons with minimum stabbing number. - Stephane Durocher; Saeed Mehrabi 001 (Theor. Comput. Sci., 2017)

Approximability of Covering Cells with Line Segments. - Paz Carmi; Anil Maheshwari; Saeed Mehrabi 001; Luís Fernando Schultz Xavier da Silveira (COCOA, 2018)

Geodesic Obstacle Representation of Graphs. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Saeed Mehrabi 001; Fabrizio Montecchiani; Pat Morin; Luís Fernando Schultz Xavier da Silveira (ICALP, 2018)

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. - Sayan Bandyapadhyay; Anil Maheshwari; Saeed Mehrabi 001; Subhash Suri (MFCS, 2018)

Boundary Labeling for Rectangular Diagrams. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Saeed Mehrabi 001; Debajyoti Mondal (SWAT, 2018)

Approximating Dominating Set on Intersection Graphs of L-frames. - Sayan Bandyapadhyay; Anil Maheshwari; Saeed Mehrabi 001; Subhash Suri (CoRR, 2018)

Constrained Orthogonal Segment Stabbing. - Sayan Bandyapadhyay; Saeed Mehrabi 001 (CCCG, 2019)

On the Minimum Consistent Subset Problem. - Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi 001; Michiel H. M. Smid (WADS, 2019)

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Anil Maheshwari; Saeed Mehrabi 001; Debajyoti Mondal; Michiel H. M. Smid (WADS, 2019)

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour; Ziting Yu (Algorithmica, 2019)

Covering Points with Pairs of Concentric Disks. - Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy; Michiel Smid (CCCG, 2020)

Parameterized Complexity of Two-Interval Pattern Problem. - Prosenjit Bose; Saeed Mehrabi 001; Debajyoti Mondal (SWAT, 2020)

Maximum Bipartite Subgraph of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (WALCOM, 2020)

Packing boundary-anchored rectangles and squares. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (Comput. Geom., 2020)

Evacuating equilateral triangles and squares in the face-to-face model. - Huda Chuangpishit; Saeed Mehrabi 001; Lata Narayanan; Jaroslav Opatrny (Comput. Geom., 2020)

(Faster) Multi-Sided Boundary Labelling. - Prosenjit Bose; Saeed Mehrabi 001; Debajyoti Mondal (CoRR, 2020)

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. - Stephane Durocher; J. Mark Keil; Saeed Mehrabi 001; Debajyoti Mondal (COCOON, 2021)

Shortest Beer Path Queries in Outerplanar Graphs. - Joyce Bacic; Saeed Mehrabi 001; Michiel Smid (ISAAC, 2021)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 001; Irene Parada; Pavel Valtr 001 (WALCOM, 2021)

Faster Multi-sided One-Bend Boundary Labelling. - Prosenjit Bose; Saeed Mehrabi 001; Debajyoti Mondal (WALCOM, 2021)

On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. - Therese Biedl; Saeed Mehrabi 001 (Algorithmica, 2021)

Maximum Bipartite Subgraphs of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (Int. J. Comput. Geom. Appl., 2023)