知识中心主页
文献服务
文献资源
外文期刊
外文会议
专业机构
智能制造
高级检索
版权声明
使用帮助
期刊
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
2019, vol.753
2019, vol.754
2019, vol.755
2019, vol.756
2019, vol.757
2019, vol.758
2019, vol.759
2019, vol.760
2019, vol.761
2019, vol.762
2019, vol.763
2019, vol.764
2019, vol.765
2019, vol.766
2019, vol.767
2019, vol.768
2019, vol.769
2019, vol.770
2019, vol.771
2019, vol.772
2019, vol.773
2019, vol.774
2019, vol.775
2019, vol.776
2019, vol.777
2019, vol.778
2019, vol.779
2019, vol.780
2019, vol.781
2019, vol.782
2019, vol.783
2019, vol.784
2019, vol.785
2019, vol.786
2019, vol.787
2019, vol.788
2019, vol.789
2019, vol.790
2019, vol.791
2019, vol.792
2019, vol.793
2019, vol.794
2019, vol.795
2019, vol.796
2019, vol.797
2019, vol.798
2019, vol.799
2019, vol.800
题名
作者
出版年
年卷期
Preface to special issue on Theory and Applications of Graph Searching
Angelopoulos, Spyros; Nisse, Nicolas; Thilikos, Dimitrios M.
2019
2019, vol.794
Firefighting on trees
Coupechoux, Pierre; Demange, Marc; Ellison, David; Jouve, Bertrand
2019
2019, vol.794
Bounds on the burning numbers of spiders and path-forests
Bonato, Anthony; Lidbetter, Thomas
2019
2019, vol.794
y Hyperopic Cops and Robbers
Clarke, N. E.; Bonato, A.; Cox, D.; Finbow, S.; Mc Inerney, F.; Messinger, M. E.
2019
2019, vol.794
How many zombies are needed to catch the survivor on toroidal grids?
Pralat, Pawel
2019
2019, vol.794
Search for an immobile Hider in a known subset of a network
Alpern, Steve
2019
2019, vol.794
Eternally dominating large grids
Lamprou, Ioannis; Martin, Russell; Schewe, Sven
2019
2019, vol.794
Finding small-width connected path decompositions in polynomial time
Dereniowski, Dariusz; Osula, Dorota; Rzazewski, Pawel
2019
2019, vol.794
Cops, a fast robber and defensive domination on interval graphs
Dereniowski, Dariusz; Gavenciak, Tomas; Kratochvil, Jan
2019
2019, vol.794
制造业外文文献服务平台