 | 2012 |
| 22 |  | Hossein Ghasemalizadeh,
Mohammadreza Razzazi:
An Improved Approximation Algorithm for the Most Points Covering Problem.
Theory Comput. Syst. 50(3): 545-558 (2012) |
| 2011 |
| 21 |  | M. Karimi Dardashti,
Mohammadreza Razzazi,
Mohammad Taghavifard:
An approach to supplier selectionin in the dynamic environment.
MIPRO 2011: 1408-1413 |
| 20 |  | Azade Fotouhi,
Mohammadreza Razzazi:
An efficient algorithm to maximize the network lifetime for target coverage.
MIPRO 2011: 523-527 |
| 19 |  | Azade Fotouhi,
Mohammadreza Razzazi:
Redundancy and coverage detection in wireless sensor networks in the presence of obstacles.
MIPRO 2011: 541-546 |
| 18 |  | Taha Ghasemi,
Mohammadreza Razzazi:
Development of core to solve the multidimensional multiple-choice knapsack problem.
Computers & Industrial Engineering 60(2): 349-360 (2011) |
| 17 |  | Ali Nourollah,
Mohammadreza Razzazi:
Minimum cost open chain reconfiguration.
Discrete Applied Mathematics 159(14): 1418-1424 (2011) |
| 16 |  | Mohammadreza Razzazi,
Mehdy Roayaei:
Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems.
Inf. Sci. 181(17): 3581-3600 (2011) |
| 2010 |
| 15 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Planar straight-line point-set embedding of trees with partial embeddings.
Inf. Process. Lett. 110(12-13): 521-523 (2010) |
| 14 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Drawing complete binary trees inside rectilinear polygons.
Int. J. Comput. Math. 87(14): 3138-3148 (2010) |
| 2009 |
| 13 |  | Ali Nourollah,
Mohammadreza Razzazi:
Near-Optimum Folding for a Reconfigurable Snake-Like Robot.
Advanced Robotics 23(1-2): 239-256 (2009) |
| 12 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Complexity of Planar Embeddability of Trees inside Simple Polygons
CoRR abs/0908.4041: (2009) |
| 2008 |
| 11 |  | Kaveh Fayazbakhsh,
Mohammadreza Razzazi:
Coordination of a Multi-commodity Supply Chain with Multiple Members Using Flow Networks.
ICDS 2008: 25-30 |
| 10 |  | Ali Nourollah,
Mohammadreza Razzazi:
A Linear Time Approximation Algorithm for Ruler Folding Problem.
J. UCS 14(4): 566-574 (2008) |
| 2007 |
| 9 |  | Seyyed Mohsen Hashemi,
Mohammad Teshnehlab,
Mohammadreza Razzazi:
Unbundling Business Processes to Fine-Grained E-Services through the Next Generation EIS Frameworks.
CONFENIS (2) 2007: 983-991 |
| 8 |  | Ali Nourollah,
Mohammadreza Razzazi:
A New Dynamic Programming Algorithm for Orthogonal Ruler Folding Problem in d-Dimensional Space.
ICCSA (1) 2007: 15-25 |
| 2006 |
| 7 |  | Seyyed Mohsen Hashemi,
Mohammadreza Razzazi,
Ali Bahrami:
ISRUP E-Service Framework for agile Enterprise Architecting.
ITNG 2006: 701-706 |
| 2005 |
| 6 |  | Alireza Bagheri,
Mohammadreza Razzazi:
How to Draw Free Trees Inside Bounded Simple Polygons.
J. UCS 11(6): 804-829 (2005) |
| 2004 |
| 5 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton.
Computers and Artificial Intelligence 23(3): 239-254 (2004) |
| 4 |  | Alireza Bagheri,
Mohammadreza Razzazi:
How to draw free trees inside bounded rectilinear polygons.
Int. J. Comput. Math. 81(11): 1329-1339 (2004) |
| 2003 |
| 3 |  | Ali Mohades,
Mohammad E. Shiri,
Mohammadreza Razzazi:
The Reachability Problem in a Concave Region: A New Context.
International Conference on Computational Science 2003: 861-868 |
| 2001 |
| 2 |  | Ali Mohades,
Mohammadreza Razzazi:
Reachability on a Region Bounded by Two Attached Squares.
International Conference on Computational Science (1) 2001: 763-771 |
| 1994 |
| 1 |  | Teofilo F. Gonzalez,
Mohammadreza Razzazi,
Man-tak Shing,
Si-Qing Zheng:
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.
Comput. Geom. 4: 1-11 (1994) |