23
http://sharif.edu/~ghodsi [email protected] PARADIGM MS&E / ACM International Collegiate Programming Contest IPM

IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

´¡�õ� �ÂØê �¤ ö�� �î ö� ô�÷��üÞÜä ñ�� �ªü¨Àì ÀÞ½õÓþª üµã�¬ ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ö�Âþ� ,ö�Âú� ,11155-9517 üµÆ� ëøÀ�¬66-01-92-46 :¤�Ú÷¤ø¢ ,66-16-66-25 :ßÔÜ�http://sharif.edu/~ghodsi ,[email protected] ¤�þÂúª 27 üû�ÚÈ÷�¢ ©¥�õ� 1.�ØþÂõ� ,��÷��Ü�Æ�� üµó�þ� ù�ÚÈ÷�¢ ,Â���³õ�î ÝÜä ýùÀØÈ÷�¢ ,ýÂµî¢ 68 �� 1363.�ØþÂõ� ,üÜîÂ� ,��÷ÂÔ�ó�î ù�ÚÈ÷�¢ ,Â���³õ�î ÝÜä ø ëÂ� ü¨À�úõ ýùÀØÈ÷�¢ ,Å÷�Æ�ó ë�ê 56 �� 1354.Óþª üµã�¬ ù�ÚÈ÷�¢ ,ëÂ� ü¨À�úõ ýùÀØÈ÷�¢ ,Å÷�Æ�ó 54 �� 1350Óþª üµã�¬ ù�ÚÈ÷�¢ ¤¢ 2,]79 �� 68 ¥�[ Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ¤�þ¢�µ¨� ,]68 �� 58[ Â���³õ�î ø ü®�þ¤ ô�Üä ýùÀØÈ÷�¢ ,üª¥�õ� ü�Âõ •](35 ý�þ��) ö��î �� 84 ¥�[ ô�Þ�¢�µ¨� ø ]84 �� 79 ¥�[ ¤��È÷�¢83 ø 78 �� 76 ¥�[ ¤�Ãê�ôÂ÷ ùøÂð ÂþÀõ ø ]78 �� 77 ø 73 �� 68 ¥�[ üÜ�ÞØ� ���ʽ� öø�ãõ ,]75 �� 73 ¥�[ Å�þ¤ •Â���³õ�î ü¨À�úõ ùÀØÈ÷�¢ ]89 ��]84�� 79 ¥�[ ù�ÚÈ÷�¢ ýùÃ�Þõ ���û �Ìä •,ö�µó¤�î ù�ÚÈ÷�¢ ,Â���³õ�î ÝÜä ýùÀØÈ÷�¢ ,PARADIGM üÈûøÄ� ùøÂð ] 1376 �� 1375[ :ü��ãó�Îõ ´¬Âê •;�ØþÂõ� ,¢¤�Ô�µ¨� ù�ÚÈ÷�¢ ,(MS&E) ü¨À�úõ ø ´þÂþÀõ ÝÜä ýùÀØÈ÷�¢ ]90/6/30 �� 90/1/1[ ;�¢�÷�î

ACM International) ô�ü¨ý� üþ��Ç÷�¢ üÆþ�÷�õ�÷Â� ü÷�ú� ��Ö��Æõ �ä�Þ¹õ ¥� ö�Âú� ý�Ö��Æõ ´¨Â�¨ •]ö��î �� 1378[ (Collegiate Programming Contest]63 �� 60 ¥�[ ��±¨�½õ ÃîÂõ ´¨Â�¨ •�û�ƨ�b õ ÂÚþ¢ ¤¢ 3]ö��î �� 1382[ Â���³õ�î ô�Üä ý�¨¤Àõ ,Ý�Öõ ÂÚÈûøÄ� :(IPM) ý¢���� ý�ûÇ÷�¢ ù�ÚÈûøÄ� •]ö��î �� 81 ¥�[ Â���³õ�î ü¨À�úõ ý�µ�Þî ´¨Â�¨ :¤�Èî ©¥�õ� ǹ�¨ ö�õ¤�¨ •1

Page 2: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

ý�µ�Þî ´¨Â�¨ ;]ö��î �� 1371[ üÜõ ý�µ�Þî �Ìä :ö��� ö�ûøÄ�Ç÷�¢ ù�Úª�� ,Â���³õ�î ý¥�õ�Ç÷�¢ ¢��³Þó� •IOI International) ×���õ¤�Ô÷� ü÷�ú� ¢��³Þó� üÜÜÞó�ß�� ý�µ�Þî �Ìä ;]89 �� 1371[ üõ�Ãä� Ý�� ´¨Â�¨ ø üÜõIOI International Sci-) ×���õ¤�Ô÷� ü÷�ú� ¢��³Þó� üÞÜä üÜÜÞó�ß�� ý�µ�Þî �Ìä ;]77 �� 1375[ (Committee]79 �� 1378[ (entific Committee�� 1377[ ùÂþÀõ ��b�û Å�þ¤ ;]8? �� 1373[ ùÂþÀõ ��b�û �Ìä ;]1373[ Ũ�õ ��b�û �Ìä :ö�Âþ� Â���³õ�î ßÞ¹÷� •ý�ûÅ÷�ÂÔ�î (ß�ÞµÔû ø ß�õ¤�ú�) üÞÜä ý�û�µ�Þî ñ�ÿÆõ �þ �Ìä ;(]75 �� 1373, 84 �� 79 [ Å�þ¤ °þ�÷ ø) ]79;]ö��î �� 1377[ "Â���³õ�î ü¨À�úõ ø ô�Üä' ý�ܹõ ý�þÂþ½� ��b�û �Ìä ;]ö��î �� 1374[ �÷��¨]1385[ Ũ�õ ��b�û �Ìä :ü÷�ª�î À�ÈÞ� ßþÀó����è üó�ä ©¥�õ� �ƨ�õ •]81 �� 1369[ �Ìä :¤�Èî ýÃþ¤�õ�÷Â� üó�äý�¤�ª ,Â���³õ�î ü¨À�úõ ý�µª¤ ýÃþ¤�õ�÷Â� ý�µ�Þî •üó�ä ©¥�õ� ø Ù�ûÂê �¤�¥ø ýùÀ�þ�Þ÷ ]72 �� 1370 ø 63 �� 1362[ :¤�Èî ×���õ¤�Ô÷� üó�ä ý�¤�ª •�¤�ª ö� üÈûøÄ� ý�µ�Þî �Ìä ø ]72 �� 1370[ :üó�ä ©¥�õ� ø Ù�ûÂê �¤�¥ø ×���õ¤�Ô÷� ý�¤�ª •]87 �� 1381[ �Ìä :ßþ�÷ âþ��¬ ö�õ¥�¨ "¤�Ãê�ôÂ÷ ´ã�¬' ý�µ�Þî •]ö��î�� 1374[ �Ìä :"�Ø�÷�Âþ� ��µ�þ�¨' ý�ܹõ ý�þÂþ½� ��b�û •]81 �� 1371[ �Ìä :�ØÆ÷�þ üÜõ ö��Æ�Þî �� �µÆ��ø ×���õ¤�Ô÷� üÜõ ý�µ�Þî •]81 �� 1380[ �Ìä :¤�Èî ýÃþ¤�õ�÷Â� ø ´þÂþÀõ ö�õ¥�¨ ,��ä�Ï� ý¤ø��ê üÈûøÄ� ý�µ�Þî •1364[ üª¥�õ� ¤��µ¨¢ ,]68 �� 1366[ üÈûøÄ� ¤��µ¨¢ :�ØþÂõ� ,��÷��Ü�Æ�� üµó�þ� ù�ÚÈ÷�¢ ,Â���³õ�î ÝÜä ýùÀØÈ÷�¢ •]66 ��ý�µª¤ ýÃþ¤�õ�÷Â� íµÈõ ý�µ�Þî �Ìä ø ëÂ� ü¨À�úõ ý�µ�Þî Â���³õ�î ý�¡�ª ñ�ÿÆõ :üÚ�ûÂê ��Ö÷� ¢�µ¨ •]60 �� 1359[ ��ä�Ï� ø ¤�õ� À��ø ´¨Â�¨ ;]63 �� 1359[ Â���³õ�î]58 �� 1357[ :ö�Âþ� üÞ�� ý¦Â÷� ö�õ¥�¨ ,ݵÆ�¨ Åþ�÷ �õ�÷Â� •üÈûøÄ� ý�û���õ¥ 4�û¤�îø¥�¨ ü��ÂÏ ø �ûý¥�� ý�þÂÑ÷ ,ý¥��õ ý�ûݵþ¤�Úó� ø �ûݵÆ�¨ ,�ûݵþ¤�Úó� Û�ܽ� ø ü��ÂÏ ,ü��±¨�½õ ý�¨À�û(¤�ȵ÷� ¾þ¤�� ÅØä °��Â���) üÞÜä ý�û�ó�Öõ 5üÞÜä ý�û�ܹõ ¤¢

1. Mojtaba Nouri Bygi, and Mohammad Ghodsi, Near Optimal Line Segment Queries in Simple Poly-

gons, Journal of Discrete Algorithms, Vol. 35, pp. 51-61, 2015.

2. Mojtaba Nouri Bygi, Shervin Daneshpajouh, Sharareh Alipour, and Mohammad Ghodsi, Weak

Visibility Counting in Simple Polygons, Journal of Computational and Applied Mathematics, 288,

pp. 215-222, 2015.

3. Sharareh Alipour and Mohammad Ghodsi, Visibility testing and counting, Information Processing

Letters, Vol. 115, No. 9, pp. 649-654, 2015. 2

Page 3: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

4. Azadeh Tabatabaei, and Mohammad Ghodsi, Walking in streets with minimal sensing, Journal of

Combinatorial Optimization, Vol. 30, No. 2, pp. 387-401, 2015

5. Ehsan Shoja and Mohammad Ghodsi, GPU-Based Parallel Algorithm for Computing Point Visibility

Inside Simple Polygons, to appear, Computers & Graphics, Elsevier, Vol. 49, pp. 1-9, 2015.

6. Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi, and MhammadAli Safari, Euclidean Move-

ment Minimization, Journal of Combinatorial Optimization, pp. 1-14, Feb. 2015.

7. Mojtaba Nouri Baygi and Mohammad Ghodsi, Weak Visibility Queries of Line Segments in Simple

Polygons and Polygonal Domains, International Journal of Computer Mathematics, Feb. 2015.

8. Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, and MohammadAli Safari, Optimal

space coverage with white convex polygons, Journal of Combinatorial Optimization, pp. 1-13, De-

cember 2014.

9. Fatemeh Dabbaghi Zarandi, Mohammad Ghodsi, A hybrid algorithm for terrain simplification (in

Persian), Iranian Journal of ECE, Vol. 12, No. 1, Summer 2014.

10. Azadeh Tabatabaei, Mohammad Ghodsi, Walking in streets with minimal sensing, Journal of Comp-

inatorial Optimization, published online, Sept. 2014.

11. MohammadAmin Fazli, Jafar Habibi, Mohammad Ghodsi, Sina Sadeghian, Pooya Jalali, Vahab

Mirrokni, On Non-progressive Spread of Influence through Social Networks, Theoretical Computer

Science, Volume 550, 18 September 2014, Pages 36-50.

12. MohammadAli Abam, Shervin Daneshpajouh, Lasse Deleuran, Shayan Ehsani, Mohammad Ghodsi,

Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and

Applications (CGTA). Volume 47, Issue 7, August 2014, Pages 728-739.

13. Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Yorg-Rudiger Sack, and Hamid Zarrabi-

Zadeh, alpha-Visibility, Computational Geometry: Theory and Applications (CGTA), Volume 47,

Issue 3, Part A, April 2014, Pages 435-446.

14. Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar,

Morteza Zadimoghaddam, Scheduling to minimize gaps and power consumption, Journal of Schedul-

ing, 16(2): 151-160 (2013).

15. Hamed Ghasemieh, Mohammad Ghodsi, Hamid Mahini, Mohammad Ali Safari, Pricing in popula-

tion games with semi-rational agents, Operations Research Letters, Volume 41, Issue 3, May 2013,

pp. 226-231.

16. Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immor-

lica, Hamid Mahini, Vahab Mirrokni, Equilibrium Pricing with Positive Externalities, Theoretical

Computer Science, Volume 476, 11 March 2013, pp. 1-15.

17. Mostafa Nouri Baygi, Mohammad Ghodsi, Space/Query-time Tradeoff for Computing the Visibility

Polygon, Computational Geometry, Theory and Applications (CGTA), Elsevier, Volume 46, Issue

3, April 2013, pp. 371-381.

18. Mostafa Nouri Baygi, Mohammad Ghodsi, Scheduling tasks with exponential duration on unrelated

parallel machines, Discrete Applied Mathematics, Volume 160, Issues 16-17, November 2012, pp.

2462-2473. 3

Page 4: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

19. Shervin Daneshpajouh, Mohammad Ghodsi, Alireza Zarei, Computing Polygonal Path Simplification

under Area Measures, Graphical Models, Elsevier, Volume 74, Issue 5, September 2012, pp. 283-289.

20. Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad, Optimal

Online Pricing with Network Externalities, Information Processing Letters (IPL), vol. 112 (2012),

pp. 118-123.

21. Alireza Zarei, Mohammad Ghodsi, Oberver-Dependent Simplification of Visibility Polygons, Algo-

rithmica, Vol. 62, Numbers 3-4, pp. 842-862, 2012.

22. Hamid Nazerzadeh, Mohammad Ghodsi, RAQ: A Range-Queriable Distributed Data Structures,

CSI journal on CSE, Vol 6, No. 2 and 4, Summer 2008 and Winter 2009, pp. 1-5.

23. Mohammad Ghodsi, Hamid Mahini, Vahhab S. Mirrokni, Morteza Zadimoghadam, Permutation

Betting Markets: Singleton Betting with Extra Information, Algorithmica 60(4), pp. 853-876, 2011.

24. Mohammad Ghodsi, Hamid Mahini, Vahhab Mirrokni, Morteza Zadimoghadam, Permutation Bet-

ting Markets: Singleton Betting with Extra Information, Algorithmica, 2010.

25. Saeed Alaei, Mohammad Ghodsi, and Mohammad Toosi, SkipTree: A New Scalable Distributed

Data Structure on Multidimensional Data Supporting Range-Queries, Computer Communications,

Volume 33, No. , pp. 73-82, Jan. 2010.

26. Alireza Zarei, Mohammad Ghodsi, A Practical Approach for Planar Visibility Maintenace, Journal

for Geometry and Graphics, Volume 13, No. 1, pp. 75-90, 2009.

27. Mehdi Kargar, Mohammad Ghodsi, Truthful and Secure Routing in Ad Hoc Networks with Malicious

and Selfish Nodes, International Journal of Security and Its Applications (IJSIA), Vol 3, No. 1, Jan.

2009, pp. 117-128.

28. Farshad Rostamabadi, Mohammad Ghodsi, Incremental labeling in closed-2PM model, Special Is-

sue on Advances in Computing Systems Science and Engineering, in the Elsevier’s Computers &

Electrical Engineering journal, 2008.

29. Alireza Zarei, Mohammad Ghodsi, Query Point Visibility Computation in Polygons with Holes,

Computational Geometry: Theory and Applications, Volume 39, Issue 2, February 2008, Pages

78-90.

30. Alireza Zarei, Mohammad Ghodsi, A New Algorithm for Guarding Triangulated Irregular Networks,

CSI journal of Computer Science and Engineering, 2007.

31. Ramtin Khosravi, Mohammad Ghodsi, Query-Point Visibility Constrained Shortest Paths in Simple

Polygons, Theoretical Computer Science, Volume 389, Issues 1-2, 10 December 2007.

32. Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin Sayedi R, Morteza

Zadi Moghadam, Spanning trees with minimum weighted degrees, Information Processing Letters,

Vol. 104, issue 3, pp. 113-116, 31 Oct. 2007.

33. Farshad Rostamabadi, Mohammad Ghodsi, Label updating to avoid a moving point-shaped object

in fixed models, Theoretical Computer Science, Elsevier, Volume 369, Issues 1-3, 15 December 2006,

Pages 197-210. 4

Page 5: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

34. Mohammad Ali Abam, Mohammad Ghodsi, An Approximation Algorithm for d1-optimal Motion

of a Rod Robot with Fixed Rotations, International Journal of Computer Mathematics, Volume 83,

No. 3, Pages 357-370, March 2006.

35. Ramtin Khosravi, Mohammad Ghodsi, Shortest Paths with Single-Point Visibility Constraint, Sci-

entia Iranica, Vol 13, No. 1, pp. 25-32, Winter 2006.

36. Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi, An Efficient Universal Addition Scheme

for All Hybrid-Redundant Representations with Weighted Bit-Set Encoding, Journal of VLSI Signal

Processing 42, pp. 149-158, 2006.

37. Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi, Weighted Two-Valued Digit-Set Encod-

ings: Unifying Efficient Hardware Representation Schemes for Redundant Number Systems, IEEE

Transactions on Circuits and Systems I: Regular Papers, Vol. 52, No. 7, pp. 1348-1357, July 2005.

38. Ramtin Khosravi, Mohammad Ghodsi, Shortest Paths in Simple Polygons with Polygon-Meet Con-

straints, Information Processing Letters, Volume 91, Issue 4, 31 August 2004, Pages 171-176.

39. Ramtin Khosravi, Mohammad Ghodsi, Shortest Paths in Simple Polygons with Polygon-Meet Con-

straints, Information Processing Letters 91, pp. 171-176, 2004.

40. Ghassem Jaberipur, M. Ghodsi, High Radix Signed Digit Number Systems: Implementation Paradigms,

Scientia Iranica, Volume 10, Number 4, pp. 383–391, Fall 2003.

41. Aarash Termechi, Mohammad Ghodsi, Pipelined Operator Tree Scheduling in Heterogeneous Envi-

ronments, Journal on Parallel and Distributed Computing (JPDC), Volume 63, Issue 6, pp. 630–637,

June 2003.

42. Mohammad Ghodsi, Mehdi SharifZadeh, ParLEDA: A Library for Parallel Implementation of Com-

putational Geometry Applications, International Journal on Engineering, Volume 16, No. 2, pp.

123–132, July 2003.

43. Mohammad Ghodsi, Mohammad T. Hajiagahi, Mohammad Mahdian, S. Vahab Mirrokni, Complex-

ity of Path-matching Problems in Graphs, Networks: An International Journal, Vol 39, No. 4, pp.

210-215, July 2002.

44. Shayan GhaziZadeh, Mohammad Ghodsi, and Amin Saberi, Protocols for Assymetric Communica-

tions: Reaching the Lower Bounds,, Scientia Iranica, Vol. 8, No. 4, Fall 2001.

45. Mohammad Ghodsi, Kiarash Bazargan, Automatic Design of Persian Typefaces, (in Persian), Es-

teglal, Vol. 20, No. 1, Summer 2001, pp.113-126.

46. Mohammad Ghodsi, Performance Modeling of Distributed Programs by Stochastic Decision Free

Petri Nets, Scientia Iranica, Vol. 8, No. 4, Fall 2001.

47. Mohammad Ghodsi and Krishna Kant, Performance Analysis of Parallel Search Algorithms on Mul-

tiprocessor Systems, Performance Evaluation (North Holland) Sept. 1991, pp. 67-81.üÜÜÞó�ß�� ý�ûÅ÷�ÂÔ�î ¤¢48. Azadeh Tabatabaei, Mohammad Ghodsi, and Fardin Shapouri. Competitive Strategy for Walking5

Page 6: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

in Generalized Streets for a Simple Robot.) The 28th Canadian Conference on Computational

Geometry (CCCG 2016).

49. Azadeh Tabatabaei, and Mohammad Ghodsi. (Randomized Strategy for Walking in Streets for a

Simple Robot, The 31th Annual European Workshop on Computational Geometry (EuroCG 2015),

March 15-18, Ljubljana, Slovenia, 2015.

50. Sharareh Alipour, Mohammad Ghodsi, Amir Jafari, An Improved Constant-Factor Approximation

Algorithm for Planar Visibility Counting Problem. COCOON 2016: 209-221

51. Mohammad Abouei Mehrizi, Mohammad Ghodsi, and Azadeh Tabatabaei, Robots Cooperation for

Finding a Target in Streets, 1st IPM International Conference on Topics in Theoretical Computer

Science (TTCS), Sept. 2015.

52. Azadeh Tabatabaei and Mohammad Ghodsi, [ A Randomized Strategy for Walking in Streets for a

Simple Robot, accepted, The 31th Annual European Workshop on Computational Geometry (Eu-

roCG 2015), March 15-18, Ljubljana, Slovenia, 2015.

53. Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, and Masoud Seddighin, Bounds

on Color-Spanning Set Unit Covering, The 9th International Workshop on Algorithms and Com-

putation (WALCOM 2015), Dhaka, Bangladesh, February 26-28, 2015, published by LNCS, Vol

8973.

54. Azadeh Tabatabaei and Mohammad Ghodsi, Optimal Strategy for Walking in Streets with Minimum

Number of Turns for a Simple Robot, The 8th Annual International Conference on Combinatorial

Optimization and Applications (COCOA’14). December 19-21, 2014, in Maui, Hawaii, USA. Pub-

lished in Springer’s Lecture Notes in Computer Science Volume 8881, 2014.

55. Salma Sadat Mahdavi, Saeed Seddighin and Mohammad Ghodsi, Covering Orthogonal Polygons with

Sliding k-transmitters, The 26th Canadian Conference on Computational Geometry (CCCG2014)

August 11-13, 2014 in Halifax, Nova Scotia, Canada.

56. Sharareh Alipour, Mohammad Ghodsi, A randomized approximation method for visibility count-

ing problem, The CSI Intrnational Symposium on Computer Science and Software Engineering

(CSSE’2013), Sharif Universuty of Tech, Tehran, Iran, December, 2013.

57. Sharareh Alipour, Mohammad Ghodsi, U. Gudukbay, and M. Golkari, An Approximation Algo-

rithm for Computing the Visibility Region of a Point on a Terrain and Visibility testing, the 9th

International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and

Applications (VISAPP’2014).

58. Azadeh Tabatabaei and Mohammad Ghodsi, Walking in Streets with Minimal Sensing, The 7th

Annual International Conference on Combinatorial Optimization and Applications (COCOA’13).

December 12-14, 2013, Chengdu, China. Published in Springer’s Lecture Notes in Computer Science

Volume 8287, 2013, pp 361-372

59. Sharareh Alipour, Mohammad Ghodsi, A randomized approximation method for visibility count-

ing problem, The CSI Intrnational Symposium on Computer Science and Software Engineering

(CSSE’2013), Sharif Universuty of Tech, Tehran, Iran, December, 2013.6

Page 7: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

60. Arash Vaezi, Mohammad Ghodsi, Extending Visibility Polygons by Mirrors to Cover Specific Targets,

EuroCG 2013, Braunschweig, Germany, March 17-20, 2013.

61. Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri1, Yorg-Rudiger Sack, and Hamid Zarrabi-

Zadeh, alpha-Visibility, 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’2012),

Helsinki, Finland, 4-6 July 2012, pp. 1-12.

62. Mohsen Sayadiharikandeh, Mohammad Ghodsi, Mohammad Naghibi, PostRank: A New Algorithm

for Incremental Finding of Persian Blog Representative Words, 2nd International Conference on Web

Intelligence, Mining and Semantics (WIMS’2012), June 13-15, 2012, ACM 2012, ISBN 978-1-4503-

0915-8. Craiova, Romania.

63. Mohammadamin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab Mir-

rokni and Sina Sadeghian Sadeghabad, On the Non-progressive Spread of Influence through Social

Networks, 10th Latin American Symposium on Theoretical Informatics (LATIN’2012), 16-20 April

2012, the Universidad Cato’lica San Pablo, Arequipa, Peru, pp. .

64. Mojtaba NouriBygi, Mohammad Ghodsi, Weak Visibility Queries in Simple Polygons, The 23rd

Canadian Conference on Computational Geometry (CCCG’11), Toronto, Canada, August 10-12,

2011.

65. Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi, Pooya Jalaly Khalilabadi, Mohammad

Ali Safari, Euclidean Movement Minimization, The 23rd Canadian Conference on Computational

Geometry (CCCG’11), Toronto, Canada, August 10-12, 2011.

66. Shervin Daneshpajouh, Mohammad Ghodsi, A Heuristic Homotopic Path Simplification Algorithm,

International Conference on Computational Science and Its Applications (ICCSA’2011), Santander,

Spain, June 20-23, 2011. Proceedings, Part III. LNCS 6784, Springer, pp. 132-10, 2011.

67. Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, Mohammad Ali Safari, Morteza Saghafian,

and Mohammad Tavakoli, White Space Regions, 37th Conference on Current Trends in Theory and

Practice of Computer Science (SOFSEM’2011), Novy’ Smokovec, Slovakia, January 22-28, 2011,

published by Springer LNCS 6543, pp. 226-237, 2011.

68. Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Hamid Mahini, Vahab S. Mir-

rokni and Afshin Nikzad, Optimal Iterative Pricing over Social Networks (Extended Abstract),

6th Workshop on Internet & Network Economics (WINE’ 2010), December 13-17, 2010, Stanford

University, Stanford, California, USA, pp. 415-423.

69. Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid

Mahini and Vahab S. Mirrokni, Equilibrium Pricing with Positive Externalities (Extended Abstract),

6th Workshop on Internet & Network Economics (WINE’ 2010), December 13-17, 2010, Stanford

University, Stanford, California, USA, pp. 424-431.

70. Mostafa Nouri Baygi and Mohammad Ghodsi, Partial Visibility Polygon with Semi-Transparent

Objects, The 26th European Workshop on Computational Geometry (EuroCG’10), 2010.

71. Mostafa Nouri Baygi and Mohammad Ghodsi, Space-Query-Time Tradeoff for Computing the Visi-

bility Polygon, Third International Workshop on Frontiers in Algorithmics, 2009.7

Page 8: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

72. Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi, Parallel Minimum Spanning Tree Heuris-

tic for the Steiner Problem is Graphs, The 13th IEEE International Conference on Parallel and

Distributed Systems, December 5 - 7, 2007 National Tsing Hua University , Hsinchu , Taiwan.

73. Mahmoud Hasanlou, Mohammad Ghodsi, A High Performance Parallel IP Lookup Technique Using

CREW PRAM Based Multiprocessor Organization 15th IEEE International Conference on Networks

ICON2007, 19-21 November 2007, Adelaide, South Australia.

74. Amir Ali Khosravi, Alireza Zarei, Mohammad Ghodsi, Efficient Visibility Maintenance of a Mov-

ing Segment Observer inside a Simple Polygon, The 19th Canadian Conference on Computational

Geometry (CCCG’2007), pp. 249-252, August 20-22, 2007.

75. Mostafa NouriBygi, Alireza Zarei, Mohammad Ghodsi, Weak Visibility of Two Objects in Planar

Polygonal Scenes, 7th Annual International Workshop on Computational Geometry and Applications

(CGA’07), Kuala Lumpur, Malaysia, LNCS (Volume 4705) by Springer-Verlag, 2007, pp. 68-81.

76. Mojtaba NouriBygi, Mohammad Ghodsi, 3D Visibility and the Partial Visibility Complex, 7th

Annual International Workshop on Computational Geometry and Applications (CGA’07), Kuala

Lumpur, Malaysia, August 26-29, 2007, to be published by the IEEE Computer Society, 2007.

77. Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuheir Montazeri, Computational Power of the

Quantum Turing Automata, International Conference on Information Technology: New Generations

(ITNG) 2007, published by the IEEE Computer Society, pp. 1077-1082.

78. Seyed Iman Mirrezaei, Javad Shahparian, Mohammad Ghodsi, RAQNet: A Topology-Aware Overlay

Network, AIMS’2007, LNCS 4543 by Springer-Verlog, pp. 13-24, 2007.

79. Eric Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin Sayedi-Roshkhar, Morteza

ZadiMoghadam, Scheduling to Minimize Gaps and Power Consumption, 19th ACM Symposium on

Parallelism in Algorithms and Architectures (SPAA’07), San Diego, CA, USA, June 9-11, 2007.

80. Meysam Tavassoli, Mohammad Ghodsi, Farnoosh Khodakarami, S. Mehdi Hashemi, An Algorithm

for 3D-Biplanar Graph Drawing, 23rd European Workshop on Computational Geometry, Marh 19-

21, 2007, Graz Universiy of Technology, Austria.

81. Mojtaba Nouri Bygi, Mohammad Ghodsi, Improving the Construction of the Visibility?Voronoi

Diagram, 23rd European Workshop on Computational Geometry, Marh 19-21, 2007, Graz Universiy

of Technology, Austria.

82. Hassan Sayyadi, Sara Salehi, Mohammad Ghodsi, Using Similarity Flooding for Extracting Similar

Parts of Proteins, International MultiConference of Engineers and Computer Scientists 2007, Hong

Kong, 21-23 March, 2007, pp. 497–501.

83. Alireza Mahdian, H. Khaliali, Ehsan Nourbakhsh, Mohammad Ghodsi, Web Graph Compression by

Edge Elimination, IEEE Data Compression Conference (DCC’2006), March 28 - 30, 2006, Snowbird,

Utah, USA,

84. Raheleh Salari, Mohammad Ghodsi, An Adaptive Algorithm for Supporting Complex Queries in

P2P Systems, 4th ACS/IEEE International Conference on Computer Systems and Applica tions

(AICCSA-06), March 8-11, 2006, UAE. 8

Page 9: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

85. Yasser Ganji Saffar, Kumars Sheykh Esmaili, Mohammad Ghodsi, Hassan Abolhassani, Parallel

Online Ranking of Web Pages, 4th ACS/IEEE International Conference on Computer Systems and

Applications (AICCSA-06), March 8-11, 2006, UAE.

86. Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi, SkipTree: A Scalable Range-Queryable Dis-

tributed Data Structure for Multidimensional Data, The 16th Annual International Symposium on

Algorithms and Computation (ISAAC’2005), Dec. 19 - 21, 2005, Sanya, Hainan, China, LNCS 3827,

Springer-Verlog, pp. 298-307, 2005.

87. Hossein Jowhari, Mohammad Ghodsi, New Streaming Algorithms for Counting Triangles in Graphs,

The Eleventh International Computing and Combinatorics Conference (COCOON’2005), August

16-19, 2005, Kunming, Yunnan, LNCS 3595, pp. 710-716, Springer-Verlog.

88. Alireza Zarei, Mohammad Ghodsi, Efficient Computation of Query Point Visibility in Polygons with

Holes, 21st Annual ACM Symposium on Computational Geometry, June 6-8, 2005, Pisa, Italy.

89. Morteza Monemizadeh, Mohsen Kamyar, and Mohammad Ghodsi, Top-Down Methods for Dupli-

cate Host Detection via Nearest Neighbor Techniques, 4th International Workshop on Efficient and

Experimental Algorithms (WEA’2005), May 10-13, 2005 Greece.

90. Farshad Rostamabadi, Mohammad Ghodsi, An Efficient Algorithm for Label Updating in 2PM

Model to Avoid a Moving Object, 21th European Workshop on Computer Geometry, March 9-11,

2005, pp. 131-134.

91. Ramtin Khosravi, Mohammad Ghodsi, The Fastest Way to View a Query Point in Simple Polygons,

21th European Workshop on Computer Geometry, March 9-11, 2005, pp. 187-190.

92. Mohammad Ghodsi, Oktie Hassanzadeh, Shahab Kamali, Morteza Monemizadeh, A Hybrid Method

for Refreshing Web Pages Repository, The 10th International Conference on Database Systems for

Advanced Applications (DASFAA 2005), April 18-20, 2005, Beijing, China, LNCS 3453, pp. 588-593

Springer-Verlog, 2005i, pp. 588-593.

93. Hamid Nazerzadeh, Mohammad Ghodsi, RAQ: A Range-Queriable Distributed Data Structures,

31st Annual Conference on Current Trends in Theory and Practice of Informatics, (SOFSEM’2005),

LNCS, Vol. 3381-0264, Springer-Verlog, 2005i, pp. 270-277.

94. Farshad Rostamabadi, Mohammad Ghodsi, A Fast Algorithm for Updating a Labeling to Avoid a

Moving Point, Proceedings of 16th Canadian Computational Geometry Conference (CCCG’2004),

Montreal, Canada, Sept. 2004, pp. 204-208.

95. Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi, Common-deadline Lazy Beauracrat Scheduling

Problems, 7th Workshop on Algorithms and Data Structures WADS’2003, Ottawa, Canada, July

30-Aug 1, 2003, LNCS, Vol. 2748, pp. 59-66, Springer-Verlog.

96. Ramtin Khosravi, Mohammad Ghodsi, Shortest Paths in Polygonal Domains with Polygon-Meet

Constraints, 19th European Workshop on Computer Geometry, March 24-26, 2003.

97. Farshad Rostamabadi, Mohammad Ghodsi, Unit Height k-Position Map Labeling, 19th European

Workshop on Computer Geometry, March 24-26, 2003.9

Page 10: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

98. Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi, Weighted Bit-Set Encodings for Redun-

dant Digit Sets: Theory and Applications, 36th Asilomar Conf. Signals, Systems, and Computers,

Pacific Grove, CA, Nov. 3-6, 2002

99. Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi, A Class of Stored-Transfer Represen-

tations for Redundant Number Systems, 35th Asilomar Conf. Signals, Systems, and Computers,

Pacific Grove, CA, Nov. 4-7, 2001

100. Arash Termehchy, Mohammad Ghodsi, Approximate Solutions to Pipelined Operator Tree Schedul-

ing for Uniform Processors, IASTED International Conference on Parallel and Distributed Comput-

ing and Systems (PDCS2001), August 21-24, 2001, Anaheim, USA

101. Ramtin Khosravi, Mohammad Ghodsi, Mana Taghdiri, Shortest Point-Visible Paths on Polyhedral

Surfaces, The 10th International Conference on Computing and Information (ICCI ’2000), November

18-21, 2000

102. Mohammad Ghodsi, Y-R. Sack, A Coarse Grained Parallel Solution to Terrain Simplifications,

Proceedings of 10th Canadian Computational Geometry Conference (CCCG’98), Montreal, Canada,

Sept. 1998.

103. Mohammad Ghodsi, Kishna Kant, Performance Analysis of Parallel Search Algorithms, Proceedings

of the 14th IFIP WG7.3 Int’l Symposium on Computer Performance Modeling, 12-14 Sept. 1990,

pp. 407-421

104. Mohammad Ghodsi, Kishna Kant, Well-Formed Generalized Task Graphs, Proceedings of 3rd IEEE

Symposium on Parallel and Distributed Processing, Dallas, Texas U.S.A., Dec 1991.

105. Mohamad Ghodsi, Krishna Kant, Performance Modeling of Concurrent Systems Under Resource

Constraints, Parallel Computing ’89, Elsevier Science Pub. 1990, pp. 589-594.üÜ¡�¢ ý�ûÅ÷�ÂÔ�î ¤¢106. Fahimeh Dabbaghi, Mohammad Ghodsi, An Approximation Algorithm for Terrain Simplification,

(in Persian), 16th CSI Computer Conference (CSICC’2011), Sharif University of Technology, March

7-9, 2011 (Esfand 17-19, 1390), Tehran, Iran, pp. 591-595.

107. Fatemeh Saremi, Hoda Mashayekhi, Mohammad Ghodsi, Fault Tolerant Broadcast in One Port

Meshes of Trees with Distance Insensitive Routing, (in Persian) 13th CSI Computer Conference

(CSICC’2008), Sharif University of Technology, March 9-11, 2008, Kish Island, Persian Gulf, Iran.

108. A. Asudeh, A. Shiralinia, Mohammad Ghodsi, Accessing Maximum Network Flow in Wireless Sensor

Networks with Directed Antenna, (in Persian) 13th CSI Computer Conference (CSICC’2008), Sharif

University of Technology, March 9-11, 2008, Kish Island, Persian Gulf, Iran.

109. Iman Mirrezaei, Javad Shahparian, Mohammad Ghodsi, Load Balancing in RAQNet, a Multidimen-

sional P2P Network, (in Persian) 13th CSI Computer Conference (CSICC’2008), Sharif University

of Technology, March 9-11, 2008, Kish Island, Persian Gulf, Iran.10

Page 11: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

110. Javad Shahparian, Iman Mirrezaei, Mohammad Ghodsi, Topology-Aware Routing In Skip List Based

Distributed Data Structures, (in Persian) 13th CSI Computer Conference (CSICC’2008), Sharif

University of Technology, March 9-11, 2008, Kish Island, Persian Gulf, Iran.

111. Mojtaba NouriBaygi, Mohammad Ghodsi, 3D Visibility Graphs, 12th CSI Computer Conference

(CSICC’2006), Shahid Beheshti University, Tehran, Feb 20–22, 2007.

112. Alireza Zarei, Mohammad Ghodsi, Exact Visibility Maintenance in Planar Polygonal Scenes in

Practical Applications, 12th CSI Computer Conference (CSICC’2006), Shahid Beheshti University,

Tehran, Feb 20–22, 2007.

113. Amir Hedayati, S. Parsa, Mohammad Ghodsi, Touring a Sequence of Polygons in Weighted Regions,

12th CSI Computer Conference (CSICC’2006), Shahid Beheshti University, Tehran, Feb 20–22, 2007.¥�� :�÷�û��¡¢�¡ ýÀ��ö�õ¥ ý�Â� üÚ�û�Þû ¤�îø¥�¨ ,ü¨Àì ÀÞ½õ ,ö��Þ��¤ À��ø ,ü��Âä� À�ÞèøÂê ý¢�û ÀÞ½õ (114À�úª ù�ÚÈ÷�¢ ,1385 À�Ô¨� 3-1 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¢¥�ø¢ ,ß�Ú÷��õ ÂÑ�õ ¥� ýÂÚ÷.ö�Âú� ,üµÈú�ß�Þû¢¥�ø¢ í½µõ ÂðÅ� ý�û�رª ¤¢ üȱ�� ¤�µ¡�¨ù¢�¢ ¢Â�¤�î ü¨Àì ÀÞ½õ ,ü÷�úÔ¬� Ý�ã÷ ,üµãê¤ ¤��õ�î (115.ö�Âú� ,üµÈú� À�úª ù�ÚÈ÷�¢ ,1385 À�Ô¨� 3-1 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î�û´Æ�ó Â� ü�µ±õ ùÀªâþ¥�� ¤�µ¡�¨ù¢�¢ ¤¢ ü��þÂ�Æõ ¢�±ú� ,ü¨Àì ÀÞ½õ ,üþ�®¤Â�õ ö�Þþ� À�¨ ,ö�þ³û�ª ¢��� (116.ö�Âú� ,üµÈú� À�úª ù�ÚÈ÷�¢ ,1385 À�Ô¨� 3-1 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¢¥�ø¢ ,üªÂ�,Ý�¨ü� ÂðÅ� ý�û�رª ¤¢ ü·Ü·õ ¤�µ¡�¨ üêÂãõ ,¢�¢�¥¤ üÔÎÊõ À�¨ ,ü±�±� ÂÔã� ,ü¨Àì ÀÞ½õ ,ü��úõ À�Þ� (117.ö�Âú� ,üµÈú� À�úª ù�ÚÈ÷�¢ ,1385 À�Ô¨� 3-1 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¢¥�ø¢,Ý�¨ü� ÂÚÆ� ý�û�رª ¤¢ ü·Ü·õ ¤�µ¡�¨ üêÂãõ ,¢�¥�®¤À�¨ üÔÎÊõ ø ü±�±� ÂÔã� ,ü¨Àì ÀÞ½õ ,ü��úõ À�Þ� (1186-4 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¥�þ ý�÷��¨ Å÷�ÂÔ�î ß�Þû¢¥�þ ¤¢ ,IRANET ù�ð¤�î.ö�Âú� ,ßþ¢���� ý�ûÇ÷�¢ ÃîÂõ ,Â���³õ�î ô�Üä ýùÀØÈûøÄ� ,1384 ßÞú�,ü±þÂÖ� �¤�¬�� �û�ÈÖ÷ ý¤�Áð°Æ�Â� ý�Â� ý¥��õ üÞµþ¤�Úó� ,ü¨Àì ÀÞ½õ ,ý¢���ݵ¨¤ ¢�ªÂê ,üܨ�� Ý·�õ (119ý�ûÇ÷�¢ ÃîÂõ ,Â���³õ�î ô�Üä ýùÀØÈûøÄ� ,1384 ßÞú� 6-4 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¥�þ.ö�Âú� ,ßþ¢����Å÷�ÂÔ�î ß�Þû¥�þ ,ýÀã� 3 ý�Ìê ¤¢ ý¤�ÀþÀ� Í��ø¤ ý¤�¢�Ú÷ ,ü¨Àì ÀÞ½õ ,üä¤�¥ �®¤üÜä ,üÚþ��ý¤�÷ ü±µ¹õ (120.ö�Âú� ,ßþ¢���� ý�ûÇ÷�¢ ÃîÂõ ,Â���³õ�î ô�Üä ýùÀØÈûøÄ� ,1384 ßÞú� 6-4 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î121. F. Rostamabadi, M. Ghodsi, Incremental Labeling in Closed-2PM Model, (in Persian) 11th CSI

Computer Conference (CSICC’2006), IPM School of Computer Science, Tehran, Jan 24–26, 2006.

122. A. Zarei, A. A. Khosravi, M. Ghodsi, Maintaining Visibility Polygon of a Moving Point Observer

in Polygons with Holes, 11th CSI Computer Conference (CSICC’2006), IPM School of Computer

Science, Tehran, Jan 24–26, 2006.

123. A. Mahdian, H. Khalili, M. Ghodsi, Pre-compression Algorithm for Link Structure of the Web, 11th

CSI Computer Conference (CSICC’2006), IPM School of Computer Science, Tehran, Jan 24–26,

2006.

124. H. Mousavi, H. Chiniforooshan, M. E. Rafiei, M. Ghodsi, Flow Driven Routing in Ad Hoc Sensor

Networks, 11th CSI Computer Conference (CSICC’2006), IPM School of Computer Science, Tehran,

Jan 24–26, 2006. 11

Page 12: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

��ä�Ï� ý¤ø��ê Å÷�ÂÔ�î ß�õø¢ ,�û�ÈÖ÷ ý¤�Áð°Æ�Â� ý�Â� ý¥��õ ݵþ¤�Úó� ,ü¨Àì ÀÞ½õ ,ùøÄ�Ç÷�¢ ßþøª (1251384 ¢�¢Â¡ ,ö�Âú� ,Â�±îÂ�õ� üµã�¬ ù�ÚÈ÷�¢ ,(IKT 2005) Ç÷�¢ øÅ÷�ÂÔ�î ß�õø¢ ,ö�ó¢ ýÀ��¶Ü·õ Û� ý�Â� DeWall ݵþ¤�Úó� ý¥�¨ý¥��õ ,ü¨Àì ÀÞ½õ ,ý¢ÂØû¢ ýøÂÆ¡ üÜä (1261384 ¢�¢Â¡ ,ö�Âú� ,Â�±îÂ�õ� üµã�¬ ù�ÚÈ÷�¢ ,(IKT 2005) Ç÷�¢ ø ��ä�Ï� ý¤ø��ê127. Alireza Zarei and M. Ghodsi, Some Results on Computing the Visibility of a Query Point inside

Polygons with Holes, 10th CSI Computer Conference (CSICC’2005), Iran Communications Reseach

Center, Tehran, Feb 15–17, 2005, pp. 222-229.

128. H. Nazerzadeh, M. Ghodsi, and S. Sajjadian, Parallel Subspace Clustering, 10th CSI Computer

Conference (CSICC’2005), Iran Communications Reseach Center, Tehran, Feb 15–17, 2005, pp.

230-237.Å÷�ÂÔ�î ß�Þû¢ ,Àþ¢ ´�Ü��ì À�ì �� ù¢�¨ üãÜ®À��×þ ¤¢ ýÀ÷��� Â�Æõ ßþÂ�ù���î ,ü¨Àì ÀÞ½õ ,ü��® �®¤ÀÞ½õ (129.ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1383 ßÞú� 27-29 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�îùÄþø ý�û�رª ü��þÂ�Æõ ý�ûÛØ�øÂ� ý�Æþ�Öõ ýÀÞ�� À¨� ø ü¨Àì ÀÞ½õ ,Âì�õ üÜä ,ý�®¤ ´ãþª °�þ¥ (130��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1383 ßÞú� 27-29 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¢ ,üþ�¤�î °Æ�Â�.ö�Âþ�,üûøÂð Ç¿� ¥� ù¢�Ôµ¨� �� DSR ÛØ�øÂ� ¢�±ú� ýÀÞ�� À¨� ø ü¨Àì ÀÞ½õ ,Âì�õ üÜä ,ý�®¤ ´ãþª °�þ¥ (131.ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1383 ßÞú� 27-29 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¢ùÄþø ý�û�رª ü��þÂ�Æõ ý�ûÛØ�øÂ� ý�Æþ�Öõ ýÀÞ�� À¨� ø ü¨Àì ÀÞ½õ ,Âì�õ üÜä ,ý�®¤ ´ãþª °�þ¥ (132��Ö�Ö½� ÃîÂõ ,1383 ßÞú� 27-29 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þû¢ ,ý¦Â÷� éÂÊõ °Æ�Â�.ö�Âþ� ��Â��¿õ,�ø ��½Ô¬ ýÀ���±�¤ ݵþ¤�Úó� ý¥��õ ø �¤�î ý�±¨�½õ ¤¢ ý¥�¨Ýû¤¢ ¢Â�¤�î ,ü¨Àì ÀÞ½õ ,ýÀ��ø üÔÎÊõ (133.Óþª üµã�¬ ù�ÚÈ÷�¢ ,1382 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þú÷134. A. Shakeri and M. Ghodsi, “A New Approach for Ranking Web Pages,” 9th CSI Computer Confer-

ence (CSICC’2004), Sharif University of Technology, Feb 17–19, 2004.ß�ÞµÈû ,���È�� ùb¤�ª ×Þî �� ö�õ¥ ßþµÞî ¤¢ ¤�ȵ÷� ý�Â� ü±þÂÖ� ݵþ¤�Úó� ×þ ,ü¨Àì ÀÞ½õ ,��÷ ý¤�Æ÷��¡ À�õ� (135.ÀúÈõ ü¨ø¢Âê ù�ÚÈ÷�¢ ,1381 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�îÅ÷�ÂÔ�î ß�ÞµÈû ,ùÀª ýÀ��¶Ü·õ ÝÎ�õ�÷ ��Ψ ü÷�±úÚ÷ ý�Â� ÀþÀ� ݵþ¤�Úó� ×þ ,ü¨Àì ÀÞ½õ ,üä¤�¥ �®¤üÜä (136.ÀúÈõ ü¨ø¢Âê ù�ÚÈ÷�¢ ,1381 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�îÂ���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�ÞµÈû ,â÷�õ �� Í�½õ ¤¢ ���ø¤ Í¡Â� ´îÂ� ,ü¨Àì ÀÞ½õ ,�Â�� ..�ß�ä (137.ÀúÈõ ü¨ø¢Âê ù�ÚÈ÷�¢ ,1381 À�Ô¨� ,(ö�Âþ�Âc ���³õ�î Å÷�ÂÔ�î ß�ÞµÈû ,ýÀ÷��� �ܬ�ê ßþÂ�ù���î ý�ÜÿÆõ ý�Â� Àþ¢ ´±Ü��ì ,ýÀþ�b õ á¤�¥ ¢�Ãú� ø ü¨Àì ÀÞ½õ (138.ÀúÈõ ü¨ø¢Âê ù�ÚÈ÷�¢ ,1381 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î�139. Arash Farzan, M. Ghodsi, “New Results for Lazy Bureaucrat Scheduling Problem,” 7th CSI Com-

puter Confernce (CSICC’2002), Iran Telecommunication Research Center, March 3–5, 2002, pp.

66–71.ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�ÞµÔû ,ù¤�ª �رª ¥� ù¢�Ôµ¨��� �ûé�Âð ýÃ�õ�Ù÷¤ ,ü¨Àì ÀÞ½õ ,üä¤�¥ �®¤üÜä (140.72--79 ɬ ,ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1380 À�Ô¨� 9 �� 7 ,(ö�Âþ� Â���³õ�î12

Page 13: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�ÞµÔû , ý��ÎÖ÷Â�è ���ø¤ ý���ú� ´îÂ� ,ü¨Àì ÀÞ½õ ,ô��� üÜäÀÞ½õ (141.80--88 ɬ ,ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1380 À�Ô¨� 9 �� 7 ,(ö�Âþ�ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�ÞµÔû ,Boyer-Moore ݵþ¤�Úó� ͨ�µõ Û�ܽ� ,ü¨Àì ÀÞ½õ ,ö��Þª�û Ý�û�Â�� À�¨ (142.88--93 ɬ ,ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1380 À�Ô¨� 9 �� 7 ,(ö�Âþ� Â���³õ�îÅ÷�ÂÔ�î ß�ÞµÔû ,��� ¢�ã�� �� ý�û�Ìê ¤¢ �þ�ÆÞû ßþÂ�×þ¢Ã÷ ý�¹µÆ� ý¥�¨ ý¥��õ ,ü¨Àì ÀÞ½õ ,ý¤¢�ì À�¹õ (143.476--485 ɬ ,ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1380 À�Ô¨� 9 �� 7 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�îß�ÞµÔû ,¤�¢ö¥ø üú�øÀ�� ��Ψ ýø¤ Â�Æõ ßþÂ�ù���î ý¥��õ ý�� ø §Â� ,ü¨Àì ÀÞ½õ ,ù¢�¥ü��® À�Þ� (144--493 ɬ ,ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1380 À�Ô¨� 9 �� 7 ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î.486,���±�îÂ� ,é�Âð Å÷�ÂÔ�î ß�óø� ,�ûé�Âð ü¨�b¤ ýÃ�õ�Ù÷¤ ý�Â� ü±þÂÖ� ݵþ¤�Úó� ,ü¨Àì ÀÞ½õ ø ô��� üÜäÀÞ½õ (145Â�±îÂ�õ� üµã�¬ ù�ÚÈ÷�¢ ,1379 ßÞú� 12-13 ,�ûÂ�¤�î ø ü��±¨�½õ ý�ûݵþ¤�Úó�Å÷�ÂÔ�î ß�óø� ,üµÆ�ó ýÃ�õ�Ù÷¤ ¤¢ üÞµþ¤�Úó� ý�û©ø¤ ,ü�î¤Â�õ ��ûø À�¨ ø ü¨Àì ÀÞ½õ ,¢�¹¨ Â�È� À�¨ (146Â�±îÂ�õ� üµã�¬ ù�ÚÈ÷�¢ ,1379 ßÞú� 12-13 ,�ûÂ�¤�î ø ü��±¨�½õ ý�ûݵþ¤�Úó� ,���±�îÂ� ,é�ÂðëÂ� Å÷�ÂÔ�î ß�ÞµÈû ,VHDL ýùÀ�³� Ó�¬�� �� üµÈð¥�� ý�ûݵþ¤�Úó� ´ª�Ú÷ ,ý¤�úÏö�¤¢�Â� ø ü¨Àì ÀÞ½õ (147.ö�úÔ¬� üµã�¬ ù�ÚÈ÷�¢ ,1379 ´Èú±þ¢¤� ,ö�Âþ�´Èú±þ¢¤� ,ö�Âþ� ëÂ� Å÷�ÂÔ�î ß�ÞµÈû ,ýÀã��¨ ��Ψ ý¥��õ ýÀ���رª ,¢ÂêüõÂî� üÜäÀ�¨ ø ü¨Àì ÀÞ½õ (148.ö�úÔ¬� üµã�¬ ù�ÚÈ÷�¢ ,1379Å÷�ÂÔ�î ß�ÞȪ ,¤�¢ö¥ø ýùÀª ýÀ��¶Üa·õ ÝÑa �õ�÷ ��Ψ ýø¤ Â�Æõ ßþÂ�ù���î ,ù¢�¥ü��® À�Þ� ø ü¨Àì ÀÞ½õ (149.ö�úÔ¬� ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1379 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�îëÂ� Å÷�ÂÔ�î ß�ÞµÔû ,ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ý�û�رª ¥� ü½Î¨À�� üóÀõ ,ý¢���ݵ¨¤ ¢�ªÂê ø ü¨Àì ÀÞ½õ (150.ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1378 ´Èú±þ¢¤� 29 üó� 27 ,ö�Âþ�,ü��±¨�½õ ý�¨À�û ý�û¢Â�¤�î ¤¢ ý¥��õ ©¥�¢Â� ý�Â� ý��÷�¿��µî :�À�ó¤�� ,ù¢�¥Óþª ýÀúõ ø ü¨Àì ÀÞ½õ (151.ö�Âþ� ��Â��¿õ ��Ö�Ö½� ÃîÂõ ,1378 ´Èú±þ¢¤� 29 üó� 27 ,ö�Âþ� ëÂ� Å÷�ÂÔ�î ß�ÞµÔûß�Þ¹�� ,ùÀªýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ýø¤ Â� Àþ¢ ´�Ü��ì ý�ÜÿÆõ ý¥�¨ý¥��õ ,ü¨Àì ÀÞ½õ ø ù¢�¥ü��® À�Þ� (152.üµÈú� À�úª ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1378 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�îÂc ���³õ�î Å÷�ÂÔ�î ß�Þ¹�� ,ý¥��õ ý�û��ø§Â� ý¥�¨���ú� ¤¢ ýÀ��ö�õ¥ Û��Æõ ,ü¨Àì ÀÞ½õ ø ü��õÂ� ©¤� (153.üµÈú� À�úª ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1378 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î�ýùÀ��î¢Â¨ �� �ûß��¤�� ý�ç�� ýø¤ ö�þÂ� ý¥�¨��±ª ý¥��õ ©¥�¢Â� ,ü±�Ï ÀÞ½õ ø ü¨Àì ÀÞ½õ ,ôÀÖõü÷�ÀÜð ßÆ� (154ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1378 À�Ô¨� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�Þ¹�� ,üÈõ¢.üµÈú� À�úª, ¤�¢ö¥ø ýùÀªýÀ��¶Ü·õ ÝÑ�õ�÷ ý�û�رª ¤¢ ü±þÂÖ� Â�Æõ ßþÂ�ù���î ,ü÷�ðø�ð üÜã¹�ð ¤�ª�þ ø ü¨Àì ÀÞ½õ (155üµã�¬ ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1377 ßÞú� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�õ¤�ú�.ÓþªÂ� ´ª�Ú÷ �� ��� ¼Î¨ Ó�¬�� ¥� :ùÀ�³� ý�û�þ�¤� ü��ÂÏ ,ýøÂÆ¡ ß�µõ�¤ ø ¤��ýÂ��� ݨ�ì ,ü¨Àì ÀÞ½õ (156ü¨À�úõ ýùÀØÈ÷�¢ ,1377 ßÞú� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�õ¤�ú� ,FPGA ý�û�ª�Â� ýø¤.Óþª üµã�¬ ù�ÚÈ÷�¢ ,Â���³õ�îÂc ���³õ�îÅ÷�ÂÔ�î ß�õ¤�ú� ,�½Ô¬ ¤¢ Í¡É�¿È� ý�Â� é�û ÛþÀ±� ý¥�¨ý¥��õ ,Çþ�Â�� �®¤üÜä ø ü¨Àì ÀÞ½õ (157.Óþª üµã�¬ ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1377 ßÞú� ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î�13

Page 14: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î ß�õ�¨ ,ü¨¤�ê ý�ûÝÜì ý�ûµõ�¤�� ¤�î¢�¡ ü��ÂÏ ,üÔ¨�þ À�ÈÞ� ø ü¨Àì ÀÞ½õ (158.ö�Âþ� ´ã�¬øÝÜä ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1376 ý¢ ,(ö�Âþ��ä�Þ¹õ ,ý��÷�øÂ� �رª Â� ü�µ±õ ×�ó�µÆ�¨ ý�ûݵÆ�¨ ¤�î ù�½÷ üØ�ê�Âð Çþ�Þ÷ ,ù¤�þüÖ� �÷�µê ø ü¨Àì ÀÞ½õ (159,Â���³õ�î ´ÞÆì ,´ã�¬ ø ÝÜä ù�ÚÈ÷�¢ ,1374 ´Èú±þ¢¤� 28 �� 25 ö�Âþ� ëÂ� ü¨À�úõ Å÷�ÂÔ�î ß�õ�¨ ���Öõ.1-9 «ý�û�رª §�¨� Â� �ûݵÆ�¨ üþ�¤�î ü��þ¥¤� ø ý¥�¨ñÀõ ý�Â� üÎ�½õ ,ü÷�û�Âê ü��Âúª �®Â�Üä ø ü¨Àì ÀÞ½õ (160,´ã�¬ ø ÝÜä ù�ÚÈ÷�¢ ,1374 ´Èú±þ¢¤� 28 �� 25 ö�Âþ� ëÂ� ü¨À�úõ Å÷�ÂÔ�î ß�õ�¨ ���Öõ �ä�Þ¹õ ,ýµ�.268-275 « ,Â���³õ�î ´ÞÆìÂ���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î Å÷�ÂÔ�î ß�óø� ,Õ�ÜãµÆ÷ Í¡ éøÂ� ¤�î¢�¡ À�ó�� ,ö�ð¤¥�� ©¤��î ø ü¨Àì ÀÞ½õ (161.Óþª üµã�¬ ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1374 ý¢ ,(ö�Âþ�Å÷�ÂÔ�î ß�óø� ,X ý¢Â�¤�î ý�û�õ�÷Â� ý¥�¨ ü¨¤�ê ý�Â� üÜ� ù�¤ ü¨Àì ÀÞ½õ ø ,��÷�®¤©�÷��î ø ,ýÂ��¬ ¥Âõ�Âê (162.Óþª üµã�¬ ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ,1374 ý¢ ,(ö�Âþ� Â���³õ�î ßÞ¹÷�) �î� Âc ���³õ�î163. M. Ghodsi and F. Malakooti, “MultiPage Layout in TEX , the 1st CSI Computer Conference (CS-

ICC’95), Computer Engineering Department, Sharif University of Technology, Tehran, Iran.�ä�Þ¹õ ,üÞÜä ö�µõ ü��»êøÂ� ý�Â� ý¤�Ãê�ôÂ÷ :×�cü ¤̈� ê ,üìª ö�Âúõ ø ,ü�ƽó���� ßÆ� ,ü¨Àì ÀÞ½õ (164,´ã�¬ ø ÝÜä ù�ÚÈ÷�¢ ,1372 ßÞú� 21 �� 19 ,¢Â�¤�î ø ÇûøÄ� ,©¥�õ� :ö�Âþ� Â���³õ�î Å÷�ÂÔ�î ß�õø¢ ���Öõ.195-204 «,ü¨��ª¤�î âÎÖõ ¤¢ Â���³õ�î �µª¤ üû�ÚÈ÷�¢ ©¥�õ� ý�Â� IEEE ø ACM ý¢�ú�È�� ý�û�õ�÷Â� À÷ø¤ ,ü¨Àì ÀÞ½õ (165ù�ÚÈ÷�¢ ,ü�ê ùÀØÈ÷�¢ ,1371 ßÞú� 29 �� 27 ,Â���³õ�î ¢Â�¤�î ø ÇûøÄ� ,©¥�õ� Å÷�ÂÔ�î ß�óø� ���Öõ �ä�Þ¹õ.231-242 « ,ö�Âú��û��µî 6,üÞÏ�ê ��¤�ȵ÷� ,�ûݵþ¤�Úó� ø ý�û¤�µ¡�¨ù¢�¢ ¥� ý���þÃðÀ�� ý�ÜÿÆõ 600 ,ëª ýÂ�Ê÷ ßþÀþ� ø ü¨Àì ÀÞ½õ (11394 ô¤�ú� ø 1393 ô�¨ ,1392 ôø¢ ;1391 ¤£� ,ñø� :ô¤�ú� ���,1388 :��� ý�ûñ�¨ ,1394 Ý»�� ��� ,üÞÏ�ê ��¤�ȵ÷� ,Ó�ó�b� ,�ûݵþ¤�Úó� ü÷�±õ ø �û¤�µ¡�¨ù¢�¢ ,ü¨Àì ÀÞ½õ (2.1389 ñ�¨ üª¥�õ� ��µî ø 1388 ñ�¨ ¤¢ ÛÊê ýùÀþÃðÂ� ��µî .1394 ø 1393 ø 1391 ,1389,1382 :��� ý�ûñ�¨ ,1394 ô�¨ ��� ,üÞÏ�ê ��¤�ȵ÷� ,üÞµþ¤�Úó� ý�û�Þãõ ,üÜã¹�ð ¤�ª�þ ø ü¨Àì ÀÞ½õ (3.1393 ø 1392 ø 1387,1392 ô¤�ú� ��� ,üÞÏ�ê ��¤�ȵ÷� ,üÆþ�÷�õ�÷Â� ø ýÂÑ÷ :üÞµþ¤�Úó� ý�û�ÜÿÆõ ,ö�þÀúõ ÀÞ½õ ø ü¨Àì ÀÞ½õ (4.1392 ø 1384 ,1382 ,1378 :��� ý�ûñ�¨üó�ä ý�¤�ª (,ô�±�÷�� §� ø¤À÷� Ó�ó�� Computer Networks ��µî �Þ�Â�) ýÂ���³õ�î ý�û�رª ,ü¨Àì ÀÞ½õ (5.1376 ,��¢�� ø �õ�÷Â� ö�õ¥�¨ ,×���õ¤�Ô÷�(ô�Àì� ´¨¢ ¤¢ ,Ó�ó��) �ûݵþ¤�Úó� Û�ܽ� ø ü��ÂÏ ,ü¨Àì ÀÞ½õ (614

Page 15: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

ýÂµî¢ ö�þ��Ç÷�¢ 7ý��÷øÃê� ý¢Àä ý�ûô�Ñ÷ ý¥�¨ù¢��� ø ü��ÂÏ ý�û���¤�� :�ó�¨¤ á�®�õ ,1376 Ã�þ�� :áøª ,¤��ýÂ��� ݨ�ì (1¤¢ .1383 ý¢ ,üó�ä ý��¤¢ �� á�ê¢ (�¤��¤�� �µ÷�¨ ,��÷ÂÔ�ó�î ù�ÚÈ÷�¢ ,üõ�ûÂ� ¥øÂú� Âµî¢ :¤ø�Èõ ¢�µ¨�) ,�µê�þ Ý�Þã�üµÈú� À�úª ù�ÚÈ÷�¢ Â���³õ�î ø ëÂ� ü¨À�úõ ýùÀØÈ÷�¢ ¤��È÷�¢ :®�� ñ��,üó�ä ý��¤¢ �� á�ê¢ ,Àþ¢ ´�Ü��ì ¢��ì �� ´îÂ� ýÃþ¤�õ�÷Â� :�ó�¨¤ á�®�õ ,1376 Ã�þ�� :áøª ,ýøÂÆ¡ ß�µõ�¤ (2ö�Âú� ù�ÚÈ÷�¢ ,ü�ê ýùÀØÈ÷�¢ ,Â���³õ�î ø ëÂ� ü¨À�úõ ýùÀØÈ÷�¢ ¤�þ¢�µ¨� :®�� ñ�� ¤¢ .1384 ¤£��� á�ê¢ ,4PM ñÀõ ¤¢ �û�ÈÖ÷ ý�þ�� ý¤�Áð°Æ�Â� :�ó�¨¤ á�®�õ ,1377 ö�µÆõ¥ :áøª ,ý¢���ݵ¨¤ ¢�ªÂê (3�ØþÂõ� ¤¢ ¤�î :®�� ñ�� ¤¢ .1385 üó�ä ý��¤¢:á�ê¢ ,Óܵ¿õ ý�ûÍ�½õ ¤¢ Àþ¢ ´�Ü��ì ý�¤�î ý�±¨�½õ :�ó�¨¤ á�®�õ ,1381 ö�µÆõ¥ :áøª ,üä¤�¥ �®¤üÜä (4Óþª üµã�¬ �ØÈ÷�¢ ü®�þ¤ ô�Üä ýùÀØÈ÷�¢ ¤�þ¢�µ¨� :®�� ñ�� ¤¢ .üó�ä ý��¤¢ �� 1387 ö���ßÞú� :á�ê¢ ,üä�Þµ�� ý�û¤�¥�� ¤¢ ùÀ�ªøÂê ¢�¨ ý¥�¨���È�� :�ó�¨¤ á�®�õ ,1385 Ã�þ�� :áøª ,ü��úõ À�Þ� (5.À�ÜþÂõ ù�ÚÈ÷�¢ Â���³õ�î ô�Üä ýùÀØÈ÷�¢ ¤¢ ýÂµî¢ �Æ� ®�� ñ�� ¤¢ .üó�ä ý��¤¢ �� 1389�� 1391 ý¢ á�ê¢ Àþ¢ ´�Ü��ì ý�±¨�½õ ¤¢ �÷ ü¹þ�µ÷ :�ó�¨¤ á�®�õ ,1384 ö�µÆõ¥ :áøª ,üÚþ�� ý¤�÷ üÔÎÊõ (6.ÀúÈõ ü¨ø¢Âê ù�ÚÈ÷�¢ ,Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ¤�þ¢�µ¨� ®�� ñ�� ¤¢ .��¡ ¤��Æ� ý��¤¢ñ�� ¤¢ ,1392 À�Ô¨� á�ê¢ ü¨À�û ý¥�¨ù¢�¨ ý�ûݵþ¤�Úó� :�ó�¨¤ á�®�õ ,1385 Ã�þ�� ý¢ø¤ø ,ùøÄ�Ç÷�¢ ßþøª (7.�¢�÷�î öµ¨ø ù�ÚÈ÷�¢ ,Â���³õ�î ø ëÂ� ü¨À�úõ ýùÀØÈ÷�¢ ¤¢ ýÂµî¢ �Æ� ®��ý�ûüãÜ®À�� ¤¢ Í¡ù¤�� Ó�ã® Àþ¢ ´�Ü��ì ý�±¨�½õ :�ó�¨¤ á�®�õ ,1386 Ã�þ�� :áøª ,üÚþ��ý¤�÷ ü±µ¹õ (8.�ØþÂõ� ¤¢ ýÂµî¢ �Æ� ýù¤ø¢ öÀ÷�¤Áð ñ�� ¤¢ .��¡ ¤��Æ� ý��¤¢ �� 1394 ¢�¢Â¡ ¤¢ á�ê¢ ,¤�¢ �¤�¨ý�ûÍ�½õ ¤¢ Ó�ã® ý�ûÂÚÆ� �� ���ø¤ ´îÂ� ýÃþ¤�õ�÷Â� :�ó�¨¤ á�®�õ ,1389 Âúõ :áøª ,üþ�±Ï�±Ï ù¢�¥� (9.95 Âúõ á�ê¢ �µ¡��ª�÷.95 Âúõ á�ê¢ ,ÂþÁ� Àþ¢ ý�û����÷ ©¤�Þª ø ýÂþÁ�Àþ¢ :�ó�¨¤ á�®�õ ,1390 Âúõ :áøª ,¤�³�Üä ù¤�ª (10ö�Ãçó ý�ûùÀ�µ¨Âê-k �� Àõ�ãµõ Â�û ý�ûù¥�õ Ǫ�� :�ó�¨¤ á�®�õ ,1391 ßÞú� :áøª ,ýøÀúõ ��¢�¨�Þܨ (11.1392 Âúõ :áøª ,ß�ÖþÀ¬ ¢�ãÆõ (12.1394 Âúõ áøª ,üþ�õ�ì� ùÀ�³¨ (13.1394 Âúõ áøª ,¢�Ä÷ÂÔ¬ ýÀúõ (14¤�Ãê�ôÂ÷ À�ó�� 8ßþ� ñ�ʽõ (1371-1373) .Óþª üµã�¬ ù�ÚÈ÷�¢ ,TEX §�¨� Â� ß���-ü¨¤�ê ü��»êøÂ� ݵÆ�¨ ×þ :×�cü ¤̈� ꤢ "¥��ßµõ' ¤�Ãê�ôÂ÷ ý�µÆ� ß�óø� ö���ä �þ Óþª üµã�¬ ù�ÚÈ÷�¢ ø üó�ä ©¥�õ� ø Ù�ûÂê �¤�¥ø ´þ�Þ� �� ÇûøÄ�.´¨� ùÀª ù¢�Ôµ¨� ö�Âþ� ¥� �¤�¡ ø Û¡�¢ ¤¢ üã�¨ø ¤�Ï �� ø ´¨� �µêÂð ¤�Âì ô�Þä ¤��µ¡� ¤¢ ö�Úþ�¤ �¤�¬ �� ¤�Èîö�Âúõ ,ü�ƽó���� ßÆ� :´ê�þ ©ÂµÆð ý¤��Æ� ¢�Âê� ͨ�� ų¨ ø Àª ¢�¹þ� Âþ¥ ö�þ��Ç÷�¢ ×Þî �� ¤�Ãê�ôÂ÷ ßþ�.ü��¹÷ ���ª ø ù¢�¥´��� ¢�¢Âúõ ,¤¢�÷¤�� ��¥ø¤ ,üìª15

Page 16: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

�ûÕþ�È� ø �ûÂþÀÖ� 9ö�Úµ¡�õ�Ç÷�¢ ßÞ¹÷� ý�¨ ¥� Dr Amin’s Life-Time Achievement Award ýùÃþ�� ø �õ�÷ÂþÀÖ� ´ê�þ¤¢ •.2016 ´¨�ð� ,ßµÚ�ª�ø ¤¢ ���¨ ßÞ¹÷� üþ�Þû¢Âð ,(SUTA) Óþªñ�¨ 15 ÂÏ�¡�� ô�ü¨ý� üþ��Ç÷�¢ üÆþ�÷�õ�÷Â� ü÷�ú� ��Ö��Æõ ý¤�ÃðÂ� ö��Æõ ý�¨ ¥� ÂþÀÖ� ��ó ý�Àû� •.À�Üþ�� ,1395 ¤�ú� ,ö�Âú� ý��ÖÎ�õ ý�Öþ�Æõ ý¤�ÃðÂ�ýù¥�� ¤�ðÀ÷�õ ýùÂú� ö���ä �� ù�ÚÈ÷�¢ ö� Â���³õ�î ô�Üä ýùÀØÈ÷�¢ ø Â�±îÂ�õ� üµã�¬ ù�ÚÈ÷�¢ ý�¨ ¥� ÂþÀÖ� •.1393 ö�µÆõ¥ ,�ûݵþ¤�Úó�"�ûݵþ¤�Úó� ü÷�±õ ø �û¤�µ¡�¨ù¢�¢' ��µî Ó�ó�b� ý�Â� üõ�¨� ¢�ª¤� ø Ù�ûÂê �¤�¥ø ��µî ý�÷�¡ ý�¨ ¥� ÂþÀÖ� •.Àª ùÀþÃðÂ� 1389 ,üª¥�õ� ñ�¨ ��µî ø 1388 ¤£� ,Àª ��¿µ÷� (ÂþÀÖ� ý�µÆþ�ª) ÛÊê ��µî ö���ä�� �îüÜ�ʽ� ñ�¨ ¤¢ Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ üª¥�õ� ý�÷�Þ÷ ¢�µ¨� ö���ä �� Óþª üµã�¬ ù�ÚÈ÷�¢ ý�¨ ¥� ÂþÀÖ� •1385-86�� ��õÀ¡ ÂÏ�¡�� ,"��ä�Ï� ý¤ø��ê üÜõ ´ÆÈ÷' ß�óø� ¤¢ üÞ��¡ ÀÞ½õ ´ìø ¤�úÞ� Å�þ¤ ý�¨ ¥� ÂþÀÖ� •1384 ¢�¢Âõ ,¤�Èî ��ä�Ï� ý¤ø��ê ý�ãõ��üµã�¬ ù�ÚÈ÷�¢ Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ý�÷�Þ÷ ÂÚÈûøÄ� ö���ä �� Óþª üµã�¬ ù�ÚÈ÷�¢ ý�¨ ¥� ÂþÀÖ� •1380 üÜ�ʽ� ñ�¨ ¤¢ Óþªüµã�¬ ù�ÚÈ÷�¢ Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ý�÷�Þ÷ ¢�µ¨� ö���ä �� üó�ä ©¥�õ� ø Ù�ûÂê �¤�¥ø ý�¨ ¥� ÂþÀÖ� •71-72 üÜ�ʽ� ý�ûñ�¨ ¤¢ Óþªüµã�¬ ù�ÚÈ÷�¢ Â���³õ�î ü¨À�úõ ýùÀØÈ÷�¢ ý�÷�Þ÷ ¢�µ¨� ö���ä �� üó�ä ©¥�õ� ø Ù�ûÂê �¤�¥ø ý�¨ ¥� ÂþÀÖ� •68-69 üÜ�ʽ� ý�ûñ�¨ ¤¢ Óþªü÷�ú� ¢��³Þó� ¤¢ ö�Âþ� Â���³õ�î ¢��³Þó� Ý�� üµ¨Â�¨ ø©¥�õ� ,´þ�Àû ý�Â� ¢Àãµõ ý�û�õ�÷ÂþÀÖ� ø �ûùÃþ�� ´ê�þ¤¢ •üÞ�� ý�±�¤ ßþµú� ø ù¢Âî °Æî ý¢�þ¥ ý�ûñ�Àõ ñ�¨ 18 ßþ� ¤¢ ö�Âþ� ý�ûÝ�� .1389 �� 1371 ñ�¨ ¥� ×���õ¤�Ô÷�.0À÷¢¤ø� ´¨¢�� ö�ú� ý�û¤�Èî ß�� 1372 ñ�¨ ¤¢ �¤ ô¤�ú�Àª¤�ü¨��ª¤�î ý�û�ó�¨¤ üµ¨Â�¨.1370 Âúõ ,ùÀª âþ¥�� ü��ä�Ï� ý�û×÷�� ´þÂþÀõ ݵÆ�¨ ×þ ý¥�¨ù¢��� ø ü��ÂÏ ,¤�� ßõ�õ ©ø¨ (1ý¢ ,ý¤�� ø üΡ ý�þ�¤� ý�û¤�µ¡�¨ ýø¤ Â� ×�ó�µÆ�¨ ý�ûݵþ¤�Úó� ý�Â�� ý¥�¨ ��±ª ,ßþ�÷ ù¢�¥ÀÞ½õ ¢�¢Âúõ (2.1370.1371 ßÞú� ,TEX �� ü¨¤�ê ö�µõ ü���éøÂ� ,ü�ƽó���� ßÆ� (3.1371 ßÞú� ,ü¨¤�ê ý�ûÝÜì üÞÜä ü��ÂÏ ,üìª ö�Âúõ (4.1372 À�Ô¨� ,X-Window ´½� ø �÷�øÂ� ¤�µ¡�¨ ýø¤ Â� ×�ó�µÆ�¨ ý�ûݵþ¤�Úó� ý�Â�� ý¥�¨ ��±ª ,ù¤�þüÖ� �÷�µê (5.1373 ý¢ ,ýµ� ý�û�رª ý¥�¨ ��±ª ø üØ�ê�Âð Çþ�Þ÷ ,ü÷�û�Âê ü��Âúª �®¤üÜä (6.1374 ¢�¢Âõ ,TEX �� ü��¤��½Ô¬ À�� ,ü��ØÜõ �Þ�úê (716

Page 17: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

.1375 ¤�þÂúª ,ü¨¤�ê ý�ûÝÜì ×þµõ�¤�� ø ¤�î¢�¡ ü��ÂÏ ,üÔ¨�þ À�ÈÞ� (8.1377 Âúõ ,ùÀª ýÀ�þ¶Ü·õ ÝÑ�õ�÷ ý�û�رª ýø¤ Â� ý��÷�¡¢ø¤ ý�رª À�ó�� ,ù¢�¥×Üõ �®¤üÜä (9.1377 Âúõ ,ùÀª ýÀ�þ¶Ü·õ ÝÑ�õ�÷ ý�û�رª ýc ¥��õ ýc ¥�¨ù¢�¨ ¤¢ ¤�� ö¥��� ,ý¢���ݵ¨¤ ¢�ªÂê (10.1377 ¤�þÂúª ,ü��±¨�½õ ý�¨À�û ¤¢ ý¥��õ ©¥�¢Â� ý�Â� ý��÷�¡��µî ,ù¢�¥Óþª ýÀúõ (11.1378 ö��� ,ü�¤�¡ ý�Ñê�� �� ü��±¨�½õ ý�¨À�û ý�ÜÿÆõ À�� ,ü��Æ� §�±äÀ�¨ (12.1378 Âúõ ,ýÀã��¨ ��Ψ ý¥��õ ý¥�¨ù¢�¨ ø ýÀ���رª ,ÂêüõÂî� üÜäÀ�¨ (13.1378 Âúõ ,�ûö� ý¥��õ ý�Â�� ý�Â� ��ø§Â� ý�û¤�µ¨¢ ý¥�¨���ú� ,ü��õÂ� ©¤� (14.1378 Âúõ ,üÈõ¢ ýùÀ��î¢Â¨ �� �ûß��¤�� ý�ç�� ýø¤ ö�þÂ� ýc ¥�¨��±ª ýc ¥��õ ©¥�¢Â� ,ôÀÖõü÷�ÀÜð ßÆ� (15.1379 Âúõ ,ùÀªýÀ��¶Ü·õ ��Ψ ýø¤ Â� �ûÂ�Æõ ßþÂ�ù���î ,ù¢�¥ü��® À�Þ� (161380 ¤£� ,ý��ÎÖ÷ Â�è ý�û���ø¤ ý�Â� ´îÂ� ýÃþ¤�õ�÷Â� ,ô��� üÜäÀÞ½õ (17.1380 ¤£� ,�û�þ�ÆÞû ßþÂ�×þ¢Ã÷ ý�ÜÿÆõ ý�Â� ü±þÂÖ� ݵþ¤�Úó� ,ý¢ÂØû¢ ý¤¢�ì À�¹õ (18.ô�Àì� ´¨¢ ¤¢ ,ýÀ÷��� �ܬ�ê ßþÂ�ù���î ý�ÜÿÆõ ý�Â� Àþ¢ ´�Ü��ì ,ýÀþ�b õ á¤�¥ ¢�Ãú� (19.1380 ¤�þÂúª ,"�ø' ��½Ô¬ ø í¤�Àõ ýÀ���±�¤ ,ýÂî�ª ù¢�¥� (20.1380 ¤�þÂúª ,"�ø' ¤¢ ´û�±ª Â� ü�µ±õ ý��ø´Æ� ,üû�î ¥�Þó�¨ (21.1381 ö��� ,â÷�õ �� üãÜ®À�� ¤¢ ���ø¤ Í¡Â� ´îÂ� ,�Â�� ..�ß�ä (22,ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ýø¤ Â� ö�÷�±úÚ÷ ý�ä�Þ¹õ ßþÂ�×��î ý�Â� ü±þÂÖ� ݵþ¤�Úó� ,üä¤�¥ �®¤üÜä (23,1381 ßÞú�,1382 ßÞú� ,ýÀ���±�¤ ý¥�¨ý¥��õ ¤�Ñ�õ�� �ø ��ä�Ï� ý¥�¨ùÂ�¡£ ,ýÀ��ø üÔÎÊõ (24.1382 ¤£� ,ü�¤�¡ ý¥��õ ©¥�¢Â� ,¬�ãõ ü¬��ì ¢�ãÆõ (25.1383 ý¢ ,�ø ý�ûé�Âð ü÷�ª��Ýû ,ù¢�¥üÞã�õ üÌ�Âõ (26.1383 ý¢ ,ï¤Ã� é�Âð ý�ûüðÄþø ö¢Âî�À�� ý�Â� ý¤�±þ�� ý�ûݵþ¤�Úó� ,ýÂû�� ß�Æ� (27.1384 Â�� ,���ú� Ç¡Â� ¤��ãõ �� �ÎÖ÷ ×þ Àþ¢ ´�Ü��ì �� Â�Æõ ßþÂ�ù���î ,ü��® �®¤ÀÞ½õ (28.1384 ¤£� P2P ý�û�رª ¤¢ ö¤�Öµõ ýù¢�¢ ¤�ÂØ� ý�û¤�µ¡�¨ ¤¢ �ûù¢�¢ ´ì¢ üÖ�±Î� Ý�Ñ�� ,¤��õ�î ßƽõ (29.1384 ¤�þÂúª , P2P ý�û�رª ¤¢ ¤�� ö¥��� ,ü÷��ý¤��¨ �Ü��¤ (30.1384 ö��� ,P2P ý�û�رª ¤¢ aggregate ���¬�Ê¡ ý�±¨�½õ ,Âúõ ü÷�Þþ� �Âû¥ (311384 ¤£� ,,�ø ¤¢ ��ä�Þµ�� üþ�¨��ª ,ùøÄ�Ç÷�¢ ßþøª (321384 ¤£� ü��±¨�½õ ý�¨À�û Û��Æõ ¤¢ üȱ�� ý�û¤�µ¡�¨ù¢�¢ ,ý¢ÂØû¢ ýøÂÆ¡ üÜäÂ�õ� (331384 ¢�¢Âõ áøª ,P2P ø Ý�¨ü� ÂðÅ� ý�û�رª ¤¢ ù¢�¢ ý¤ø�âÞ� ý�Â� üþ�ûݵþ¤�Úó� ,ü��úõ À�Þ� (34×þ ¥� Ç�� ´¨��¡¤¢ ö�Øõ� ø ¢øÀ½õ ý��î ¢�Àã� �� ´Ö�Ö� Â� ü�µ±õ Í¡Â� ýùÀþ�Ãõ ý�ûݵÆ�¨ ,Âúõ��÷ Â��û (351385 Âúõ ,��îßÞú� ,¼ÎÆõ ý�ûé�Â𠤢 ö�±úÚ÷ ßþÂ�×��î ý�ä�Þ¹õ ßµê�þ ý�Â� ý¥��õ ݵþ¤�Úó� ,ö�ÂÞä ¢�Ä÷üÖ� ¢�ãÆõ (361385ßÞú� ,ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ¤¢ ö�±úÚ÷ ßþÂ�×��î ý�ä�Þ¹õ ßµê�þ ý�Â� ý¥��õ ݵþ¤�Úó� ,¥�±úª ùø�î (37138517

Page 18: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

1385 ßÞú� ,P2P ý�û�رª üþ�¤�î ü��þ¥¤� ø ý¥�¨ù¢��� ¤¢ ü����¹� ,ö�þ³û�ª ¢��� (381385 ßÞú� ,üû�ÚÈþ�õ¥� ý�÷�Þ÷ ý¥�¨ù¢��� ø P2P ý�û�رª Óܵ¿õ ý�ûýÀ��Ýû ü¨¤Â� ,üþ�®¤Â�õ ö�Þþ� À�¨ (391385 ßÞú� ,(TIN) ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ý�û�رª ¤¢ Àþ¢ ý�±¨�½õ ,üܨ�� Ý·�õ (40¤�þÂúª ,Óþª ý¥��õ ý��ø´Æ� ¤���õ ¤¢ �ø��½Ô¬ öÿõ ü÷�¨¤ ¥ø¤�� ø ýÀ��ö�õ¥�¨ ,ü�¤�¥ üÔþª üÜä (4113851385 ¤�þÂúª áøª ö� ý¥�¨��±ª ø ß�ÿ�øÂ� ý�þÂÑ÷ Â� üþ�Ö�¤� ,ü��Âä� À�ÞèøÂê ý¢�û ÀÞ½õ (421385 ¤�þÂúª áøª ,ýÀã� 3 ý�Ìê ¤¢ ý¤�ÀþÀ� ý�¤�î ý�±¨�½õ ,üÚþ�� ý¤�÷ ü±µ¹õ (431386 ý¢ :á�ê¢ ,1385 ¤�þÂúª áøª ,¤�¢ö¥ø ü���÷ ¤¢ ¤¢ üãÜ®À�� ý�ó�±÷¢ ��ì�õ ,üµþ�Àû Â�õ� (441385 ¤�þÂúª áøª ,�ø Â� ü�µ±õ ý�ûÅþø¨ °�îÂ� ¤¢ Åþø¨ ü�þÃðý�� ü÷�±�µÈ� ,´¨ø¢ö�¢Ãþ ÝþÂõ (451385 ¤�þÂúª áøª ,°îÂõ ý�ûÅþø¨ ¤¢ �ûÇ�î�Â� ü÷�±�µÈ�©øÂê´�� �ÞÏ�ê (461386 ßÞú� á�ê¢ ,1385 ý¢ áøª ,ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ¤¢ À�¢ Û��ì ÕÏ��õ Çþ�Þ÷ ,¥��Ç�� ýÀúõ (471385 ¤�þÂúª áøª ,�ø ü÷�Âì ý��ø´Æ� ¤���õ ×þ ý¥�¨ù¢��� ¤¢ üÞÜä ¶��±õ ,ýÂ�Ê÷ ýÀÞ½õ ü±µ¹õ (481386 ßÞú� :á�ê¢ ,1385 ¤�þÂúª áøª ,�ø ��½Ô¬ ý¥��õ ý�÷�¢´ª¤¢ ýÀ���±�¤ ,ýøÀúõ ¢�¢Âúõ (491387 ¤�þÂúª , ý¥�¹õ ý�û�÷�¡À¬¤ ü��±¨�½õ ý�û�±�� ,Â�ÚÞó�ä üÌ�Âõ (501387 Âúõ ,�ûý¥�� ý�þÂÑ÷ Â� ü�µ±õ ü±�îÂ� Í¡Â� ýùÀþ�Ãõ ,üõÂú� ù���Õ� �Þ�÷ (51Âúõ :á�ê¢ ,1386 ¤�þÂúª áøª , Ad Hoc ý�û�رª ¤¢ ¤�� Ý�ÆÖ� ý��±õ Â� ü��þÂ�Æõ ý�ûݵþ¤�Úó� ,Âð¤�î ýÀúõ (5213871387 ¢�¢Âõ :á�ê¢ ,1386 ¤�þÂúª :áøª �û�رª ýø¤ ý¥�� �� üÞµþ¤�Úó� ¢Âîýø¤ ,ý¢�Âõ�À¡ ¤��õ�î (53�� ø ý�ù¥�� ý��ø´Æ� ´�Ü��ì �� Â�Ñ÷��Â�Ñ÷ ý�رª ×þ ý¥�¨ù¢��� ¥� ü�¹� ýù¢�¢ Û�ܽ� ,ý�Ö� ß�ãõ ÝþÂõ (54(Ç�î ý�±ãª) 1387 Â�� áøª ,ýÀã�À�� ýù¢�¢:á�ê¢ ,1387 Â�� áøª ,â÷�õ �� üãÜ®À�� ×þ ¤¢ üΡù¤�� ÂÒ�÷ ×þ Àþ¢ Û��ì ýù¢øÀ½õ ý¤�¢�Ú÷ ,ý±î� ýÀû (551388 ¤�þÂúª1387 Â�� áøª , ý¤�±þ�� ñÀõ ¤¢ ü¨À�û °þÂÖ� ý�Â� üþ�ûݵþ¤�Úó� ,ü÷�À¹÷� ý¤�Ôè ß�Æ� ÀÞ½õ (561388 ßÞú� :á�ê¢ ,1387 Â�� áøª ,�ûß��øÂ� ý�Â� ý��رª ý�ûñÀõ ¤¢ ݵþ¤�Úó� ý�þ�¤� ø Û�ܽ� ,üó��Â�õ ö��î (571388 ¤�þÂúª :á�ê¢ ,1387 Â�� áøª , �ûý¥�� ý�þÂÑ÷ Â� ü�µ±õ üä�Þµ�� ý�û�رª ¤¢ ¤�ȵ÷� Û�ܽ� ,¤�¿µê� �Þ�÷ (581388 À�Ô¨� :á�ê¢ ,1387 Â�� :áøª , í½µõ ¯�Ö÷ ýÂ�ðù¤ ý�Â� üþ�ûݵþ¤�Úó� ,ý¤�Ê�õ À�Þ� (591387 Â�� áøª ,ö� ýø¤ Â� �ó�Æõ À�� Û� ø ¤�¢ö¥ø ý�ûß�� ý¥�¨ù¢�¨ ,üè��¢ �Þ�úê (60,üÜî�� ô��ú� (61ü÷�À�ì üÜî�� ÀÞ½õ (62ü��øÂ� ¢�Ä÷ÂÔ¬ ýÀúõ (63Âúõ ö�Âúõ (64�½ó�¬ ÀÞ½õ (651391 ¤�þÂúª ,ý���þ� á�®� ¥� ù¢�Ôµ¨� �� Àþ¢ ´�Ü��ì ý�ûüãÜ®À�� ©ÂµÆð ,üÑä�ø ©¤� (661392 ¤�þÂúª ,Â�Æõ ý¢¤�¡¥�� ýÃþ¤�õ�÷Â� ¤¢ üªÂµÆð ,üÞª�û ¤�Ú÷ (6718

Page 19: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

1392 ¤�þÂúª ,Õ�ì¢�÷ ý�ûù¢�¢ �� ü��±¨�½õ ý�¨À�û ý�û�ÜÿÆõ ¥� ü¡Â� ý�Â� ü±þÂÖ� ý�ûݵþ¤�Úó� ,¤���Þû À�Þ� (681392 ¤�þÂúª ,üÜî ý�ûüãÜ®À�� ¤¢ �ÎÖ÷ ×þ öÀþ¢ ý�Â� Â�Æõ ßþÂ�ù���î ,ü¹÷¤�÷ üÜä (691392 ¤�þÂúª ,üä�Þµ�� ý�رª ¤¢ ü��þ¤�¥�� ý�ûýÄ��µ¨� ,ß�ÖþÀ¬ ¢�ãÆõ (701393 ý¢ ,Ó�ã® ý�ûÂÚÆ� �� Ãú¹õ ���ø¤ �� �µ¡��ª�÷ üãÜ®À�� ×þ ý�µÆû ßµê�þ ,ö����Âû À�㨠(71ü¨��ª¤�î ý�ûù¦øÂ� üµ¨Â�¨.1370 ,ö��¨¢Â¡ ý�Â� ßµõ ÂÚÈþ�Âþø ×þ ,Âð��Þ�î §øÂ�¨ (1.1370 ,"ü¨' �� ñ�ب�� ý�û�õ�÷Â� ¤�î¢�¡ ÛþÀ±� ,üþ�Âì ö¢� (2.1370 ,�ûßµõ ý¥�¨ù¢ÂÈê ,ü��ØÜõ �Þ�úê (3.1371 ,ü¨¤�ê ý�ûÝÜì ü��ÂÏ ,üúó�Õ� ÂÔã�ÀÞ½õ (4.1372 ,ùÀ��î°�Âõ ý�û�رª ý¥�¨��±ª ,ü÷�ä£� �ÞÏ�ê (5.1372 ,ü¨¤�ê Í�½õ ¤¢ ´³þÂب�´Æ� ,¤�î��¹� �ó� (6.1372 ,×�ê�Â� ý�ûÝÜì ü��ÂÏ ,ýÂç¬� �÷�øÂ� (7.1372 ,ßµõ ÂÚÈþ�Âþø ý�Â� ü¨¤�ê ý�ûÝÜì ü��ÂÏ ,üÞ¨�ì �ÞÏ�ê (8.1372 ,üµÈð¥�� ý�ûݵþ¤�Úó� ©¥�õ� ,ù¢�¥�ª�� À�㨠(9.1372 ,�ÜÿÆõ Û� �� é�Âð ý¤�ÿ� ©¥�õ� ,¤�¢ÂÞ� ô�Âúª (10.1372 ,ü¨¤�ê Ýþ�Ö� ü���éøÂ� ,Âþ�Èä �ó�Ãè (11.1372 ,Â���³õ�î ý�Ü�¨ø�� é�Âð ý¤�ÿ� ©¥�õ� ,ý¤�Ê�õ ��ú¨ (12.1373 ,ùÀªâþ¥�� ©¥�¢Â� ¤¢ ü����¹� ,ü±�±� ÀÞ½õüÜä (13.1373 ,Õ�ÜãµÆ÷ ý�ûÝÜì ü��ÂÏ ¤¢ ü����¹� ,��÷¢�ãÆõ �¨��� (14.1373 ,é�Âð ý¤�ÿ� ©¥�õ� ,ý¤�Ê�õ ��ú¨ (15.1373 ,üµÈð¥�� ý�ûݵþ¤�Úó� ©¥�õ� ,ù¢�¥¤�ª�� À�㨠(16.1373 ,ü¨¤�ê ��÷�ä� ݵÆ�¨ ×þ ,ý�Üä ýÀúõ (17.1373 ,xterm ý�÷��¥ ø¢ ý¥�¨��±ª ,Ç�õ üþ�ÂÌ¡ ¬�÷ (18.1373 ,X-Windows ¤¢ ���� ý�Ôó�õ Â� ü�µ±õ ý�û¢Â�¤�î ý¥�¨ü¨¤�ê ,��÷�®¤ ©�÷��î (19.1373 ,X-Windows ¤¢ ���� ý�Ôó�õ Â� ü�µ±õ ý�û¢Â�¤�î ý¥�¨ü¨¤�ê ,ýÂ��¬ ¥Âõ�Âê (20.1374 ,�ÜÿÆõ Û� �� é�Âð ý¤�ÿ� ©¥�õ� ,¤�¢ÂÞ� ô�Âúª (21.1374 ,ü¨¤�ê ô�ì¤� É�¿È� ¤¢ ý¥��õ ©¥�¢Â� ,ù¢�¥Óþª ýÀúõ (22.1374 ,ü¨¤�ê üØ�÷øµØó� ��÷�ä� ý�Ü��� ݵÆ�¨ ,ý�Üä ýÀúõ (23.1375 ,âÏ�Öµõ ��ÞÜî ñøÀ� ¤�î¢�¡ ü���éøÂ� ø ü��ÂÏ ,üÞ¹ä �¬¤ÀÞ½õ (24.1375 ,ü¨¤�ê ý�ûÝÜì ¤�î¢�¡ ü��ÂÏ ,ö�ð¤¥�� ©¤��î (2519

Page 20: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

.1376 ,ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ¤¢ Â�Æõ ßþÂ�ù���î ,ö�þÀúõ ÀÞ½õ (26.1377 ,Java �� �û�رª üþ�¤�î ü��þ¥¤� ,üû�î öøÀþÂê À��ø (27.1377 ,ö�ó¢ ýÀ���¶Ü·õ ý¥�¨ý¥��õ ,¤��ü���ܬ �®¤ÀÞ½õ (28.1377 ,Java �� ùÀ�³� ý�ûݵþ¤�Úó� üØ�ê�Âð Çþ�Þ÷ ,üÞµ¨¤ ý¢�ª (29.1378 ,ÝÞ���õ ýù¥�À÷� ¥� üó�þ À�±Þû-X é�ÂðÂþ¥ ,¢�¥Âê ×��� (30.1378 ,ùÀª ýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ýø¤ Â� Â�Æõ ßþÂ�ù���î ý�Â� ü±þÂÖ� ©ø¤ ,ü÷�ðø�ð üÜã¹�ð ¤�ª�þ (31.1378 ,ö�ó¢ ýÀ��¶Ü·õ ý�¤�î ý¥�¨ ý¥��õ ,ýø�Æþ¤¢ Ýó�¨ (32.1378 ,��¤¢ �� ¢øÀ½õ ý�û´¡¤¢ ý�ÜÿÆõ ý�Â� ü±þÂÖ� ý�ûݵþ¤�Úó� ,ý¤À¬ �þ¢Â� (33.1378 ,ÝþÂî ö�Âì ¤�î¢�¡ ý¤�Áð��Âä�c ,ù¢�¥ü��® À�Þ� (34.1378 ßÞú� ,ý��÷�¡¢ø¤ ý�û�رª À�ó�� ý¥�¨ý¥��õ ,ô��� üÜäÀÞ½õ (35.1378 ,ùÀªâþ¥�� ¤�µ¡�¨ù¢�¢ ,ö�¥Âê ù¢�¥� (36.1379 ,�û�رª ¤¢ ü�î�Â�ù¢�¢ Û��Æõ ¥� ü¡Â� üðÀ�»�� ,üþ�ì�ü��� üÖ�ÀÞ½õ (37.1379 ,ü±þÂÖ� ý�ûݵþ¤�Úó� ü��ÂÏ ¤¢ üΡ ýÃþ¤�õ�÷Â� ¥� ù¢�Ôµ¨� ,ýÂ��¬ ß�õ� (38.1379 ,���Þî ü¨�b¤ À�±Þû-k Â�ð�Âê é�ÂðÂþ¥ ß��ã� ,ýÀúÈõ�ÂÆõ ß�Æ� (391379 ý¢ ,ü�µõÂ�� ý�½Ô¬ �� ×�cü ¤̈�ê ñÀ±õ ,üþ�î�� ÀÞ½õ (401379 ý¢ ,ùÀªýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ¤¢ Àþ¢ ý�ÜÿÆõ ,üÞµ¨¤ ´�±� (411379 ßÞú� ,ýÀã�ø¢ ý�Ìê ¤¢ í½µõ éÀû ßµª�¢ù�Ú÷ Àþ¢ ¤¢ ý�Â� üÞµþ¤�Úó� ,üþ��� ÀÞ½õÂ�õ� (421380 Â�� ,�û�õ�÷Â� ¤�î¢�¡ ý¥�¨ý¥��õ ,ýÂþÀÖ� �÷�õ (431380Â�� ,ùÀªýÀ��¶Ü·õ ÝÑ�õ�÷ ��Ψ ¤¢ ö�±úÚ÷ ý�ä�Þ¹õ ßþÂ�×��î ,¢�Ä÷ýÂì�� Â��¬ (441380 ¢�¢Âõ ,×�cü ¤̈�ê ý�Â� ü�µõ ��þÍÜè ×þ ,¢�Ä÷üµª¢ ö�¨�¨ (451381 ßþ¢¤øÂê ,ô�ÚÞû�÷ üÏ�±�¤� ¯�Ρ ¤¢ ��ä�Ï� ñ�Öµ÷� ,ýÂ�õ� ö�Æ�� (461381 ¢�¢Âõ ,Û±�� À�õ¤�î ýÀ��ö�õ¥ ,ö�¥Âê ©¤� (471381 ¤£� ,§¤�Àõ ýÀ��ö�õ¥ ý�÷�õ�¨ ,üÞª�û üÔÎÊõ (481382 Â�� ,�û�ÈÖ÷ ¤¢ ¯�Ρ ¤�î¢�¡ ý¤�Áð°Æ�Â� ,ßþÀó�¤À¬ �®¤ (491382 ´Èú±þ¢¤� ,1-�ø ¤¢ (crawling) öÀþá ,ý¥Â�ª ü��� �÷��� (501382 ´Èú±þ¢¤� ,2-�ø ¤¢ (crawling) öÀþá ,ö��ØÜõ Ç¡¤£� (51ô�Àì� ´¨¢ ¤¢ ,ÀØ�÷�þ �� ×�cü ¤̈�ê ,¤¢�÷¤�� ��¥ø¤ (521382 ¤�þÂúª ,�ûß�� ýø¤ Â� ���ø¤ Í¡Â� ü��þÂ�Æõ ,��ðý¤¢ �®¤ (531382 ¤£� ,�ø ��½Ô¬ ýÀ���µ¨¢ ý¥�¨ý¥��õ ø Ý�¹� ý�ûùøÂðù¢�¢ �� ��±¨�½õ ,°Æ÷ü÷�õ¥ �®¤ (541383 ßþ¢¤øÂê ,�ø ¤¢ �ûôÂê ¤�î¢�¡ À�ó�� ,ýÀ��ø¥�� �÷�½þ¤ (551382 ¤£� ,�ø ��½Ô¬ ýÀ���µ¨¢ ,üµ¨Âê�÷ �Â�Þ¨ (561382 ¤£� ,ý¥��õ ý��ø´Æ� ý�û¤���õ ¤¢ ý¤�ÁðÉ¡�ª ,ù�Èè�� ü÷�Þ�ܨ �þÀúõ (571382 ¤£� ,â÷�õ �� ý�Ìê ¤¢ ý��Ü�õ ���ø¤ ´îÂ� ý¥�¨ù¢��� üþ��¤ ýÂúõ (5820

Page 21: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

1383 ¤�þÂúª ,üȱ�� ý�û¤�µ¡�¨ù¢�¢ ý¢��Âê ÝþÂõ (5983 ¤£� ,(1382 ßÞú� áøª) ,â÷�õ ¤�Ì� �� ý¤�Àð°Æ�Â� ý¥�¨ ¥ø¤�� ö��Ôþª �±þÂê (601383 ý¢ ,×�cü ¤̈�ê ü���éøÂ� ݵÆ�¨ ü�±�¥�� ,À±úÔ¨� ¢�Àú� (6183 ¤�þÂúª ,(1382 ßÞú� áøª) 1383 ¢�¢Âõ ,ý�ù¤��ê ý�ûÀî üõ�ʵä� À�õ� (6283 ö��� ,ý¤�±þ�� ý�ûݵþ¤�Úó� ü��úõ À�Þ� (63(1382 ßÞú� áøª) 1383 ¤�þÂúª ,(SDBMS) ý¤�±þ�� ýù¢�¢ ù�Úþ�� ´þÂþÀõ ݵÆ�¨ Âúõü÷�Â�ª ß��û (641384 Â�� ,(1) �ø ��½Ô¬ â±�õ ü÷�¨¤ ¥ø¤�� üó�Þî ��úª (651384 ´Èú±þ¢¤� ,(2) �ø ��½Ô¬ â±�õ ü÷�¨¤ ¥ø¤�� ù¢�¥ßÆ� ý�µî� (661384 Â�� ,P2P ý�û�رª ý�Â� ùÀªâþ¥�� ý�û¤�µ¡�¨ù¢�¢ ù¢�¥ÂÒ�÷ À�Þ� (671384 ¢�¢Â¡ ,«�¡ á�®�õ �� ý¥��õ ýùÀ÷á ×þ ý¥�¨ù¢��� ø ü��ÂÏ×��� ¥øÂ�� (681384 ¤�þÂúª ,¤�¥�� ñ¢�ã� ,¤��À¨� ©¤� (691384 ¢�¢Âõ ,�ûö� ��¿µ¨� ý�ûݵþ¤�Úó� ø �ø ��ä�Þµ�� ü¨¤Â� ,×ó�¨ ¤��úõ (701384 ¢�¢Âõ ,¤�½õ¢�¡ ü��þÂ�Æõ ,�ûüó�¨¤ ü��� ö�Þþ� (711384 ¤£� ,(1) �ø é�Âð ý¥�¨ù¢ÂÈê ö�þÀúõ �®¤üÜä (721384 ¤£� ,(2) �ø é�Âð ý¥�¨ù¢ÂÈê üÜ�Ü¡ À�Þ� (731384 ßÞú� ,:�ø ��½Ô¬ â±�õ ü÷�¨¤ ¥ø¤�� ,Ç¿�¤�÷ ö�Æ�� (741384 ¤£� ,�û�ÈÖ÷ ü÷�¨¤ ¥ø¤�� üÞ¨�ì ÝþÂõ (751384 ¤£� ,�þ�� ø ýÀã� �¨ ý�ûÍ�½õ ¤¢ Àþ¢ ý�Ìê ,üÚþ�� ý¤�÷ ü±µ¹õ (761384 ö�µÆ��� :áøª ýÀã�À�� ý�ù¥�� ý��ø´Æ� ý�Â� ùÀªâþ¥�� ¤�µ¡�¨ù¢�¢ ×þ ,üþ�ä À�㨠(771384 áøª ad-hoc Ý�¨ü� ý�û�رª ¤¢ �µ¨��� ý�÷�¨¤ ¤�ÂØ� ý�Â� üªø¤ ,ù¢�¥ý¤�÷ ¥øÂú� (781384 ßÞú� ,�½Ô¬ ¤¢ ¼ÎÆõ ý�ûé�Âð öÀ÷�È÷ ,ü�Ï�� ß�Æ� ÀÞ½õ (791384 ßÞú� ,�½Ô¬ ¤¢ ¼ÎÆõ ý�ûé�Âð öÀ÷�È÷ ,üõ½õ ÀÞ½õ (801385 Â�� ,×���õÂÔ÷���� ý�ûݵþ¤�Úó� ¢¤�õ ¤¢ üÈûøÄ� ,ü÷�È¡¤¢ ÀÞ½õ (811385 ¢�¢Âõ ,�ÎÖ÷ ×þ éÁ� ¥� Å� �û�ÎÖ÷ Í¡Â� ý¤�Áð°Æ�Â� ,üì¢�¬ ö�Þþ� (821385 ¢�¢Âõ ,Õ��õ�÷ üóø À�õô�Ñ÷ ö�Âð¤�î ͨ�� �ûí¢ ý¥��õ ýÀ��ö�õ¥§�±äß� ©ø��¨ (831385 ¢�¢Âõ ,ýÀã� ø¢ ý�Ìê ¤¢ Àþ¢ ´�Ü��ì ý�ÜÿÆõ ,¤��ë�¥¤ ���õ (841385 ßÞú� ,��ø´Æ� ¤���õ ý¥�¨ù¥�� ý�û´¨��¨ ü¨¤Â� ,ý�ùÀ�õ¤�Â�õ Ý�Æ÷ (851385 ¤�þÂúª ,ü±�îÂ� ý�ûùÀþ�Ãõ ü¨¤Â� ,��÷ü¨¤�ê Ý�Æ÷ (861385 ßÞú� ,ý¦Â÷� éÂÊõ Çû�î ý�Â� ¤�î ô�¹÷� ýÀ��ö�õ¥ ,ýÀ�¨ ß�õ� À�¨ (871385 ßÞú� ,ý¦Â÷� éÂÊõ Çû�î ý�Â� ¤�î ô�¹÷� ýÀ��ö�õ¥ ,ôÀÖõý¢�¥ üÌ�Âõ (881385 ßÞú� ,üû�ÚÈ÷�¢ ý��ø´Æ� ¤���õ ý�Â� ü¨¤�ê ÂÚªø�î ý¥�¨ù¢��� ,ý±î� ýÀû (891385 ßÞú� ,üõ�µ÷��î ��±¨�½õ ý�þÂÑ÷ ø �ûݵþ¤�Úó� ,¤��ÂÔã� ���¨ (901386 Ã�þ�� ,À�¢ Û��ì ü�½�õ ý¥�¨ù¢�¨ ý�ûݵþ¤�Úó� Û�ܽ� ø ý¥�¨ù¢��� ,ü��÷ Â��û (9121

Page 22: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

Â�� ,HP ñÀõ ¤¢ ý¦Â÷� ßþÂ�Ýî ´ó�� ¤¢ �ûß���øÂ� üðÀª�� ý��®Âê �� HMM ü÷��¡Ýû ü¨¤Â� ,ý¤�±� ùÂû¥ (9213861386 ý¢ ,üÜõ�Ø� ¤�µê¤ ý¥�¨��±ª �� Í¡Â� ý�ûü��Â� ü¨¤Â� ,¤�þÀ�Ô¨� �þ�� (931387 Â�� , ,ö�ÂÚþ�� ùÃÞ� Àõ�� (941387 Â�� , ,üþ�Àì� üÞÜä üÌ�Âõ (9587/6/13 ,ö�þÀÞ�� �¤�¨ (9687/6/13 ,ýÀ�㨠ß�ª�÷ (9787/6/13 ,ýÀÞ�� ���� (9887/5/5 ,üÜÌê ß�õ� ÀÞ½õ (9988 Âúõ áøª ¤�¢ö¥ø ¯�Ö÷ ý¤�Áð°Æ�Â� ,ü��Æ� ©ø¨ (10088 ý¢ :áøª ,Åþø¨ ýùÀ�û¢ Ûþ�½� ý�û���ø¤ ´îÂ� ý�ûݵþ¤�Úó� ,©�³î�¡ Â��¬ (101,´ì��ó À��ø (102Àþ¢ ´�Ü��ì ý¥�¨ù¢��� ,ù¢�¥×Üõ üÜä (103ùÀª ü��ÂÏ ý�ûù¤ø¢ ø �û§¤¢ 10(Àª¤� ü¨��ª¤�î) .1368-69 ôø¢ ñ�¨Ý�÷ ,ýÂ���³õ�î ý�ûݵÆ�¨ üþ�¤�î ü��þ¥¤� •(Àª¤� ü¨��ª¤�î) .1368-69 ôø¢ ñ�¨Ý�÷ , �û�رª ý�û¤�Ãê� ôÂ÷ •(Àª¤� ü¨��ª¤�î) .1369-70 ôø¢ ñ�¨Ý�÷ ,ý¥��õ ý�ûݵþ¤�Úó� Û�ܽ� ø ü��ÂÏ •(ü¨��ª¤�î) .1373-74 ñø� ñ�¨Ý�÷ ,�ÜÿÆõ Û� ¤¢ �µêÂÈ�� ¶��±õ •(ü¨��ª¤�î) .1372-73 ñø� ñ�¨Ý�÷ ,ö� ýù¢��÷�¡ ø TEX :¤�Ãê�ôÂ÷ ü¨À�úõ ¤¢ �µêÂÈ�� Ý�û�Ôõ •(Àª¤� ü¨��ª¤�î) .ö��î �� 1373-74 ôø¢ ñ�¨Ý�÷ ¥� ,ý¥��õ ©¥�¢Â� •(ü¨��ª¤�î) .1374-75 ôø¢ ñ�¨Ý�÷ ,1 Â���³õ�î ÝÜä ü÷�±õ •(ü¨��ª¤�î) .1379-80 ñø� ñ�¨Ý�÷ ,2 Â���³õ�î ÝÜä ü÷�±õ •(ü¨��ª¤�î) .ö��î �� 1381-82 ñø� ñ�¨Ý�÷ ¥� ,�ûݵþ¤�Úó� ø �û¤�µ¡�¨ù¢�¢ ü÷�±õ •(ü¨��ª¤�î) .ö��î �� 1381-82 ôø¢ ñ�¨Ý�÷ ¥� ,�ûݵþ¤�Úó� Û�ܽ� ø ü��ÂÏ •(Àª¤� ü¨��ª¤�î) ö��î �� 1376-77 ñø� ñ�¨Ý�÷ ¥� ,ü��±¨�½õ ý�¨À�û •(Àª¤� ü¨��ª¤�î) ö��î �� 1377-78 ñø� ñ�¨Ý�÷ ¥� ,�µêÂÈ�� ý�ûݵþ¤�Úó� •ýÃþ¤�õ�÷Â� üó�ä ý�¤�ª ¤¢ ö� öÀ÷�¨¤ °þ�Ê��� ø "��±¨�½õ ø �ûݵþ¤�Úó�' Àª¤� ü¨��ª¤�î ýù¤ø¢ Ûõ�î ü��ÂÏ •¤�Èî22

Page 23: IPM - Sharifsina.sharif.ac.ir/~ghodsi/farsi-full-resume.pdf · 2016-09-17 · Computing Homotopic Line Simplification, available online, Computational Geometry: Theory and Applications

ùÀª Åþ¤À� ý�û§¤¢ 11,üÆþ�÷�õ�÷Â� ø Â���³õ�î ü÷�±õ ,�ûݵþ¤�Úó� ø �û¤�µ¡�¨ù¢�¢ ü÷�±õ ,�ûݵþ¤�Úó� ø �û¤�µ¡�¨ù¢�¢ :ý�û§¤¢ Ã�÷ ø ë�ê À�� ý�û§¤¢.Ûõ�ä ý�ûݵÆ�¨ ø ,�µÆÆð ý�ûö�Þµ¡�¨ÂÚþ¢ ���� Û��ì ý�û´�ó�ãê 12¤¢ üõ�¨ ô�Öõ °Æî .1354 �� 1351 ñ�¨ ¥� üþ�¹È÷�¢ ö�¤ø¢ ¤¢ Óþª üµã�¬ ù�ÚÈ÷�¢ ×�µ¨��Þþ¦ Ý�� �Ìä •.¤�Èî ý�ûù�ÚÈ÷�¢ ×�µ¨��Þþ¦ ��Ö��Æõ ¤¢ 1353 ñ�¨(1387 ñ�¨ ¥�) (pap.blog.ir) "°ÜÖ� ��Üä ö�¢�µ¨�' ï�� ÂþÀõ ø Ũ�b õ �Ìä •(1379 ñ�¨ ¥� üÞþÀì ý�÷�ð ø 1384 ñ�¨ ¥�) (acm.blog.ir) "ö�Âþ� ¤¢ ô�ü¨ý� ý�Ö��Æõ' ï�� ÂþÀõ •

23