知识中心主页
文献服务
文献资源
外文期刊
外文会议
专业机构
智能制造
高级检索
版权声明
使用帮助
期刊
ISSN
0304-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
题名
作者
出版年
年卷期
Termination of the iterated strong-factor operator on multipartite graphs
Crespelle, Christophe; Phan, Thi Ha Duong; Thi Hung Tran
2015
2015, vol.571, no.
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
Lai, Cheng-Nan
2015
2015, vol.571, no.
On graphs that are not PCGs
Durocher, Stephane; Mondal, Debajyoti; Rahman, Md. Saidur
2015
2015, vol.571, no.
Searching for Zimin patterns
Rytter, Wojciech; Shur, Arseny M.
2015
2015, vol.571, no.
The importance of being proper (In clustered-level planarity and T-level planarity)
Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Frati, Fabrizio; Roselli, Vincenzo
2015
2015, vol.571, no.
Combinatorial auctions with verification are tractable
Krysta, Piotr; Ventre, Carmine
2015
2015, vol.571, no.
Upward planar graphs and their duals
Auer, Christopher; Bachmaier, Christian; Brandenburg, Franz J.; Gleissner, Andreas; Hanauer, Kathrin
2015
2015, vol.571, no.
A PTAS for the minimum weight connected vertex cover P-3 problem on unit disk graphs
Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo
2015
2015, vol.571, no.
制造业外文文献服务平台