Theoretical Computer Science

Theoretical Computer Science

理论计算机科学

  • 4区 中科院分区
  • Q3 JCR分区

期刊简介

《Theoretical Computer Science》是由Elsevier出版社于1975年创办的英文国际期刊(ISSN: 0304-3975,E-ISSN: 1879-2294),该期刊长期致力于计算机:理论方法领域的创新研究,主要研究方向为工程技术-计算机:理论方法。作为SCIE收录期刊(JCR分区 Q3,中科院 4区),本刊采用OA未开放获取模式(OA占比0.0332...%),以发表计算机:理论方法领域等方向的原创性研究为核心(研究类文章占比100.00%%)。凭借严格的同行评审与高效编辑流程,期刊年载文量精选控制在344篇,确保学术质量与前沿性。成果覆盖Web of Science、Scopus等国际权威数据库,为学者提供推动计算机科学领域高水平交流平台。

投稿咨询

投稿提示

Theoretical Computer Science审稿周期约为 约4.5个月 约26.2周。该刊近年未被列入国际预警名单,年发文量约344篇,录用竞争适中,主题需确保紧密契合计算机科学前沿。投稿策略提示:避开学术会议旺季投稿以缩短周期,语言建议专业润色提升可读性。

  • 计算机科学 大类学科
  • English 出版语言
  • 是否预警
  • SCIE 期刊收录
  • 344 发文量

中科院分区

中科院 SCI 期刊分区 2023年12月升级版

Top期刊 综述期刊 大类学科 小类学科
计算机科学
4区
COMPUTER SCIENCE, THEORY & METHODS 计算机:理论方法
4区

中科院 SCI 期刊分区 2022年12月升级版

Top期刊 综述期刊 大类学科 小类学科
计算机科学
4区
COMPUTER SCIENCE, THEORY & METHODS 计算机:理论方法
4区

JCR分区

按JIF指标学科分区 收录子集 分区 排名 百分位
学科:COMPUTER SCIENCE, THEORY & METHODS SCIE Q3 93 / 143

35.3%

按JCI指标学科分区 收录子集 分区 排名 百分位
学科:COMPUTER SCIENCE, THEORY & METHODS SCIE Q4 111 / 143

22.73%

CiteScore

CiteScore SJR SNIP CiteScore 排名
CiteScore:2.6 SJR:0.57 SNIP:0.946
学科类别 分区 排名 百分位
大类:Computer Science 小类:General Computer Science Q3 124 / 232

46%

大类:Computer Science 小类:Theoretical Computer Science Q3 73 / 130

44%

期刊发文

  • Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane

    Author: Zou, Wenjie; Guo, Longkun; Hao, Chunlin; Liu, Lei

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 121-130. DOI: 10.1016/j.tcs.2022.10.046

  • Order based algorithms for the core maintenance problem on edge-weighted graphs

    Author: Zhang, Feiteng; Liu, Bin; Liu, Zhenming; Fang, Qizhi

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 140-155. DOI: 10.1016/j.tcs.2022.11.008

  • Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints*,**

    Author: Zhang, An; Zhang, Liang; Chen, Yong; Chen, Guangting; Wang, Xing

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 167-179. DOI: 10.1016/j.tcs.2022.11.012

  • An LP-based approximation algorithm for the generalized traveling salesman path problem

    Author: Sun, Jian; Gutin, Gregory; Li, Ping; Shi, Peihao; Zhang, Xiaoyan

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 180-190. DOI: 10.1016/j.tcs.2022.11.013

  • Delay-constrained minimum shortest path trees and related problems

    Author: Lichen, Junran; Cai, Lijian; Li, Jianping; Liu, Suding; Pan, Pengxiang; Wang, Wencheng

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 191-201. DOI: 10.1016/j.tcs.2022.11.014

  • A robust map matching method by considering memorized multiple matching candidates

    Author: Li, Wanting; Wang, Yongcai; Li, Deying; Xu, Xiaojia

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 104-120. DOI: 10.1016/j.tcs.2022.10.032

  • Colouring graphs with no induced six-vertex path or diamond

    Author: Goedgebeur, Jan; Huang, Shenwei; Ju, Yiao; Merkel, Owen

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 941, Issue , pp. 278-299. DOI: 10.1016/j.tcs.2022.11.020

  • Improved approximation algorithms for solving the squared metric k-facility location problem

    Author: Zhang, Zhen; Feng, Qilong; Huang, Junyu; Wang, Jianxin

    Journal: THEORETICAL COMPUTER SCIENCE. 2023; Vol. 942, Issue , pp. 107-122. DOI: 10.1016/j.tcs.2022.11.027