期刊


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

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

题名作者出版年年卷期
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivationsAlexander Meduna; Jiri Techet20092009, vol.410, no.21/23
Universal augmentation schemes for network navigabilityPierre Fraigniaud; Cyril Gavoille; Adrian Kosowski; Emmanuelle Lebhar; Zvi Lotker20092009, vol.410, no.21/23
Paths, cycles and circular colorings in digraphsGuanghui Wang; Guizhen Liu20092009, vol.410, no.21/23
The simultaneous consecutive ones problemMarcus Oswald; Gerhard Reinelt20092009, vol.410, no.21/23
Fast neighbor joiningIsaac Elias; Jens Lagergren20092009, vol.410, no.21/23
On the independent spanning trees of recursive circulant graphs G(cd{sup}m, d) with d > 2Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang20092009, vol.410, no.21/23
Non-mitotic setsChristian Glasser; Alan L. Selman; Stephen Travers; Liyu Zhang20092009, vol.410, no.21/23
On parameterized complexity of the Multi-MCS problemWenbin Chen; Matthew C. Schmidt; Nagiza F. Samatova20092009, vol.410, no.21/23
Compound Node-Kayles on pathsAdrien Guignard; Eric Sopena20092009, vol.410, no.21/23
Covering graphs with few complete bipartite subgraphsHerbert Fleischner; Egbert Mujuni; Daniel Paulusma; Stefan Szeider20092009, vol.410, no.21/23
1234



制造业外文文献服务平台