 | 2012 |
| 12 |  | Fatemeh Keshavarz-Kohjerdi,
Alireza Bagheri:
An efficient parallel algorithm for the longest path problem in meshes
CoRR abs/1201.4459: (2012) |
| 11 |  | Fatemeh Keshavarz-Kohjerdi,
Alireza Bagheri,
Asghar Asgharian-Sardroud:
A linear-time algorithm for the longest path problem in rectangular grid graphs.
Discrete Applied Mathematics 160(3): 210-217 (2012) |
| 2011 |
| 10 |  | Mehrdad Jangjou,
Alireza Bagheri,
Mohammad Mansour Riahi Kashani,
Koosha Sadeghi Oskooyee:
Communications in Computer and Information Science: Performance Improvement and Interference Reduction through Complex Task Partitioning in a Self-organized Robotic Swarm.
ICSECS (1) 2011: 441-447 |
| 9 |  | Saman Homayounnejad,
Alireza Bagheri,
Abbas Ghebleh:
Near-Optimal Flow in wireless sensor networks.
MIPRO 2011: 434-439 |
| 8 |  | Saman Homayounnejad,
Alireza Bagheri,
Abbas Ghebleh:
AAA: Asynchronous Adaptive Algorithm to solve Max-Flow Problem in wireless sensor networks.
MIPRO 2011: 440-445 |
| 7 |  | Fatemeh Keshavarz-Kohjerdi,
Alireza Bagheri:
Hamiltonian Paths in Two Classes of Grid Graphs
CoRR abs/1107.1780: (2011) |
| 2010 |
| 6 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Planar straight-line point-set embedding of trees with partial embeddings.
Inf. Process. Lett. 110(12-13): 521-523 (2010) |
| 5 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Drawing complete binary trees inside rectilinear polygons.
Int. J. Comput. Math. 87(14): 3138-3148 (2010) |
| 2009 |
| 4 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Complexity of Planar Embeddability of Trees inside Simple Polygons
CoRR abs/0908.4041: (2009) |
| 2005 |
| 3 |  | Alireza Bagheri,
Mohammadreza Razzazi:
How to Draw Free Trees Inside Bounded Simple Polygons.
J. UCS 11(6): 804-829 (2005) |
| 2004 |
| 2 |  | Alireza Bagheri,
Mohammadreza Razzazi:
Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton.
Computers and Artificial Intelligence 23(3): 239-254 (2004) |
| 1 |  | Alireza Bagheri,
Mohammadreza Razzazi:
How to draw free trees inside bounded rectilinear polygons.
Int. J. Comput. Math. 81(11): 1329-1339 (2004) |