期刊


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

2013, vol.467 2013, vol.468 2013, vol.469 2013, vol.470 2013, vol.471 2013, vol.472
2013, vol.473 2013, vol.474 2013, vol.475 2013, vol.476 2013, vol.477 2013, vol.478
2013, vol.479 2013, vol.480 2013, vol.481 2013, vol.482 2013, vol.483 2013, vol.484
2013, vol.485 2013, vol.486 2013, vol.487 2013, vol.488 2013, vol.489/490 2013, vol.491
2013, vol.492 2013, vol.493 2013, vol.494 2013, vol.495 2013, vol.496 2013, vol.497
2013, vol.498 2013, vol.499 2013, vol.500 2013, vol.501 2013, vol.502 2013, vol.503
2013, vol.504 2013, vol.505 2013, vol.506 2013, vol.507 2013, vol.508 2013, vol.509
2013, vol.510 2013, vol.511 2013, vol.512 2013, vol.513 2013, vol.514

题名作者出版年年卷期
Cops and invisible robbers: The cost of drunkennessAthanasios Kehagias; Dieter Mitsche; Pawel Pralat20132013, vol.481
On the least number of palindromes contained in an infinite wordGabriele Fici; Luca Q. Zamboni20132013, vol.481
Further hardness results on the rainbow vertex-connection number of graphsLily Chen; Xueliang Li; Huishu Lian20132013, vol.481
Boolean nested canalizing functions: A comprehensive analysisYuan Li; John O. Adeyeye; David Murrugarra; Boris Aguilar; Reinhard Laubenbacher20132013, vol.481
A tight characterization of strategic games with a unique equilibriumAntoniy Ganchev; Lata Narayanan; Sunil Shende20132013, vol.481
The Receptor Density AlgorithmNick D. L. Owens; Andrew Greensted; Jon Timmis; Andy Tyrrell20132013, vol.481
Increasing the minimum degree of a graph by contractionsPetr A. Golovach; Marcin Kaminski; Daniel Paulusma; Dimitrios M. Thilikos20132013, vol.481
Satisfiability of acyclic and almost acyclic CNF formulasSebastian Ordyniak; Daniel Paulusma; Stefan Szeider20132013, vol.481
A new filtration method and a hybrid strategy for approximate string matchingChia Wei Lu; Chin Lung Lu; R. C. T. Lee20132013, vol.481