中国机械工程学会生产工程分会知识服务平台

期刊


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

2011, vol.412, no.1/2 2011, vol.412, no.11 2011, vol.412, no.12/14 2011, vol.412, no.15 2011, vol.412, no.16 2011, vol.412, no.17
2011, vol.412, no.18 2011, vol.412, no.19 2011, vol.412, no.20 2011, vol.412, no.21 2011, vol.412, no.22 2011, vol.412, no.23
2011, vol.412, no.24 2011, vol.412, no.25 2011, vol.412, no.26 2011, vol.412, no.27 2011, vol.412, no.28 2011, vol.412, no.29
2011, vol.412, no.3 2011, vol.412, no.30 2011, vol.412, no.31 2011, vol.412, no.32 2011, vol.412, no.33 2011, vol.412, no.34
2011, vol.412, no.35 2011, vol.412, no.36 2011, vol.412, no.37 2011, vol.412, no.38 2011, vol.412, no.39 2011, vol.412, no.4/5
2011, vol.412, no.40 2011, vol.412, no.41 2011, vol.412, no.42 2011, vol.412, no.43 2011, vol.412, no.44 2011, vol.412, no.45
2011, vol.412, no.46 2011, vol.412, no.47 2011, vol.412, no.48 2011, vol.412, no.50 2011, vol.412, no.51 2011, vol.412, no.52
2011, vol.412, no.6 2011, vol.412, no.7 2011, vol.412, no.8/10

题名作者出版年年卷期
Co-evolution and information signals in biological sequencesA. Carbone; L. Dib20112011, vol.412, no.23
Block-graph widthMaw-Shang Chang; Ling-Ju Hung; Ton Kloks; Sheng-Lung Peng20112011, vol.412, no.23
A computational proof of complexity of some restricted counting problemsJin-Yi Cai; Pinyan Lu; Mingji Xia20112011, vol.412, no.23
Improved deterministic algorithms for weighted matching and packing problemsJianer Chen; Qilong Feng; Yang Liu; Songjian Lu; Jianxin Wang20112011, vol.412, no.23
On the red/blue spanning tree problemSergey Bereg; Minghui Jiang; Boting Yang; Binhai Zhu20112011, vol.412, no.23
Parameterized complexity of coloring problems: Treewidth versus vertex coverJiri Fiala; Petr A. Golovach; Jan Kratochvil20112011, vol.412, no.23
Best-order streaming modelAtish Das Sarma; Richard J. Lipton; Danupon Nanongkai20112011, vol.412, no.23
Linear programming based approximation algorithms for feedback set problems in bipartite tournamentsAnke van Zuylen20112011, vol.412, no.23
A linear kernel for a planar connected dominating setDaniel Lokshtanov; Matthias Mnich; Saket Saurabh20112011, vol.412, no.23
Kolmogorov complexity and combinatorial methods in communication complexityMarc Kaplan; Sophie Laplante20112011, vol.412, no.23



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