Остановите войну!
for scientists:
default search action
Saeed Mehrabi 0001
- > Home > Persons > Saeed Mehrabi 0001
Publications
- 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) - 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
- [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 - [c38]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Faster Multi-sided One-Bend Boundary Labelling. WALCOM 2021: 116-128 - [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) - 2020
- [c35]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. SWAT 2020: 16:1-16:10 - [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) - 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) - [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) - 2018
- [c27]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. SWAT 2018: 12:1-12:14 - [i19]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. CoRR abs/1803.10812 (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) - 2016
- [c16]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. COCOON 2016: 547-559 - 2014
- [c10]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. LATIN 2014: 156-167 - 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 - 2011
- [c4]Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala:
Realizing Site Permutations. CCCG 2011
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-25 01:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint