Mohammad Ali Abam

According to our database1, Mohammad Ali Abam authored at least 31 papers between 2005 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Kinetic k-Semi-Yao graph and its applications.
Comput. Geom., 2019

2018
Spanners for Geodesic Graphs and Visibility Graphs.
Algorithmica, 2018

2017
Fault-Tolerant 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 Twenty-Eighth Annual ACM-SIAM 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 color-spanning 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 Semi-Yao Graph and All Nearest Neighbors in R^d.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Computing the Smallest Color-Spanning Axis-Parallel 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

Piecewise-Linear 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 Semi-Separated 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 Rd.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Kinetic kd-Trees and Longest-Side kd-Trees.
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

Fault-Tolerant Conflict-Free Coloring.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Region-fault tolerant geometric spanners.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Kinetic KD-trees and longest-side KD-trees.
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 d1-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

Out-of-Order 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


  Loading...