• 1
  • 2
  • 5
  • 6
  • 3
  • 4
IPM
30
YEARS OLD

“Papers of School of Computer Science”

Back to Papers Home
 

Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

  361. M. Jamzad and F. Yaghmaee,
Distribution of Watermark According to Image Complexity for Higher Stability,
in: ICIAR, 3212, 2004, pp. 794-801  [abstract]

   362. H. Hatami and R. Tusserkani,
On the complexity of the circular chromatic number,
Journal of Graph Theory 47(2004),   [abstract]

   363. A. Bagherl and M. Razzazi,
Drawing free trees inside simple polygons using polygon skeleton,
Computing and Informatics 23(2004), 239-254  [abstract]

   364. A. Bagheri and M. Razzazi,
How to draw free trees inside bounded rectilinear polygons,
International Journal of Computer Mathematics 81(2004), 1329 -1339  [abstract]

   365. A. Bagheri and M. Razzazi,
Planar orthogonal drawing of complete binary trees inside rectilinear polygons,
in: INMIC, , 2004, pp. 618-623  [abstract]

   366. F. Rostamabadi and M. Ghodsi,
A Fast Algorithm for Updating a Labeling to Avoid a Moving Point,
in: CCCG, , 2004, pp. 204-208  [abstract]

   367. R. Khosravi and M. Ghodsi,
Shortest paths in simple polygons with polygon-meet constraints,
Information Processing Letters 91(2004), 171-176  [abstract]

   368. H. Ahrabian and A. Nowzari-Dalini,
Gray Code Algorithm for Listing k-ary Trees,
13(2004), 243-251  [abstract]

   369. M. Rezazad and H. Sarbazi-Azad,
A Routing Algorithm for the Star Interconnection Network in the Presence of Faults,
(2003), 11-18  [abstract]

   370. H. Sarbazi-Azad and A. Khonsari,
A class of ball-and-bin problems and its application to mesh networks,
in: ICECS, , 2003, pp. 1101-1104  [abstract]

   back to top  

Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right