期刊


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

2024, vol.1000 2024, vol.1001 2024, vol.1002 2024, vol.1003 2024, vol.1004 2024, vol.1005
2024, vol.1006 2024, vol.1007 2024, vol.981 2024, vol.982 2024, vol.983 2024, vol.984
2024, vol.985 2024, vol.986 2024, vol.987 2024, vol.988 2024, vol.989 2024, vol.990
2024, vol.991 2024, vol.992 2024, vol.993 2024, vol.994 2024, vol.995 2024, vol.996
2024, vol.997 2024, vol.998 2024, vol.999

题名作者出版年年卷期
Preface: Special issue on theoretical aspects of computingPun, Violet Ka, I; Stolz, Volker; Simao, Adenilso20242024, vol.990
Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraintShi, Yishuo; Lai, Xiaoyan20242024, vol.990
State complexity of binary coded regular languagesGeffert, Viliam; Palisinova, Dominika; Szabari, Alexander20242024, vol.990
Three remarks on W 2 graphsFeghali, Carl; Marin, Malory20242024, vol.990
Finding dominating induced matchings in P10-free graphs in polynomial timeBrandstaedt, Andreas; Mosca, Raffaele20242024, vol.990
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidthBaste, Julien; Watel, Dimitri20242024, vol.990
Efficient code-based fully dynamic group signature schemeWang, Luping; Chen, Jie; Dai, Huan; Tao, Chongben20242024, vol.990
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithmsAcharyya, Ankush; Keikha, Vahideh; Majumdar, Diptapriyo; Pandit, Supantha20242024, vol.990
Smash and grab: The 0?6 scoring game on graphsDuchene, Eric; Gledel, Valentin; Gravier, Sylvain; Mc Inerney, Fionn; Mhalla, Mehdi; Parreau, Aline20242024, vol.990
Modular rewritable Petri nets: An efficient model for dynamic distributed systems *,**Capra, Lorenzo; Koehler-Bussmeier, Michael20242024, vol.990



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  机械工业信息研究院 2018-2024