期刊


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

2024, vol.1000 2024, vol.1001 2024, vol.1002 2024, vol.1003 2024, vol.1004 2024, vol.1005
2024, vol.1006 2024, vol.1007 2024, vol.981 2024, vol.982 2024, vol.983 2024, vol.984
2024, vol.985 2024, vol.986 2024, vol.987 2024, vol.988 2024, vol.989 2024, vol.990
2024, vol.991 2024, vol.992 2024, vol.993 2024, vol.994 2024, vol.995 2024, vol.996
2024, vol.997 2024, vol.998 2024, vol.999

题名作者出版年年卷期
Popular critical matchings in the many-to-many settingNasre M.; Ranjan K.; Nimbhorkar P.; Sarkar A.20242024, vol.982
Energy complexity of regular languagesKiyak F.; Say A.C.C.20242024, vol.982
Convex grid drawings of planar graphs with constant edge-vertex resolutionBekos M.A.; Montecchiani F.; Symvonis A.; Gronemann M.20242024, vol.982
Almost disjoint paths and separating by forbidden pairsBachtler O.; Bergner T.; Krumke S.O.20242024, vol.982
The computational complexity of Holant problems on 3-regular graphsYang P.; Huang Y.; Fu Z.20242024, vol.982
Selfish bin packing with punishmentGai L.; Zhang W.; Zhang Z.20242024, vol.982
Algorithms and hardness results for edge total domination problem in graphsHenning M.A.; Pandey A.; Sharma G.; Tripathi V.20242024, vol.982
Designing aperture 22k hexagonal grids and their indexing as factor rings of Eisenstein integersTanaka Y.20242024, vol.982
Space efficient algorithm for solving reachability using tree decomposition and separatorsJain R.; Tewari R.20242024, vol.982
The energy complexity of diameter and minimum cut computation in bounded-genus networksChang Y.-J.20242024, vol.982
12



制造业外文文献服务平台