Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaeed Mehrabi 0001
Person information
- affiliation: Carleton University, Ottawa, Canada
- affiliation (former): University of Waterloo, Cheriton School of Computer Science, Canada
- affiliation (PhD): University of Manitoba, Department of Computer Science, Winnipeg, Canada
Other persons with the same name
- Saeed Mehrabi 0003 — Siemens Healthineers, USA (and 3 more)
- Saeed Mehrabi 0004 — Memorial University, St. John's, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j18]Joyce Bacic
, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. Algorithmica 85(6): 1679-1705 (2023)- [j17]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic obstacle representation of graphs. Comput. Geom. 109: 101946 (2023) - [j16]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. Int. J. Comput. Geom. Appl. 33(1&2): 25-41 (2023) - [j15]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33(3&4): 133-157 (2023) - 2022
- [j14]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid:
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103: 101852 (2022) - [j13]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized complexity of two-interval pattern problem. Theor. Comput. Sci. 902: 21-28 (2022) - 2021
- [j12]Therese Biedl, Saeed Mehrabi:
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. Algorithmica 83(2): 641-666 (2021) - [j11]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid:
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [c40]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. COCOON 2021: 203-214 - [c39]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. ISAAC 2021: 62:1-62:16 - [c38]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Faster Multi-sided One-Bend Boundary Labelling. WALCOM 2021: 116-128 - [c37]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - [i30]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. CoRR abs/2108.12464 (2021) - [i29]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. CoRR abs/2110.15693 (2021) - 2020
- [j10]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing boundary-anchored rectangles and squares. Comput. Geom. 88: 101610 (2020) - [j9]Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating equilateral triangles and squares in the face-to-face model. Comput. Geom. 89: 101624 (2020) - [c36]Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - [c35]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. SWAT 2020: 16:1-16:10 - [c34]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM 2020: 158-169 - [i28]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. CoRR abs/2002.05099 (2020) - [i27]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
(Faster) Multi-Sided Boundary Labelling. CoRR abs/2002.09740 (2020)
2010 – 2019
- 2019
- [j8]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu:
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. Algorithmica 81(1): 69-97 (2019) - [j7]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82: 32-44 (2019) - [j6]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of covering cells with line segments. Theor. Comput. Sci. 784: 133-141 (2019) - [j5]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon simplification by minimizing convex corners. Theor. Comput. Sci. 791: 76-86 (2019) - [c33]Sayan Bandyapadhyay, Saeed Mehrabi:
Constrained Orthogonal Segment Stabbing. CCCG 2019: 195-202 - [c32]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c31]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS 2019: 211-224 - [i26]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR abs/1903.07024 (2019) - [i25]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. CoRR abs/1904.06760 (2019) - [i24]Sayan Bandyapadhyay, Saeed Mehrabi:
Constrained Orthogonal Segment Stabbing. CoRR abs/1904.13369 (2019) - [i23]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles and Squares. CoRR abs/1906.11948 (2019) - [i22]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR abs/1909.03896 (2019) - 2018
- [c30]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. COCOA 2018: 436-448 - [c29]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. ICALP 2018: 23:1-23:13 - [c28]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS 2018: 37:1-37:15 - [c27]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. SWAT 2018: 12:1-12:14 - [i21]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. CoRR abs/1803.03705 (2018) - [i20]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR abs/1803.06216 (2018) - [i19]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. CoRR abs/1803.10812 (2018) - [i18]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. CoRR abs/1809.09979 (2018) - [i17]Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. CoRR abs/1810.09232 (2018) - [i16]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon Simplification by Minimizing Convex Corners. CoRR abs/1812.05656 (2018) - [i15]Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model. CoRR abs/1812.10162 (2018) - 2017
- [j4]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
Guarding orthogonal art galleries with sliding cameras. Comput. Geom. 65: 12-26 (2017) - [j3]Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding monotone art galleries with sliding cameras in linear time. J. Discrete Algorithms 44: 39-47 (2017) - [j2]Michael A. Bekos, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689: 48-57 (2017) - [j1]Stephane Durocher, Saeed Mehrabi:
Computing conforming partitions of orthogonal polygons with minimum stabbing number. Theor. Comput. Sci. 689: 157-168 (2017) - [c26]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles. CCCG 2017: 138-143 - [c25]Therese Biedl, Saeed Mehrabi:
On Guarding Orthogonal Polygons with Bounded Treewidth. CCCG 2017: 150-155 - [c24]Saeed Mehrabi:
Approximating Weighted Duo-Preservation in Comparative Genomics. COCOON 2017: 396-406 - [c23]Therese Biedl, Saeed Mehrabi:
Grid-Obstacle Representations with Connections to Staircase Guarding. GD 2017: 81-87 - [c22]Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating an Equilateral Triangle in the Face-to-Face Model. OPODIS 2017: 11:1-11:16 - [c21]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. WALCOM 2017: 54-65 - [c20]Saeed Mehrabi:
Approximating Domination on Intersection Graphs of Paths on a Grid. WAOA 2017: 76-89 - [i14]Saeed Mehrabi:
Approximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs. CoRR abs/1702.05633 (2017) - [i13]Therese Biedl, Saeed Mehrabi:
On Guarding Orthogonal Polygons with Bounded Treewidth. CoRR abs/1706.02028 (2017) - [i12]Therese Biedl, Saeed Mehrabi:
Grid-Obstacle Representations with Connections to Staircase Guarding. CoRR abs/1708.01903 (2017) - [i11]Saeed Mehrabi:
A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid. CoRR abs/1708.09314 (2017) - [i10]Saeed Mehrabi:
Approximating Weighted Duo-Preservation in Comparative Genomics. CoRR abs/1708.09325 (2017) - 2016
- [c19]Therese Biedl, Saeed Mehrabi, Ziting Yu:
Sliding k-Transmitters: Hardness and Approximation. CCCG 2016: 63-68 - [c18]Saeed Mehrabi:
Geometric Unique Set Cover on Unit Disks and Unit Squares. CCCG 2016: 195-200 - [c17]Therese Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot:
Rectangle-of-influence triangulations. CCCG 2016: 237-243 - [c16]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. COCOON 2016: 547-559 - [c15]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. GD 2016: 335-343 - [c14]Therese Biedl, Saeed Mehrabi:
On r-Guarding Thin Orthogonal Polygons. ISAAC 2016: 17:1-17:13 - [i9]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. CoRR abs/1604.07099 (2016) - [i8]Therese Biedl, Saeed Mehrabi:
On r-Guarding Thin Orthogonal Polygons. CoRR abs/1604.07100 (2016) - [i7]Therese Biedl, Saeed Mehrabi, Ziting Yu:
Sliding k-Transmitters: Hardness and Approximation. CoRR abs/1607.07364 (2016) - [i6]Saeed Mehrabi:
Unique Set Cover on Unit Disks and Unit Squares. CoRR abs/1607.07378 (2016) - [i5]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. CoRR abs/1608.08418 (2016) - 2015
- [c13]Stephane Durocher, Pak Ching Li, Saeed Mehrabi:
Guarding Orthogonal Terrains. CCCG 2015 - [i4]Saeed Mehrabi, Abbas Mehrabi:
A Note on Approximating 2-Transmitters. CoRR abs/1512.01699 (2015) - [i3]Saeed Mehrabi:
Guarding the Vertices of an Orthogonal Terrain using Vertex Guards. CoRR abs/1512.08292 (2015) - 2014
- [c12]Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. COCOA 2014: 113-125 - [c11]Stephane Durocher, Saeed Mehrabi:
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. IWOCA 2014: 140-152 - [c10]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. LATIN 2014: 156-167 - [c9]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. LATIN 2014: 294-305 - 2013
- [c8]Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. CCCG 2013 - [c7]Stephane Durocher, Saeed Mehrabi:
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results. MFCS 2013: 314-324 - [i2]Stephane Durocher, Saeed Mehrabi:
New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras. CoRR abs/1303.2162 (2013) - [i1]Stephane Durocher, Robert Fraser, Saeed Mehrabi:
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. CoRR abs/1308.2757 (2013) - 2012
- [c6]Stephane Durocher, Saeed Mehrabi, Matthew Skala, Mohammad Abdul Wahid:
The Cover Contact Graph of Discs Touching a Line. CCCG 2012: 59-64 - [c5]Stephane Durocher, Saeed Mehrabi:
Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number. COCOON 2012: 228-239 - 2011
- [c4]Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala:
Realizing Site Permutations. CCCG 2011
2000 – 2009
- 2009
- [c3]Saeed Mehrabi, Abbas Mehrabi, Ali D. Mehrabi:
A New Hybrid Genetic Algorithm for Maximum Independent Set Problem. ICSOFT (2) 2009: 314-317 - [c2]Saeed Mehrabi:
On Efficiency of Evolutionary Algorithms for Finding Large Independent Sets. IICAI 2009: 895-906 - [c1]Ali D. Mehrabi, Saeed Mehrabi, Abbas Mehrabi:
A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem. IJCCI 2009: 281-286
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-18 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
