Journal Report

THEORETICAL COMPUTER SCIENCE

Download PDF
Journal Information
Journal Title
THEORETICAL COMPUTER SCIENCE
Publisher
ELSEVIER
ISSN
0304-3975
E-ISSN
1879-2294
Database
Clarivate
Domain
Life Sciences, Physical Sciences, Social Sciences
Classification History
Year A+ A B C
2026 ✓ ✓
2025 ✓ ✓
2024 ✓ ✓
2023 ✓ ✓
2021/2022 ✓ ✓
2020 ✓ ✓
2019 ✓ ✓
2018 ✓
A journal may have more than one classification in the same year. All recorded classifications are displayed.
Recent Articles
Cops and robber on variants of retracts and subdivisions of oriented graphs
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
2027-1 Vol. 1089 Pages 116287
DOI: 10.1016/j.tcs.2026.116287
On asynchronous multiparty session types for federated learning
Ivan Prokić, Simona Prokić, Silvia Ghilezan et al.
2027-1 Vol. 1089 Pages 116286
DOI: 10.1016/j.tcs.2026.116286
Cyclic diagnosability of augmented cubes under the fault diagnosis model
Jiaxin Cai, Peng Deng, Yanze Huang et al.
2027-1 Vol. 1089 Pages 116295
DOI: 10.1016/j.tcs.2026.116295
A randomized self-stabilizing luby-style MIS algorithm via geometric priority compression
Rongcheng Dong, Xinli Xiong, Jun Huang
2027-1 Vol. 1089 Pages 116298
DOI: 10.1016/j.tcs.2026.116298
An approximation algorithm for minimum cost connected Roman dominating set problems
Yaoyao Zhang, Zhao Zhang, Jiao Zhou
2026-12 Vol. 1088 Pages 116281
DOI: 10.1016/j.tcs.2026.116281
A survey on the dynamical properties of additive cellular automata over finite abelian groups
Alberto Dennunzio, Enrico Formenti, Luciano Margara
2026-12 Vol. 1088 Pages 116278
DOI: 10.1016/j.tcs.2026.116278
When agents are powerful: Black hole search with verification in time-varying graphs
Tanvir Kaur, Ashish Saxena
2026-12 Vol. 1088 Pages 116285
DOI: 10.1016/j.tcs.2026.116285
Constant-width circuits of polylogarithmic genus compute exactly ACC0
Mitar Nedeljković
2026-12 Vol. 1088 Pages 116289
DOI: 10.1016/j.tcs.2026.116289
An in-place maximum matching algorithm for graphs of minimum degree 5
Valentin Bartier, Julien Baste
2026-12 Vol. 1088 Pages 116279
DOI: 10.1016/j.tcs.2026.116279
Tight linear inapproximability for the temporal graph exploration problem
Masaki Yamamoto
2026-12 Vol. 1088 Pages 116282
DOI: 10.1016/j.tcs.2026.116282
Articles retrieved from Crossref.
Green Journals | https://www.green-journals.com | info@green-journals.com
Printed: November 2, 2026 01:38