期刊


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

2009, vol.410, no.1 2009, vol.410, no.11 2009, vol.410, no.12-13 2009, vol.410, no.14 2009, vol.410, no.15 2009, vol.410, no.16
2009, vol.410, no.17 2009, vol.410, no.18 2009, vol.410, no.19 2009, vol.410, no.20 2009, vol.410, no.21/23 2009, vol.410, no.2-3
2009, vol.410, no.24/25 2009, vol.410, no.26 2009, vol.410, no.27/29 2009, vol.410, no.30/32 2009, vol.410, no.33/34 2009, vol.410, no.35
2009, vol.410, no.36 2009, vol.410, no.37 2009, vol.410, no.38/40 2009, vol.410, no.41 2009, vol.410, no.42 2009, vol.410, no.43
2009, vol.410, no.44 2009, vol.410, no.45 2009, vol.410, no.4-5 2009, vol.410, no.46 2009, vol.410, no.47/49 2009, vol.410, no.50
2009, vol.410, no.51 2009, vol.410, no.52 2009, vol.410, no.6-7 2009, vol.410, no.8-10

题名作者出版年年卷期
(r, p)-centroid problems on paths and treesJ. Spoerhase; H.-C. Wirth20092009, vol.410, no.47/49
Disjoint directed and undirected paths and cycles in digraphsJorgen Bang-Jensen; Matthias Kriesell20092009, vol.410, no.47/49
Necessary and sufficient conditions for learning with correction queriesCristina Tirnauca; Satoshi Kobayashi20092009, vol.410, no.47/49
The Parikh counting functions of sparse context-free languages are quasi-polynomialsFlavio D'Alessandro; Benedetto Intrigila; Stefano Varricchio20092009, vol.410, no.47/49
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookaheadWenjie Li; Jinjiang Yuan; Jianfa Cao; Hailin Bu20092009, vol.410, no.47/49
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problemAda Che; Vladimir Kats; Eugene Levner20092009, vol.410, no.47/49
Binary words with a given Diophantine exponentArturas Dubickas20092009, vol.410, no.47/49
Acyclic edge coloring of planar graphs with large girthDongxiao Yu; Jianfeng Hou; Guizhen Liu; Bin Liu; Lan Xu20092009, vol.410, no.47/49
A randomized algorithm for determining dominating sets in graphs of maximum degree fiveSoheir M. Khamis; Sameh S. Daoud; Hanaa A. E. Essa20092009, vol.410, no.47/49
Periodic scheduling with obligatory vacationsJiri Sgall; Hadas Shachnai; Tami Tamir20092009, vol.410, no.47/49
1234



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