Mohammad Ali Abam

Orcid: 0000-0002-8345-8783

Affiliations:
  • Sharif University of Technology, Tehran, Iran
  • Eindhoven University of Technology, Netherlands (former)


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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Preclustering Algorithms for Imprecise Points.
Algorithmica, 2022

Maximum Weight Convex Polytope.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021
CHANCE: Capacitor Charging Management Scheme in Energy Harvesting Systems.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2021

Geodesic spanners for points in R3 amid axis-parallel boxes.
Inf. Process. Lett., 2021

Kinetic collision detection for balls.
Inf. Process. Lett., 2021

Local Geometric Spanners.
Algorithmica, 2021

2020
Geodesic Spanners for Points in R<sup>3</sup> amid Axis-parallel Boxes.
CoRR, 2020

2019
Geometric spanner games.
Theor. Comput. Sci., 2019

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

Geodesic Spanners for Points on a Polyhedral Terrain.
SIAM J. Comput., 2019

Kinetic <i>k</i>-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.
Theor. Comput. Sci., 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
Kinetic $k$-Semi-Yao Graph and its Applications.
CoRR, 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
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$.
CoRR, 2013

On the power of the semi-separated pair decomposition.
Comput. Geom., 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
New constructions of SSPDs and their applications.
Comput. Geom., 2012

Kinetic Pie Delaunay Graph and Its Applications.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011
Kinetic Spanners in ℝ<sup><i>d</i></sup>.
Discret. Comput. Geom., 2011

Geometric Spanners for Weighted Point Sets.
Algorithmica, 2011

Out-of-Order Event Processing in Kinetic Data Structures.
Algorithmica, 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
Streaming Algorithms for Line Simplification.
Discret. Comput. Geom., 2010

A simple and efficient kinetic spanner.
Comput. Geom., 2010

2009
Kinetic kd-Trees and Longest-Side kd-Trees.
SIAM J. Comput., 2009

Region-Fault Tolerant Geometric Spanners.
Discret. Comput. Geom., 2009

Kinetic Collision Detection for Convex Fat Objects.
Algorithmica, 2009

Kinetic spanners in R<sup>d</sup>.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

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

2007
Kinetic sorting and kinetic convex hulls.
Comput. Geom., 2007

2006
An approximation algorithm for <i>d</i><sub>1</sub>-optimal motion of a rod robot with fixed rotations.
Int. J. Comput. Math., 2006

2005
Lower bounds for kinetic sorting.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005


  Loading...