default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSharareh Alipour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c18]Sharareh Alipour, Ermiya Farokhnejad, Tobias Mömke:
Improved Approximation Algorithms for (1, 2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model. STACS 2025: 9:1-9:17- [i13]Sharareh Alipour, Ermiya Farokhnejad, Tobias Mömke:
Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model. CoRR abs/2501.04813 (2025) - 2024
- [j10]Sharareh Alipour
, Sina Elahimanesh, Soroush Jahanzad, Iman Mohammadi, Parimehr Morassafar, Seyed Parsa Neshaei, Mojtaba Tefagh:
Improving Grading Fairness and Transparency with Decentralized Collaborative Peer Assessment. Proc. ACM Hum. Comput. Interact. 8(CSCW1): 1-24 (2024) - [c17]Sharareh Alipour, Sina Elahimanesh, Aliakbar Ghayouri Sales, Iman Mohammadi, Parimehr Morassafar, Seyed Parsa Neshaei:
The Art of Gift-Giving with Limited Preference Data: How Fashion Recommender Systems Can Help. CHI Extended Abstracts 2024: 314:1-314:7 - [c16]Mohammad Abolnejadian, Sharareh Alipour, Kamyar Taeb:
Leveraging ChatGPT for Adaptive Learning through Personalized Prompt-based Instruction: A CS1 Education Case Study. CHI Extended Abstracts 2024: 521:1-521:8 - [c15]Sharareh Alipour, Amin Gohari, Mehrshad Taziki:
Relative Fractional Independence Number. ITW 2024: 777-782 - [c14]Sharareh Alipour, Emran Shahbazi Gholiabad, Mohammad Amin Raeisi:
Uncertain k-Center Clustering, Revisited: Point Assignment. KSEM (2) 2024: 280-291 - [c13]Sharareh Alipour, Amir Jafari, Mohammad Hassan Mazidi, Seyed Abolfazl Najafian:
Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with Constraints. SODA 2024: 1246-1259 - [i12]Pooriya Jamie, Reyhaneh Hajihashemi, Sharareh Alipour:
Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective. CoRR abs/2410.08899 (2024) - [i11]Sharareh Alipour, Kajal Baghestani, Mahdis Mirzaei, Soroush Sahraei:
Geometric Freeze-Tag Problem. CoRR abs/2412.19706 (2024) - 2023
- [j9]Sharareh Alipour, Salman Parsa:
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles. Discret. Math. Algorithms Appl. 15(1): 2250063:1-2250063:14 (2023) - [i10]Sharareh Alipour, Amin Gohari:
Relative Fractional Independence Number and Its Applications. CoRR abs/2307.06155 (2023) - 2022
- [c12]Sharareh Alipour, Sina Elahimanesh, Soroush Jahanzad, Parimehr Morassafar, Seyed Parsa Neshaei:
A Blockchain Approach to Academic Assessment. CHI Extended Abstracts 2022: 306:1-306:6 - [c11]Sharareh Alipour, Mohammadhadi Salari:
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach. DISC 2022: 40:1-40:3 - 2021
- [j8]Sharareh Alipour:
Improvements on approximation algorithms for clustering probabilistic data. Knowl. Inf. Syst. 63(10): 2719-2740 (2021) - [c10]Sharareh Alipour:
On Guarding Polygons with Holes. CCCG 2021: 348-350 - [c9]Farnaz Sheikhi, Sharareh Alipour:
A Geometric Algorithm for Fault-Tolerant Classification of COVID-19 Infected People. CSICC 2021: 1-5 - [i9]Sharareh Alipour:
On guarding polygons with holes. CoRR abs/2102.10317 (2021) - [i8]Sharareh Alipour:
On Planar Visibility Counting Problem. CoRR abs/2103.08058 (2021) - [i7]Sharareh Alipour, Mohammadhadi Salari:
On distributed algorithms for minimum dominating set problem and beyond. CoRR abs/2103.08061 (2021) - 2020
- [c8]Sharareh Alipour, Salman Parsa:
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles. COCOA 2020: 350-363 - [c7]Sharareh Alipour:
Approximation algorithms for probabilistic $k$-center clustering. ICDM 2020: 1-11 - [c6]Sharareh Alipour, Amir Jafari:
A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs. SPAA 2020: 501-502 - [i6]Sharareh Alipour, Ehsan Futuhi, Shayan Karimi:
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application. CoRR abs/2012.04883 (2020)
2010 – 2019
- 2019
- [j7]Sharareh Alipour, Amir Jafari:
Upper Bounds for the Domination Numbers of Graphs Using Turán's Theorem and Lovász Local Lemma. Graphs Comb. 35(5): 1153-1160 (2019) - [j6]Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility testing and counting for uncertain segments. Theor. Comput. Sci. 779: 1-7 (2019) - 2018
- [j5]Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
Randomized approximation algorithms for planar visibility counting problem. Theor. Comput. Sci. 707: 46-55 (2018) - [c5]Sharareh Alipour, Amir Jafari:
Improvements on the k-center Problem for Uncertain Data. PODS 2018: 425-433 - [i5]Sharareh Alipour, Salman Parsa:
Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles. CoRR abs/1805.07724 (2018) - [i4]Farnaz Sheikhi, Sharareh Alipour:
On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment. CoRR abs/1809.00116 (2018) - 2017
- [j4]Sharareh Alipour, Amir Jafari:
On Chromatic Number of General Kneser Graphs. Contributions Discret. Math. 12(2) (2017) - [c4]Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility Testing and Counting for Uncertain Segments. CCCG 2017: 84-88 - [i3]Sharareh Alipour, Amir Jafari:
Improvements on the k-center problem for uncertain data. CoRR abs/1708.09180 (2017) - 2016
- [c3]Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. COCOON 2016: 209-221 - [i2]Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. CoRR abs/1605.03542 (2016) - 2015
- [j3]Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza:
Visibility testing and counting. Inf. Process. Lett. 115(9): 649-654 (2015) - [j2]Mojtaba Nouri Bygi, Shervin Daneshpajouh, Sharareh Alipour, Mohammad Ghodsi:
Weak visibility counting in simple polygons. J. Comput. Appl. Math. 288: 215-222 (2015) - 2014
- [c2]Sharareh Alipour, Mohammad Ghodsi, Ugur Güdükbay, Morteza Golkari:
An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing. VISAPP (3) 2014: 699-704 - [i1]Sharareh Alipour, Bahman Kalantari, Hamid Homapour:
Fast Approximation and Randomized Algorithms for Diameter. CoRR abs/1410.2195 (2014) - 2012
- [j1]Sharareh Alipour, Ebadollah S. Mahmoodian, E. Mollaahmadi:
On decomposing complete tripartite graphs into 5-cycles. Australas. J Comb. 54: 289-302 (2012) - 2011
- [c1]Sharareh Alipour, Alireza Zarei:
Visibility Testing and Counting. FAW-AAIM 2011: 343-351
Coauthor Index
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 2025-02-24 22:30 CET 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:
