ابوالفضل پورعیدی

محتوای الکترونیک

• اصول سیستم های عامل [کارشناسی]
• الگوریتم های پیشرفته [کارشناسی ارشد]
• ریاضیات پایه [کارشناسی]
• کامپایلر [کارشناسی]

تابلوی اعلانات

زمینه‌های تدریس

• الگوریتم های پیشرفته
• هندسه محاسباتی

• اصول سیستم های عامل
• برنامه سازی پیشرفته
• کامپایلر

سرپرستی پایان‌نامه‌ها

مقالات و کتب

• "یک الگوریتم تقریبی برای حل مسئله تابع احاطه‌گر ایتالیایی روی گراف‌ها"، علوم رایانشی، 8، 3، 65-70


• "On $[1,2]$-Domination in Interval and Circle Graphs", Discrete Mathematics & Theoretical Computer Science, vol. 26:3,
• "Algorithmic complexity of triple Roman dominating functions on graphs", Communications in Combinatorics and Optimization, 9, 2, 217-232, 1401/10/20
• "On algorithmic complexity of imprecise spanners", COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 117, 1, 102051-, 1402/05/25
• "Algorithmic results on locating-total domination in graphs", DISCRETE APPLIED MATHEMATICS, 334, 1, 36-44
• "Counting independent sets in tricyclic graphs", DISCRETE APPLIED MATHEMATICS, 331, , 138-146, 1401/11/13
• "Algorithmic results in Roman dominating functions on graphs", INFORMATION PROCESSING LETTERS, 182, 1, 1-6, 1401/11/04
• "Double Roman domination in graphs: algorithmic complexity", Commun. Comb. Optim., , -, 1401/07/16
• "On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees", INFORMATION PROCESSING LETTERS, 178, , 106302-, 1401/05/03
• "Computing Strong Roman Domination of Trees and Unicyclic Graphs in Linear Time", Bulletin of the Malaysian Mathematical Sciences Society, , -, 1401/02/30
• "Algorithmic results in secure total dominating sets on graphs", THEORETICAL COMPUTER SCIENCE, 918, , 1-17, 1400/12/24
• "Algorithm and hardness results in double Roman domination of graphs", THEORETICAL COMPUTER SCIENCE, 911, , 70-79, 1400/11/25
• "Efficient algorithms for independent Roman domination on some classes of graphs", Commun. Comb. Optim., , -, 1400/04/20
• "ALGORITHMIC ASPECTS OF ROMAN GRAPHS", Journal of Algebraic Systems, 9, 1, 119-135
• "On the domination number of generalized Petersen graphs", Journal of Algorithms and Computation, 52, 2, 57-65, 1399/08/25
• "Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination", JOURNAL OF COMBINATORIAL OPTIMIZATION, 41, 2, 304-317, 1399/09/20
• "On Hop Roman Domination in Trees", Communications in Combinatorics and Optimization, 4, 2, 201-208, 1399/09/15
• "Algorithmic aspects of the independent 2-rainbow domination number and independent Roman {2}-domination number", Discussiones Mathematicae Graph Theory, , -, 1399/08/13
• "Total Roman domination for proper interval graphs", Electronic Journal of Graph Theory and Applications, 8, 2, 401-413
• "On computing secure domination of trees", Discrete Mathematics, Algorithms and Applications, 13, , 2150055-, 1399/08/03
• "On algorithmic complexity of double Roman domination", DISCRETE APPLIED MATHEMATICS, 285, , 539-551, 1399/04/11
• "On computing total double Roman domination number of trees in linear time", Journal of Algorithms and Computation, 52, 1, 131-137, 1399/03/12
• "Graphs with Large Hop Roman Domination Number", Computer Science Journal of Moldova, , -
• "On the Algorithmic Complexity of Roman $${2}$$-Domination (Italian Domination)", Iranian Journal of Science and Technology Transaction A-Science, 44, 3, 791-799, 1399/01/27
• "A linear algorithm for double Roman domination of proper interval graphs", Discrete Mathematics, Algorithms and Applications, 12, 1, 2050011-, 1398/10/09
• "Algorithmic and complexity aspects of problems related to total Roman domination for graphs", JOURNAL OF COMBINATORIAL OPTIMIZATION, 39, 3, 747-763

• "Algorithmic and complexity aspects of computing Roman {2}-domination in graphs", دوازدهمین کنفرانس بین المللی تحقیق در عملیات ایران, 1398/02/12, 1398/02/12
• "Increasing-Chord Planar Graphs for Points in Convex Position", ICCG 2018: 1st Iranian Conference on Computational Geometry, 1396/12/08, 1396/12/08

پروژه‌های تحقیقاتی

سوابق پژوهشی و اجرایی

دانشجویان دکتری

برنامه هفتگی

پرسش و پاسخ