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

at orcid.org
On csauthors.net:
Bibliography
2019
Kinetic kSemiYao graph and its applications.
Comput. Geom., 2019
2018
Spanners for Geodesic Graphs and Visibility Graphs.
Algorithmica, 2018
2017
FaultTolerant Spanners in Networks with Symmetric Directional Antennas.
Proceedings of the WALCOM: Algorithms and Computation, 2017
Geodesic Spanners for Points on a Polyhedral Terrain.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Visibility Testing and Counting for Uncertain Segments.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
Efficiently approximating colorspanning balls.
Theor. Comput. Sci., 2016
2015
A simple, faster method for kinetic proximity problems.
Comput. Geom., 2015
Geometric Spanners for Points Inside a Polygonal Domain.
Proceedings of the 31st International Symposium on Computational Geometry, 2015
2014
Computing homotopic line simplification.
Comput. Geom., 2014
Kinetic Data Structures for the SemiYao Graph and All Nearest Neighbors in R^d.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Computing the Smallest ColorSpanning AxisParallel Square.
Proceedings of the Algorithms and Computation  24th International Symposium, 2013
Spanning Colored Points with Intervals.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Kinetic Pie Delaunay Graph and Its Applications.
Proceedings of the Algorithm Theory  SWAT 2012, 2012
2011
Kinetic Spanners in ℝ^{d}.
Discrete & Computational Geometry, 2011
PiecewiseLinear Approximations of Uncertain Functions.
Proceedings of the Algorithms and Data Structures  12th International Symposium, 2011
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
2010
New constructions of SSPDs and their applications.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
On the Power of the SemiSeparated Pair Decomposition.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Geometric Spanners for Weighted Point Sets.
Proceedings of the Algorithms, 2009
Kinetic spanners in R^{d}.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
2008
Kinetic kdTrees and LongestSide kdTrees.
Proceedings of the Data Structures, 17.02.  22.02.2008, 2008
A simple and efficient kinetic spanner.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
FaultTolerant ConflictFree Coloring.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
Regionfault tolerant geometric spanners.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Kinetic KDtrees and longestside KDtrees.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007
Streaming algorithms for line simplification.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007
2006
An approximation algorithm for d_{1}optimal motion of a rod robot with fixed rotations.
Int. J. Comput. Math., 2006
Kinetic Collision Detection for Convex Fat Objects.
Proceedings of the Algorithms, 2006
OutofOrder Event Processing in Kinetic Data Structures.
Proceedings of the Algorithms, 2006
2005
Lower bounds for kinetic sorting.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
Kinetic sorting and kinetic convex hulls.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005