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

期刊


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

2006, vol.350, no.1 2006, vol.350, no.2-3 2006, vol.351, no.1 2006, vol.351, no.2 2006, vol.351, no.3 2006, vol.352, no.1-3
2006, vol.353, no.1-3 2006, vol.354, no.1 2006, vol.354, no.2 2006, vol.354, no.3 2006, vol.355, no.1 2006, vol.355, no.2
2006, vol.355, no.3 2006, vol.356, no.1-2 2006, vol.356, no.3 2006, vol.357, no.1-3 2006, vol.358, no.1 2006, vol.358, no.2-3
2006, vol.359, no.1-3 2006, vol.360, no.1-3 2006, vol.361, no.1 2006, vol.361, no.2-3 2006, vol.362, no.1-3 2006, vol.363, no.1
2006, vol.363, no.2 2006, vol.363, no.3 2006, vol.364, no.1 2006, vol.364, no.2 2006, vol.364, no.3 2006, vol.365, no.1-2
2006, vol.365, no.3 2006, vol.366, no.1-2 2006, vol.366, no.3 2006, vol.367, no.1-2 2006, vol.367, no.3 2006, vol.368, no.1-2
2006, vol.368, no.3 2006, vol.369, no.1-3

题名作者出版年年卷期
Compatibility of unrooted phylogenetic trees is FPTDavid Bryant; Jens Lagergren20062006, vol.351, no.3
Simplifying the weft hierarchyJonathan F. Buss; Tarique Islam20062006, vol.351, no.3
On miniaturized problems in parameterized complexity theoryYijia Chen; Jorg Flum20062006, vol.351, no.3
Parameterized enumeration, transversals, and imperfect phylogeny reconstructionPeter Damaschke20062006, vol.351, no.3
On finding short resolution refutations and small unsatisfiable subsetsMichael R. Fellows; Stefan Szeider; Graham Wrightson20062006, vol.351, no.3
Chordless paths through three verticesRobert Haas; Michael Hoffmann20062006, vol.351, no.3
Trees, grids, and MSO decidability: From graphs to matroidsPetr Hlineny; Detlef Seese20062006, vol.351, no.3
Parameterized graph separation problemsDaniel Marx20062006, vol.351, no.3
Parameterized coloring problems on chordal graphsDaniel Marx20062006, vol.351, no.3
Moving policies in cyclic assembly line schedulingMatthias Muller-Hannemann; Karsten Weihe20062006, vol.351, no.3
12