期刊


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

2014, vol.515 2014, vol.516 2014, vol.517 2014, vol.518 2014, vol.519 2014, vol.520
2014, vol.521 2014, vol.522 2014, vol.523 2014, vol.524 2014, vol.525 2014, vol.526
2014, vol.527 2014, vol.528 2014, vol.529 2014, vol.530 2014, vol.531 2014, vol.532
2014, vol.533 2014, vol.534 2014, vol.535 2014, vol.536 2014, vol.537 2014, vol.538
2014, vol.539 2014, vol.540/541 2014, vol.543 2014, vol.544 2014, vol.545 2014, vol.546
2014, vol.547 2014, vol.548 2014, vol.549 2014, vol.550 2014, vol.551 2014, vol.551, no.
2014, vol.552 2014, vol.553 2014, vol.554 2014, vol.555 2014, vol.556 2014, vol.557
2014, vol.558 2014, vol.559 2014, vol.559, no. 2014, vol.560, no.Pt.1 2014, vol.560, no.Pt.2 2014, vol.560, no.Pt.3

题名作者出版年年卷期
Connection between conjunctive capacity and structural properties of graphsMiroslav Chlebik; Janka Chlebikova20142014, vol.554
2-Connecting outerplanar graphs without blowing up the pathwidthJasine Babu; Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad20142014, vol.554
Online algorithms for 1-space bounded 2-dimensional bin packing and square packingYong Zhang; Francis Y. L. Chin; Hing-Fung Ting; Xin Han; Chung Keung Poon; Yung H. Tsin; Deshi Ye20142014, vol.554
Non-planar square-orthogonal drawing with few-bend edgesYu-An Lin; Sheung-Hung Poon20142014, vol.554
A practical decision procedure for Propositional Projection Temporal Logic with infinite modelsZhenhua Duan; Cong Tian20142014, vol.554
Schedules for marketing products with negative externalitiesZhigang Cao; Xujin Chen; Changjun Wang20142014, vol.554
Algorithms for parameterized maximum agreement forest problem on multiple treesFeng Shi; Jianxin Wang; Jianer Chen; Qilong Feng; Jiong Guo20142014, vol.554
On the treewidth of dynamic graphsBernard Mans; Luke Mathieson20142014, vol.554
A systematic methodology for automated theorem findingHongbiao Gao; Yuichi Goto; Jingde Cheng20142014, vol.554
On the advice complexity of the online L(2, 1)-coloring problem on paths and cyclesMaria Paola Bianchi; Hans-Joachim Bockenhauer; Juraj Hromkovic; Sacha Krug; Bjorn Steffen20142014, vol.554
12



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