Mohammad Ghodsi
According to our database^{1},
Mohammad Ghodsi
authored at least 93 papers
between 1990 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at sharif.edu
On csauthors.net:
Bibliography
2019
Fair Allocation of Indivisible Goods to Asymmetric Agents.
J. Artif. Intell. Res., 2019
Expand the Shares Together: EnvyFree Mechanisms with a Small Number of Cuts.
Algorithmica, 2019
Externalities and Fairness.
Proceedings of the World Wide Web Conference, 2019
1+ε approximation of tree edit distance in quadratic time.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
On the Distortion Value of the Elections with Abstention.
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
2018
Randomized approximation algorithms for planar visibility counting problem.
Theor. Comput. Sci., 2018
Weak visibility queries of line segments in simple polygons and polygonal domains.
Int. J. Comput. Math., 2018
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Fair Allocation of Indivisible Goods: Improvements and Generalizations.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Geometric Spanners in the MapReduce Model.
Proceedings of the Computing and Combinatorics  24th International Conference, 2018
Rent Division Among Groups.
Proceedings of the Combinatorial Optimization and Applications, 2018
A Composable Coreset for kCenter in Doubling Metrics.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018
2017
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments.
Proceedings of the WALCOM: Algorithms and Computation, 2017
Approximate Minimum Diameter.
Proceedings of the Computing and Combinatorics  23rd International Conference, 2017
Visibility Testing and Counting for Uncertain Segments.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
Fair Allocation of Indivisible Goods to Asymmetric Agents.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
EnvyFree Mechanisms with Minimum Number of Cuts.
Proceedings of the ThirtyFirst AAAI Conference on Artificial Intelligence, 2017
2016
Optimal space coverage with white convex polygons.
J. Comb. Optim., 2016
Euclidean movement minimization.
J. Comb. Optim., 2016
An Improved ConstantFactor Approximation Algorithm for Planar Visibility Counting Problem.
Proceedings of the Computing and Combinatorics  22nd International Conference, 2016
A Competitive Strategy for Walking in Generalized Streets for a Simple Robot.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2015
Near optimal line segment queries in simple polygons.
J. Discrete Algorithms, 2015
Weak visibility counting in simple polygons.
J. Computational Applied Mathematics, 2015
Visibility testing and counting.
Inf. Process. Lett., 2015
GPUbased parallel algorithm for computing point visibility inside simple polygons.
Computers & Graphics, 2015
Unit Covering in ColorSpanning Set Model.
Proceedings of the WALCOM: Algorithms and Computation  9th International Workshop, 2015
Robots' Cooperation for Finding a Target in Streets.
Proceedings of the Topics in Theoretical Computer Science, 2015
2014
On nonprogressive spread of influence through social networks.
Theor. Comput. Sci., 2014
Computing homotopic line simplification.
Comput. Geom., 2014
An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing.
Proceedings of the VISAPP 2014, 2014
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot.
Proceedings of the Combinatorial Optimization and Applications, 2014
Covering Orthogonal Polygons with Sliding kTransmitters.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Equilibrium pricing with positive externalities.
Theor. Comput. Sci., 2013
Pricing in population games with semirational agents.
Oper. Res. Lett., 2013
Space/querytime tradeoff for computing the visibility polygon.
Comput. Geom., 2013
Walking in Streets with Minimal Sensing.
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
Optimal online pricing with network externalities.
Inf. Process. Lett., 2012
Scheduling tasks with exponential duration on unrelated parallel machines.
Discrete Applied Mathematics, 2012
Computing polygonal path simplification under area measures.
Graphical Models, 2012
Efficient ObserverDependent Simplification in Polygonal Domains.
Algorithmica, 2012
PostRank: a new algorithm for incremental finding of persian blog representative words.
Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics, 2012
αVisibility.
Proceedings of the Algorithm Theory  SWAT 2012, 2012
On the Nonprogressive Spread of Influence through Social Networks.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
2011
White Space Regions.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011
A Heuristic Homotopic Path Simplification Algorithm.
Proceedings of the Computational Science and Its Applications  ICCSA 2011, 2011
Euclidean Movement Minimization.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Weak Visibility Queries in Simple Polygons.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Skiptree: A new scalable distributed data structure on multidimensional data supporting rangequeries.
Computer Communications, 2010
Incremental labeling in closed2PM model.
Computers & Electrical Engineering, 2010
Equilibrium Pricing with Positive Externalities (Extended Abstract).
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Optimal Iterative Pricing over Social Networks (Extended Abstract).
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Visibility maintenance of a moving segment observer inside polygons with holes.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
A topologyaware load balancing algorithm for P2P systems.
Proceedings of the Fourth IEEE International Conference on Digital Information Management, 2009
Visibility of a Moving Segment.
Proceedings of the Selected Papers of the 2009 International Conference on Computational Science and Its Applications, 2009
SpaceQueryTime Tradeoff for Computing the Visibility Polygon.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009
2008
Optimal point removal in closed2PM labeling.
Inf. Process. Lett., 2008
Query point visibility computation in polygons with holes.
Comput. Geom., 2008
A Fast Community Based Algorithm for Generating Web Crawler Seeds Set.
Proceedings of the WEBIST 2008, 2008
Permutation betting markets: singleton betting with extra information.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC2008), 2008
Visiting a Polygon on the Optimal Way to a Query Point.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008
Polar Diagram of Moving Objects.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
Querypoint visibility constrained shortest paths in simple polygons.
Theor. Comput. Sci., 2007
Spanning trees with minimum weighted degrees.
Inf. Process. Lett., 2007
Scheduling to minimize gaps and power consumption.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007
Computational Power of the Quantum Turing Automata.
Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007
Using Similarity Flooding for Extracting Similar Parts of Proteins.
Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs.
Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007
Weak Visibility of Two Objects in Planar Polygonal Scenes.
Proceedings of the Computational Science and Its Applications, 2007
3D Visibility and Partial Visibility Complex.
Proceedings of the Selected Papers of the Fifth International Conference on, 2007
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
RAQNet: A TopologyAware Overlay Network.
Proceedings of the InterDomain Management, 2007
2006
An Efficient Universal Addition Scheme for All HybridRedundant Representations with Weighted BitSet Encoding.
VLSI Signal Processing, 2006
Label updating to avoid pointshaped obstacles in fixed model.
Theor. Comput. Sci., 2006
An approximation algorithm for d_{1}optimal motion of a rod robot with fixed rotations.
Int. J. Comput. Math., 2006
Web Graph Compression by Edge Elimination.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006
2005
Weighted twovalued digitset encodings: unifying efficient hardware representation schemes for redundant number systems.
IEEE Trans. on Circuits and Systems, 2005
Comparison of artificial neural network and logistic regression models for prediction of mortality in head trauma based on initial clinical data.
BMC Med. Inf. & Decision Making, 2005
RAQ: A RangeQueriable Distributed Data Structure.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005
SkipTree: A Scalable RangeQueryable Distributed Data Structure for Multidimensional Data.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
An efficient algorithm for label updating in 2PM model to avoid a moving object.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
The fastest way to view a query point in simple polygons.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
A Hybrid Approach for Refreshing Web Page Repositories.
Proceedings of the Database Systems for Advanced Applications, 2005
Efficient computation of query point visibility in polygons with holes.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005
New Streaming Algorithms for Counting Triangles in Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Shortest paths in simple polygons with polygonmeet constraints.
Inf. Process. Lett., 2004
A fast algorithm for updating a labeling to avoid a moving point.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Pipelined operator tree scheduling in heterogeneous environments.
J. Parallel Distrib. Comput., 2003
CommonDeadline Lazy Bureaucrat Scheduling Problems.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
2002
Lengthconstrained pathmatchings in graphs.
Networks, 2002
1998
A coarse grained parallel solution to terrain simplification.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1991
Performance Analysis of Parallel Search Algorithms on Multiprocessor Systems.
Perform. Eval., 1991
Wellformed generalized task graphs.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991
1990
Performance Analysis of Parallel Search Algorithms on Multiprocessors.
Proceedings of the Performance '90, 1990