Skip to main content

7 Result(s)

within Chapter Remove this filter Mohammad Ali Abam Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas

    Let P be a set of points in the plane, each equipped with a directional antenna that can cover a sector of angle \(\alpha \) ...

    Mohammad Ali Abam, Fatemeh Baharifard… in WALCOM: Algorithms and Computation (2017)

  2. No Access

    Chapter and Conference Paper

    Computing the Smallest Color-Spanning Axis-Parallel Square

    For a given set of n colored points with k colors in the plane, we study the problem of computing the smallest color-spanning axis-parallel square. First, for a dynamic set of colored points on the real line, we ...

    Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam… in Algorithms and Computation (2013)

  3. No Access

    Chapter and Conference Paper

    Kinetic Pie Delaunay Graph and Its Applications

    We construct a new proximity graph, called the Pie Delaunay graph, on a set of n points which is a super graph of Yao graph and Euclidean minimum spanning tree (EMST). We efficiently maintain the Pi...

    Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei in Algorithm Theory – SWAT 2012 (2012)

  4. No Access

    Chapter and Conference Paper

    Piecewise-Linear Approximations of Uncertain Functions

    We study the problem of approximating a function F: ℝ → ℝ by a piecewise-linear function \(\overline{\mathrm{F}}\) when the values of F at ...

    Mohammad Ali Abam, Mark de Berg, Amirali Khosravi in Algorithms and Data Structures (2011)

  5. No Access

    Chapter and Conference Paper

    Geometric Spanners for Weighted Point Sets

    Let (S,d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function d w ...

    Mohammad Ali Abam, Mark de Berg, Mohammad Farshi… in Algorithms - ESA 2009 (2009)

  6. No Access

    Chapter and Conference Paper

    On the Power of the Semi-Separated Pair Decomposition

    A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set \(S\subset {\mathbb R}^d\) is a set {(A ...

    Mohammad Ali Abam, Paz Carmi, Mohammad Farshi… in Algorithms and Data Structures (2009)

  7. No Access

    Chapter and Conference Paper

    Out-of-Order Event Processing in Kinetic Data Structures

    We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and events may be processed in a wrong order. In traditional KDS’s this can lead to major...

    Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu in Algorithms – ESA 2006 (2006)