期刊


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

2012, vol.413, no.1 2012, vol.414, no.1 2012, vol.415 2012, vol.416 2012, vol.417 2012, vol.418
2012, vol.419 2012, vol.420 2012, vol.421 2012, vol.422 2012, vol.423 2012, vol.424
2012, vol.425 2012, vol.426/427 2012, vol.428 2012, vol.429 2012, vol.430 2012, vol.431
2012, vol.432 2012, vol.433 2012, vol.434 2012, vol.435 2012, vol.436 2012, vol.437
2012, vol.438 2012, vol.439 2012, vol.440/441 2012, vol.442 2012, vol.443 2012, vol.444
2012, vol.445 2012, vol.446 2012, vol.447 2012, vol.448 2012, vol.449 2012, vol.450
2012, vol.451 2012, vol.452 2012, vol.453 2012, vol.454 2012, vol.455 2012, vol.456
2012, vol.457 2012, vol.458 2012, vol.459 2012, vol.460 2012, vol.461 2012, vol.462
2012, vol.463 2012, vol.464 2012, vol.465 2012, vol.466

题名作者出版年年卷期
Matching preclusion for balanced hypercubesHuazhong Lu; Xianyue Li; Heping Zhang20122012, vol.465
Analytical aspects of tie breakingTobias Jacobs20122012, vol.465
Equitable colorings of planar graphs without short cyclesKeaitsuda Nakprasit; Kittikorn Nakprasit20122012, vol.465
Node-disjoint paths in a level block of generalized hierarchical completely connected networksToshinori Takabatake; Tomoki Nakamigawa20122012, vol.465
Linear time algorithms for two disjoint paths problems on directed acyclic graphsTorsten Tholey20122012, vol.465
Branch less, cut more and minimize the number of late equal-length jobs on identical machinesNodari Vakhania20122012, vol.465
An algorithm to construct independent spanning trees on parity cubesYan Wang; Jianxi Fan; Xiaohua Jia; He Huang20122012, vol.465
Corrigendum: "On Brlek-Reutenauer conjecture"L'. Balkova; E. Pelantova; S. Starosta20122012, vol.465



制造业外文文献服务平台