614
84

# Publication

Found 105 results
Filters: Author is Mohammad Ghodsi  [Clear All Filters]
2020
Clearing an orthogonal polygon to find the evaders, , Theoretical Computer Science, 10/2020, (2020)
Maximin share guarantee for goods with positive externalities, , Social Choice and Welfare, 08/2020, p.1-34, (2020)
Windowing queries using Minkowski sum and their extension to MapReduce, , JOURNAL OF SUPERCOMPUTING, 04/2020, (2020)
2019
1+ε approximation of tree edit distance in quadratic time, , ACM SIGACT Symposium on Theory of Computing, 06/2019, (2019)
On the distortion value of the elections with abstention, , Proceedings of the AAAI Conference on Artificial Intelligence, 07/2019, Volume 33, p.1981-1988, (2019)
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts, , Algorithmica, 04/2019, Volume 81, Issue 4, p.1728-1755, (2019)
Externalities and Fairness, , The World Wide Web Conference, 05/2019, (2019)
Fair allocation of indivisible goods to asymmetric agents, , Journal of Artificial Intelligence Research, 01/2019, Volume 64, p.1-20, (2019)
Visibility extension via mirror-edges to cover invisible segments, , Theoretical Computer Science, 10/2019, Volume 789, p.22-33, (2019)
Visibility testing and counting for uncertain segments, , Theoretical Computer Science, 08/2019, Volume 779, p.1-7, (2019)
2018
Fair allocation of indivisible goods: Improvements and generalizations, , Proceedings of the 2018 ACM Conference on Economics and Computation, 06/2018, (2018)
Geometric spanners in the MapReduce model, , International Computing and Combinatorics Conference, 07/2018, Cham, (2018)
Randomized approximation algorithms for planar visibility counting problem, , Theoretical Computer Science, 01/2018, Volume 707, p.46-55, (2018)
Rent division among groups, , International Conference on Combinatorial Optimization and Applications, 12/2018, Cham, (2018)
2017
Approximate minimum diameter, , International Computing and Combinatorics Conference, 08/2017, Cham, (2017)
Approximation algorithms for visibility computation and testing over a terrain, , Applied Geomatics, 03/2017, Volume 9, Issue 1, p.53-59, (2017)
Envy-Free Mechanisms with Minimum Number of Cuts, , AAAI, 02/2017, (2017)
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments, , International Workshop on Algorithms and Computation, 03/2017, Cham, (2017)
Morphometric characteristics of Yardangs in the Lut Desert, Iran, Ghodsi, Mohammad , Desert, 03/2017, Volume 22, Issue 1, p.21-29, (2017)
2016
Clearing an Orthogonal Polygon Using Sliding Robots, , CoRR, Volume abs/1607.03039, (2016)
Euclidean movement minimization, , J. Comb. Optim., Volume 32, Number 2, p.354–367, (2016)
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem, , CoRR, Volume abs/1605.03542, (2016)
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem, , Computing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, p.209–221, (2016)
Optimal space coverage with white convex polygons, , J. Comb. Optim., Volume 32, Number 2, p.341–353, (2016)
2015
GPU-based parallel algorithm for computing point visibility inside simple polygons, , Computers {&} Graphics, Volume 49, p.1–9, (2015)
Near optimal line segment queries in simple polygons, , J. Discrete Algorithms, Volume 35, p.51–61, (2015)
Randomized Strategy for Walking in Streets for a Simple Robot, , CoRR, Volume abs/1512.01784, (2015)
Robots' Cooperation for Finding a Target in Streets, , Topics in Theoretical Computer Science - The First {IFIP} {WG} 1.8 International Conference, {TTCS} 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers, p.30–43, (2015)
Unit Covering in Color-Spanning Set Model, , {WALCOM:} Algorithms and Computation - 9th International Workshop, {WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings, p.44–52, (2015)
Visibility testing and counting, , Inf. Process. Lett., Volume 115, Number 9, p.649–654, (2015)
Walking in streets with minimal sensing, , J. Comb. Optim., Volume 30, Number 2, p.387–401, (2015)
Weak visibility counting in simple polygons, , J. Computational Applied Mathematics, Volume 288, p.215–222, (2015)
2014
{$$\alpha$$}-Visibility, , Comput. Geom., Volume 47, Number 3, p.435–446, (2014)
An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing, , {VISAPP} 2014 - Proceedings of the 9th International Conference on Computer Vision Theory and Applications, Volume 3, Lisbon, Portugal, 5-8 January, 2014, p.699–704, (2014)
Computing homotopic line simplification, , Comput. Geom., Volume 47, Number 7, p.728–739, (2014)
Covering Orthogonal Polygons with Sliding k-Transmitters, , Proceedings of the 26th Canadian Conference on Computational Geometry, {CCCG} 2014, Halifax, Nova Scotia, Canada, 2014, (2014)
On non-progressive spread of influence through social networks, , Theor. Comput. Sci., Volume 550, p.36–50, (2014)
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot, , Combinatorial Optimization and Applications - 8th International Conference, {COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings, p.101–112, (2014)

## Join our Google Group Now!

GET IN TOUCH WITH US

## Contact us

#### Sharif University of Technology, Department of Computer Engineering

Room 712, CE Algorithms Lab
P.O. Box 11155-9517, Tehran, Iran

Tel: +9821-6616-6675

Education - This is a contributing Drupal Theme
Design by WeebPal.