Mohammad Ali Abam

                                                   Email : mohammad-ali.abam at tu-dortmund.de  

                                         Office:  OH 14, Room 332                  Phone Office: +49-231755514

                          [ Educational background ]  [ Publications ] [ Interested Links ]

 

I am a postdoctoral researcher   in  Computer Science Department  at  Dortmund University under supervision of Prof. Christain Sohler. My research interest is discrete and computational geometry.

Educational Background

 Publications      

   Papers in Journals

1.      M.A. Abam and  M. Ghodsi.  An approximation algorithm for d1-optimal motion of a rod robot with fixed rotations,  International Journal of Computer Mathematics, 83:357—370 (2006).

2.      M.A. Abam and M. de Berg.  Kinetic sorting and kinetic convex hulls. Computational Geometry: Theory and Applications, 37:16—26 (2007). (Special issue on 21st  ACM Symp. on Computational Geometry).

3.      M.A. Abam, M. de Berg, S-H. Poon, and B. Speckmann. Kinetic collision detection for convex fat objects.  Algorithmica 53: 457—473 (2009).  (Special issue on 14th  Annual European Symposium on Algorithms).

4.      M.A. Abam, M. de Berg, M. Farshi, and J. Gudmundsson. Region-fault tolerant geometric spanners. Discrete & Computational Geometry. 41: 556—582 (2009).

5.      M.A. Abam, M. de Berg, and J. Gudmundsson. A simple and efficient kinetic spanner.  Computational Geometry: Theory and Applications. 43:251—256 (2010). (Special issue on 24th  ACM Symp. on Computational Geometry.)

6.      M.A. Abam, M. de Berg, P.  Hachenberger, and A. Zarei.  Streaming algorithms for line simplification.  Discrete & Computational Geometry. To appear.

7.      M.A. Abam, M. de Berg, and B. Speckmann. Kinetic kd-trees and longest-side kd-trees. SIAM Journal on Computing, To appear.

8.      M.A. Abam, P. Agarwal, M. de Berg, and H. Yu.  Out-of-order event processing in kinetic data structures, Algorithmica, To appear.

9.       M.A. Abam and M. de Berg. Kinetic spanners in Rd.  Discrete & Computational Geometry. To appear. (Special issue on 25th  ACM Symp. on Computational Geometry.)

   Papers in proceedings of refereed conferences

1.       M.A. Abam and M. de Berg.  Kinetic sorting and kinetic convex hulls.   In Proc. ACM Symp. on Computational Geometry (SoCG), pages 190--197,  2005.

2.       M.A. Abam, M. de Berg, S-H. Poon, and B. Speckmann.  Kinetic collision detection for convex fat objects.  In Proc. Annual European Symposium on Algorithms (ESA), pages 4—15, 2006,.

3.       M.A. Abam, P. Agarwal, M. de Berg, and H. Yu.  Out-of-order event processing in kinetic data structures,  In Proc. Annual European Symposium on Algorithms (ESA),  pages 624—635, 2006.

4.       M.A. Abam, M. de Berg,  M. Farshi, and J. Gudmundsson. Region-fault tolerant geometric spanners. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA),  pages 1—10, 2007.

5.       M.A. Abam, M. de Berg, P.  Hachenberger, and A. Zarei.  Streaming algorithms for line simplification. In Proc.  ACM Symp. on Computational Geometry (SoCG), pages 175—183, 2007.

6.       M.A. Abam, M. de Berg, and B. Speckmann.  Kinetic kd-trees and longest-side kd-trees.  In Proc.  ACM Symp. on Computational Geometry (SoCG), pages 364—372, 2007.

7.       M.A. Abam, M. de Berg, and J. Gudmundsson. A simple and efficient kinetic spanner. In Proc.  ACM Symp. on Computational Geometry (SoCG), , pages 306—310, 2008.

8.       M.A. Abam, M. de Berg, and S-H. Poon.  Fault-tolerant conflict-free coloring.  In Proc. Canadian Conference on Computational Geometry (CCCG), pages 95--98 , 2008.

9.       M.A. Abam and M. de Berg. Kinetic spanners in Rd. In Proc. ACM Symp. On Computational Geometry (SoCG), pages 43--50, 2009.

10.   M.A. Abam, P. Carmi, M. Farshi, and M. Smid. On the power of semi-separated pair decomposition. In Proc. Algorithms and Data Structures Symposium, pages 1--12, 2009.

11.  M.A. Abam, M. de Berg, M. Farshi,  J. Gudmundsson and M. Smid. Geometric Spanners for Weighted Point Sets. In Proc. Annual European Symposium on Algorithms (ESA), pages 190—202, 2009.

12.  M.A. Abam and Sariel Har-Peled. New Constructions of SSPDs and their Applications. In Proc.  ACM Symp. on Computational Geometry (SoCG), 2010, To appear.

Papers in unrefereed conferences

1.      M.A. Abam and M. de Berg.  Lower bounds for kinetic sorting.  In Proc. European Workshop on Computational Geometry, pages 171—174, 2005.

2.      M.A. Abam, M. de Berg, S-H. Poon, and B. Speckmann. Kinetic collision detection for balls on a plane. In Proc.  European Workshop on Computational Geometry, pages 55—58, 2006.

3.      M.A. Abam, M. de Berg, and B. Speckmann. Kinetic kd-tree. In Proc. European Workshop on Computational Geometry, pages 126—129,  2007.

4.      M.A. Abam, M. de Berg, P. Hachenberger, and A. Zarei. Streaming algorithms for line simplification under the Frechet distance.  In Proc. European Workshop on Computational Geometry ,pages 77—80, 2007.

    Theses

1.      M.A. Abam.  Parallel generation of  river networks on TIN.  B.Sc Thesis, Computer Engineering Department, Sharif Univesity of Technology, 1999.

2.      M.A. Abam.  Motion planning for non-point robots.  M.Sc Thesis, Computer Engineering Department, Sharif Univesity of Technology,  2001.

3.      M.A. Abam.  New data structures and algorithms for mobile data.  Ph.D. Thesis, Computer Science  Department, Eindhoven Univesity of Technology,  2007.

 

 Interested Links