Sharareh Alipour

Orcid: 0000-0002-3626-8960

According to our database1, Sharareh Alipour authored at least 28 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with Constraints.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles.
Discret. Math. Algorithms Appl., January, 2023

Relative Fractional Independence Number and Its Applications.
CoRR, 2023

2022
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

A Blockchain Approach to Academic Assessment.
Proceedings of the CHI '22: CHI Conference on Human Factors in Computing Systems, New Orleans, LA, USA, 29 April 2022, 2022

2021
Improvements on approximation algorithms for clustering probabilistic data.
Knowl. Inf. Syst., 2021

On distributed algorithms for minimum dominating set problem and beyond.
CoRR, 2021

On Planar Visibility Counting Problem.
CoRR, 2021

A Geometric Algorithm for Fault-Tolerant Classification of COVID-19 Infected People.
Proceedings of the 26th International Computer Conference, Computer Society of Iran, 2021

On Guarding Polygons with Holes.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application.
CoRR, 2020

A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Approximation algorithms for probabilistic $k$-center clustering.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2020

2019
Visibility testing and counting for uncertain segments.
Theor. Comput. Sci., 2019

Upper Bounds for the Domination Numbers of Graphs Using Turán's Theorem and Lovász Local Lemma.
Graphs Comb., 2019

2018
Randomized approximation algorithms for planar visibility counting problem.
Theor. Comput. Sci., 2018

On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment.
CoRR, 2018

Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles.
CoRR, 2018

Improvements on the k-center Problem for Uncertain Data.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2017
On Chromatic Number of General Kneser Graphs.
Contributions Discret. Math., 2017

2016
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Weak visibility counting in simple polygons.
J. Comput. Appl. Math., 2015

Visibility testing and counting.
Inf. Process. Lett., 2015

2014
Fast Approximation and Randomized Algorithms for Diameter.
CoRR, 2014

An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing.
Proceedings of the VISAPP 2014, 2014

2012
On decomposing complete tripartite graphs into 5-cycles.
Australas. J Comb., 2012

2011
Visibility Testing and Counting.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011


  Loading...