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

期刊


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

2015, vol.561, no.Pt.A 2015, vol.561, no.Pt.B 2015, vol.562 2015, vol.562, no. 2015, vol.563 2015, vol.563, no.
2015, vol.564 2015, vol.564, no. 2015, vol.565 2015, vol.565, no. 2015, vol.566 2015, vol.566, no.
2015, vol.567 2015, vol.567, no. 2015, vol.568 2015, vol.568, no. 2015, vol.569 2015, vol.569, no.
2015, vol.570 2015, vol.570, no. 2015, vol.571 2015, vol.571, no. 2015, vol.572 2015, vol.572, no.
2015, vol.573 2015, vol.573, no. 2015, vol.574 2015, vol.574, no. 2015, vol.575 2015, vol.575, no.
2015, vol.576 2015, vol.577 2015, vol.578 2015, vol.579 2015, vol.580 2015, vol.581
2015, vol.582 2015, vol.583 2015, vol.584 2015, vol.585 2015, vol.586 2015, vol.587
2015, vol.588 2015, vol.589 2015, vol.590 2015, vol.591 2015, vol.592 2015, vol.593
2015, vol.594 2015, vol.595 2015, vol.596 2015, vol.597 2015, vol.598 2015, vol.599
2015, vol.600 2015, vol.601 2015, vol.602 2015, vol.603 2015, vol.604 2015, vol.605
2015, vol.606 2015, vol.607, no.Pt.1 2015, vol.607, no.Pt.2 2015, vol.607, no.Pt.3 2015, vol.608, no.Pt.1 2015, vol.608, no.Pt.2
2015, vol.608, no.Pt.3

题名作者出版年年卷期
The fault-tolerant capacitated K-center problemChechik, Shiri; Peleg, David20152015, vol.566
Some sufficient conditions for 1-planar graphs to be Class 1Zhang, Wenwen; Wu, Jian-Liang20152015, vol.566
Abelian properties of Parry wordsTurek, Ondrej20152015, vol.566
Complexity of conflict-free colorings of graphsGargano, Luisa; Rescigno, Adele A.20152015, vol.566
On the proper orientation number of bipartite graphsAraujo, Julio; Cohen, Nathann; de Rezende, Susanna F.; Havet, Frederic; Moura, Phablo F. S.20152015, vol.566
Descriptional complexity of unambiguous input-driven pushdown automataOkhotin, Alexander; Salomaa, Kai20152015, vol.566



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024