( en | de | ru )

 

Disambiguation of "Alipour, Sharareh"

Author of the publication

copydeleteadd this publication to your clipboard
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach.

, and . DISC, volume 246 of LIPIcs, page 40:1-40:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sharareh Meyer

Hashem Alipour

Sharareh Schenker

Sharareh Arabbagheri

Sharareh Moshir

 

Other publications of authors with the same name

On decomposing complete tripartite graphs into 5-cycles., , and . Australas. J Comb., (2012)Weak visibility counting in simple polygons., , , and . J. Comput. Appl. Math., (2015)Improving Grading Fairness and Transparency with Decentralized Collaborative Peer Assessment., , , , , , and . Proc. ACM Hum. Comput. Interact., 8 (CSCW1): 1-24 (2024)An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem., , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 209-221. Springer, (2016)On Distributed Algorithms for Minimum Dominating Set problem, from theory to application., , and . CoRR, (2020)An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing., , , and . VISAPP (3), page 699-704. SciTePress, (2014)The Art of Gift-Giving with Limited Preference Data: How Fashion Recommender Systems Can Help., , , , , and . CHI Extended Abstracts, page 314:1-314:7. ACM, (2024)Visibility Testing and Counting., and . FAW-AAIM, volume 6681 of Lecture Notes in Computer Science, page 343-351. Springer, (2011)Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles., and . Discret. Math. Algorithms Appl., 15 (1): 2250063:1-2250063:14 (January 2023)Approximation algorithms for probabilistic $k$-center clustering.. ICDM, page 1-11. IEEE, (2020)