期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002～2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2021, vol.849 2021, vol.850 2021, vol.851 2021, vol.852 2021, vol.853 2021, vol.854
2021, vol.855 2021, vol.856 2021, vol.857 2021, vol.858 2021, vol.859 2021, vol.860
2021, vol.861 2021, vol.862 2021, vol.863 2021, vol.864 2021, vol.865 2021, vol.866
2021, vol.867 2021, vol.868 2021, vol.869 2021, vol.870 2021, vol.871 2021, vol.872
2021, vol.873 2021, vol.874 2021, vol.875 2021, vol.876 2021, vol.877 2021, vol.878/879
2021, vol.880 2021, vol.881 2021, vol.882 2021, vol.883 2021, vol.884 2021, vol.885
2021, vol.886 2021, vol.887 2021, vol.888 2021, vol.889 2021, vol.890 2021, vol.891
2021, vol.892 2021, vol.893 2021, vol.894 2021, vol.895 2021, vol.896

题名作者出版年年卷期
On the solution bound of two-sided scaffold fillingMa, Jingjing; Zhu, Daming; Jiang, Haitao; Zhu, Binhai20212021, vol.873
Digraphs with proper connection number twoLi, Luyi; Li, Xueliang20212021, vol.873
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex orderingLiu, Yunlong; Chen, Jie; Huang, Jingui; Wang, Jianxin20212021, vol.873
Degree-anonymization using edge rotationsBazgan, Cristina; Cazals, Pierre; Chlebikova, Janka20212021, vol.873
Maximum rooted connected expansionLamprou, Ioannis; Martin, Russell; Schewe, Sven; Sigalas, Ioannis; Zissimopoulos, Vassilis20212021, vol.873
Almost linear time algorithms for minsum k-sink problems on dynamic flow path networksHigashikawa, Yuya; Katoh, Naoki; Teruyama, Junichi; Watase, Koji20212021, vol.873
A (probably) optimal algorithm for BISECTION on bounded-treewidth graphsHanaka, Tesshu; Kobayashi, Yasuaki; Sone, Taiga20212021, vol.873
An improved algorithm for learning sparse parities in the presence of noiseYan, Di; Yu, Yu; Liu, Hanlin; Zhao, Shuoyao; Zhang, Jiang20212021, vol.873



制造业外文文献服务平台