期刊档案
Mathematical Problems of Computer Science
ISSN 2579-2784 · eISSN 2738-2788 · Gitutyun · Armenia
Mathematical Problems of Computer Science 钻石开放获取（无 APC），免版面费，投稿社区反馈审稿约 20 周，2025 年发文 15 篇。
研究范围
研究范围与定位
Mathematical Problems of Computer Science 由 Gitutyun 出版。按 OpenAlex 近年发文统计，该刊主要发表 Complexity and Algorithms in Graphs、Advanced Graph Theory Research、Probability and Statistical Research 等主题的论文，这 3 个主题约占 28.5%，主导子领域为 Computational Theory and Mathematics。（根据 OpenAlex 主题统计与中科院分区数据生成）
The periodical "Mathematical Problems of Computer Science" of IIAP NAS RA has been published since 1963. This is the retitled publication of “Transactions of the Institute for Informatics and Automation Problems of the NAS of RA, Mathematical Problems of Computer Science” since 2019. It covers modern directions of theoretical and applied mathematics, informatics, and computer science. It is peer-reviewed journal focusing on: Theory of Computation Discrete Mathematics Information Theory Signal Processing Artificial Intelligence Security and Privacy Data Analysis and Statistics Distributed Computing Design and Test Applied Computing Networks The aim of the periodical is to familiarize the scientific community of various countries with the most important problems of a topical and promising nature. It accepts manuscripts in English with novel and previously unpublished results, original research papers, critical survey articles, book reviews, as well as papers that present experimental evidence or theoretical results bearing on the use of ideas from such theories in any field to which the ideas are relevant. All submitted articles will undergo a single-blind review by at least two independent reviewers. Publication Frequency The periodicity of the Periodical is two issues per year. The periodical is published with a volume of about 100 pages, with a print run of 100, as well as the published articles are available on the periodical's website. In the future the volume and periodicity can be increased. On occasion, special events or topics will be published as a Special Issue, prepared by a Guest Editor. Article Processing Charges The publication is free of charge, the content is open access to support global knowledge sharing.
摘自期刊官网 Aims & Scope
主编 Shoukourian Yuri出版商官网
主要研究主题 OpenAlex 近年发文统计，占比为近似值
- Complexity and Algorithms in GraphsComputer Science11.9%
- Advanced Graph Theory ResearchComputer Science10.3%
- Probability and Statistical ResearchMathematics6.3%
- Coding theory and cryptographyComputer Science6%
- Computability, Logic, AI AlgorithmsComputer Science5.8%
- Logic, programming, and type systemsComputer Science5.6%
- Parallel Computing and Optimization TechniquesComputer Science4.8%
- semigroups and automata theoryComputer Science4.8%
分区与收录
学科分区与数据库收录
中科院期刊分区表
期刊分区表（ 2025年3月升级版）未收录
该期刊未被此版本分区表收录。
《新锐期刊分区表》（ 2026年3月发布）未收录
该期刊未被此版本分区表收录。
期刊分区表（ 2023年12月旧的升级版）未收录
该期刊未被此版本分区表收录。
数据库收录
DOAJLetPub
国际期刊预警名单：各版本均未列入LetPub
不同版本、大类与小类分别展示，不将不同评价口径合并为一个分区值；投稿与考核前请确认所在机构采用的版本。
指标
影响力指标与发文规模
影响力指标
- h-index
- 7OpenAlex ·
- i10-index
- 1OpenAlex ·
- 两年平均被引
- 0.67OpenAlex ·
- Gold OA 文章占比
- 0%LetPub ·
逐年发文量 OpenAlex 统计 · 累计 484 篇 · 当年数据不完整
| 年份 | 发文量 | 其中 OA | 被引 |
|---|---|---|---|
| 2026 | 5 | 5 | 16 |
| 2025 | 15 | 15 | 28 |
| 2024 | 16 | 16 | 26 |
| 2023 | 14 | 14 | 47 |
| 2022 | 15 | 15 | 2 |
| 2021 | 13 | 13 | 14 |
不同来源的统计口径与观测时间不同，页面保留各来源原值；“出版商公布”为期刊官网自述数据。
审稿与录用
审稿周期与录用情况
- 平均审稿速度（社区反馈）
- 20 WeeksLetPub ·
- 投稿到发表（期刊自报）
- 约 20 周DOAJ ·
- 评审方式
- 单盲同行评审DOAJ
社区反馈来自投稿者样本，置信度 0.5，不代表期刊承诺；“出版商公布”的时间节点定义以官网为准。
费用与开放获取
版面费与开放获取政策
钻石开放获取（无 APC）DOAJ
所有文章开放获取，且不向作者收取文章处理费。
| 来源 | 文章处理费 | 费用减免 | 许可证 | 观测时间 |
|---|---|---|---|---|
| DOAJ | 无文章处理费 | 无 | CC BY-NC | |
| LetPub | 无文章处理费 | 无 | — | |
| 出版商官网 | 无文章处理费 | — | — |
- APC 费用说明 ↗DOAJ
- 开放获取声明 ↗DOAJ
- 许可与版权 ↗DOAJ
费用以期刊官网为准；不同来源的观测时间可能不同，页面保留各来源原值，不做平均。
投稿要求
文章类型与投稿政策（官网）
投稿准备要点3 项，摘自作者指南
- 摘要
- ≤ 200 词
- 关键词
- 4–7 个
- 稿件模板
- 提供 LaTeX 模板
官网政策摘录开放获取、同行评审、查重
- 开放获取
Original, previously unpublished work required. 模型摘要
Contributions should contain novel and previously unpublished materials, i.e., original results, methods, observations, concepts or applications, as well as new insights into previously reported research.
原文 ↗出版商官网 ·- 同行评审
Single-blind peer review with at least two independent reviewers. 模型摘要
Articles in this journal are reviewed by at least two independent reviewers using a single-blind peer-review process, i.e., reviewers know the identity of authors, but authors do not know the identity of reviewers.
原文 ↗出版商官网 ·- 查重
Plagiarism screening before acceptance. 模型摘要
Before acceptance, the articles will be screened for plagiarism, i.e., the use of other people’s ideas, processes, results without mentioning the original author and source.
原文 ↗出版商官网 ·
摘录来自期刊官网页面，仅保留原文片段；“模型摘要”由 Workers AI 生成并经原文校验，以官网为准。
基本信息
出版信息与官方入口
- 出版商
- Gitutyun
- 出版国家或地区
- Armenia
- 出版语言
- English
- ISSN
- 2579-2784
- 电子版 ISSN
- 2738-2788
- 官网最新一期
- Volume 65（2026 年）
- 官方链接
- 期刊主页 ↗LetPub
- 作者指南 ↗LetPub
- Aims & Scope ↗LetPub
- APC 费用说明 ↗DOAJ
- 开放获取声明 ↗DOAJ
- 许可与版权 ↗DOAJ
- 评审流程 ↗LetPub
- 编委会 ↗LetPub
常见问题
关于 Mathematical Problems of Computer Science 的常见问题
Mathematical Problems of Computer Science 的审稿周期多长？
投稿社区反馈的平均审稿速度为约 20 周。文章统计只含被录用的稿件，出版商数据口径以官网为准，社区反馈来自投稿者样本，均不代表期刊承诺。
Mathematical Problems of Computer Science 的投稿格式要求是什么？
据期刊作者指南：摘要：≤ 200 词；关键词：4–7 个；稿件模板：提供 LaTeX 模板。以上由模型从作者指南提取并逐项与原文核对，投稿前请以官网最新版本为准。
Mathematical Problems of Computer Science 被哪些数据库收录？
据 LetPub 与 DOAJ 记录，Mathematical Problems of Computer Science 被 DOAJ 收录。
Mathematical Problems of Computer Science 是开放获取期刊吗？版面费多少？
Mathematical Problems of Computer Science 为钻石开放获取（无 APC）。不收取文章处理费。
来源与更新
本页事实来自 LetPub、OpenAlex、DOAJ、出版商官网；每个数字旁标注来源与观测日期，冲突数据保留各来源原值。LetPub 原始详情页：查看 ↗（2026-08-25 归档）。最近更新：。