期刊


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

2010, vol.411, no.1 2010, vol.411, no.10 2010, vol.411, no.11/13 2010, vol.411, no.14/15 2010, vol.411, no.16/18 2010, vol.411, no.19
2010, vol.411, no.2 2010, vol.411, no.20 2010, vol.411, no.21 2010, vol.411, no.22/24 2010, vol.411, no.25 2010, vol.411, no.26/28
2010, vol.411, no.29/30 2010, vol.411, no.3 2010, vol.411, no.31/33 2010, vol.411, no.34/36 2010, vol.411, no.37 2010, vol.411, no.4/5
2010, vol.411, no.40/42 2010, vol.411, no.43 2010, vol.411, no.44/46 2010, vol.411, no.47 2010, vol.411, no.48 2010, vol.411, no.49
2010, vol.411, no.50 2010, vol.411, no.51/52 2010, vol.411, no.6 2010, vol.411, no.7/9

题名作者出版年年卷期
On compact representations of All-Pairs-Shortest-Path-Distance matricesPaolo Ferragina; Igor Nitto; Rossano Venturini20102010, vol.411, no.34/36
L(2, 1)-Labelings on the composition of n graphsZhendong Shao; Roberto Solis-Oba20102010, vol.411, no.34/36
Existence and nonexistence of descriptive patternsDominik D. Freydenberger; Daniel Reidenbach20102010, vol.411, no.34/36
A combinatorial approach to the analysis of bucket recursive treesMarkus Kuba; Alois Panholzer20102010, vol.411, no.34/36
Algorithm for two disjoint long paths in 2-connected graphsShan Zhou; Hao Li; Guanghui Wang20102010, vol.411, no.34/36
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ringRalf Klasing; Adrian Kosowski; Alfredo Navarra20102010, vol.411, no.34/36
N-player partizan gamesAlessandro Cincotti20102010, vol.411, no.34/36
Growth rates of complexity of power-free languagesArseny M. Shur20102010, vol.411, no.34/36
CSP duality and trees of bounded pathwidthCatarina Carvalho; Victor Dalmau; Andrei Krokhin20102010, vol.411, no.34/36
The parameterized complexity of editing graphs for bounded degeneracyLuke Mathieson20102010, vol.411, no.34/36
123