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

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

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

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

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

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

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

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

مقالات و کتب

• "یک الگوریتم تقریبی برای حل مسئله تابع احاطه‌گر ایتالیایی روی گراف‌ها"، مجله علوم رایانشی (Computing Science Journal)، 3، 3، 65-70، 2023-12-21


• "Graphs with Large Hop Roman Domination Number", Computer Science Journal of Moldova, 0, 0, -, 2020-05-05
• "A linear algorithm for double Roman domination of proper interval graphs", Discrete Mathematics, Algorithms and Applications, 1, 1, 2050011-
• "Algorithmic and complexity aspects of problems related to total Roman domination for graphs", JOURNAL OF COMBINATORIAL OPTIMIZATION, 3, 3, 747-763, 2019-12-16
• "A lower bound for computing geometric spanners", COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 0, 0, 21-26
• "Algorithmic aspects of the independent 2-rainbow domination number and independent Roman {2}-domination number", Discussiones Mathematicae Graph Theory, 0, 0, -
• "On the Algorithmic Complexity of Roman $$\{2\}$$-Domination (Italian Domination)", Iranian Journal of Science and Technology Transaction A-Science, 3, 3, 791-799
• "On computing total double Roman domination number of trees in linear time", Journal of Algorithms and Computation, 1, 1, 131-137
• "On algorithmic complexity of double Roman domination", DISCRETE APPLIED MATHEMATICS, 0, 0, 539-551
• "Total Roman domination for proper interval graphs", Electronic Journal of Graph Theory and Applications, 2, 2, 401-413, 2020-10-31
• "On computing secure domination of trees", Discrete Mathematics, Algorithms and Applications, 0, 0, 2150055-
• "On the domination number of generalized Petersen graphs", Journal of Algorithms and Computation, 2, 2, 57-65, 2020-12-30
• "Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination", JOURNAL OF COMBINATORIAL OPTIMIZATION, 2, 2, 304-317
• "On Hop Roman Domination in Trees", Communications in Combinatorics and Optimization, 2, 2, 201-208
• "ALGORITHMIC ASPECTS OF ROMAN GRAPHS", Journal of Algebraic Systems, 1, 1, 119-135, 2021-02-05
• "Computing Strong Roman Domination of Trees and Unicyclic Graphs in Linear Time", Bulletin of the Malaysian Mathematical Sciences Society, 0, 0, -
• "Double Roman domination in graphs: algorithmic complexity", Commun. Comb. Optim., 0, 0, -
• "Efficient algorithms for independent Roman domination on some classes of graphs", Commun. Comb. Optim., 0, 0, -
• "On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees", INFORMATION PROCESSING LETTERS, 0, 0, 106302-
• "Algorithm and hardness results in double Roman domination of graphs", THEORETICAL COMPUTER SCIENCE, 0, 0, 70-79
• "Algorithmic results in secure total dominating sets on graphs", THEORETICAL COMPUTER SCIENCE, 0, 0, 1-17
• "Algorithmic complexity of triple Roman dominating functions on graphs", Communications in Combinatorics and Optimization, 2, 2, 217-232, 2024-01-29
• "Algorithmic results in Roman dominating functions on graphs", INFORMATION PROCESSING LETTERS, 1, 1, 1-6, 2023-02-08
• "Counting independent sets in tricyclic graphs", DISCRETE APPLIED MATHEMATICS, 0, 0, 138-146, 2023-05-31
• "Algorithmic results on locating-total domination in graphs", DISCRETE APPLIED MATHEMATICS, 1, 1, 36-44, 2023-07-31
• "On algorithmic complexity of imprecise spanners", COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1, 1, 102051-

• "Increasing-Chord Planar Graphs for Points in Convex Position", ICCG 2018: 1st Iranian Conference on Computational Geometry, ایران, تهران, 2018-02-27
• "Algorithmic and complexity aspects of computing Roman {2}-domination in graphs", دوازدهمین کنفرانس بین المللی تحقیق در عملیات ایران, 2019-05-02
• "Spanners on imprecise points", ICCG 2021: 4th Iranian Conference on Computational Geometry, ایران, یزد, 2021-06-02

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

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

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

برنامه هفتگی

پرسش و پاسخ