期刊


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

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

题名作者出版年年卷期
Set systems: Order types, continuous nondeterministic deformations, and quasi-ordersYohji Akama20112011, vol.412, no.45
Abelian complexity of infinite words associated with quadratic Parry numbersL'ubomira Balkova; Karel Brinda; Ondrej Turek20112011, vol.412, no.45
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problemFlavia Bonomo; Sara Mattia; Gianpaolo Oriolo20112011, vol.412, no.45
Optimal algorithms for online scheduling with bounded rearrangement at the endXin Chen; Yan Lan; Attila Benko; Gyorgy Dosa; Xin Han20112011, vol.412, no.45
Conditional matching preclusion for the arrangement graphsEddie Cheng; Marc J. Lipman; Laszlo Liptak; David Sherman20112011, vol.412, no.45
An exact algorithm for the Maximum Leaf Spanning Tree problemHenning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Daniel Raible; Peter Rossmanith20112011, vol.412, no.45
Redundancy of minimal weight expansions in Pisot basesPeter J. Grabner; Wolfgang Steiner20112011, vol.412, no.45
A volume first maxima-finding algorithmXiangquan Gui; Xiaohong Hao; Yuanping Zhang; Xuerong Yong20112011, vol.412, no.45
The complexity of smooth words on 2-letter alphabetsYun Bao Huang20112011, vol.412, no.45
Parameterizing cut sets in a graph by the number of their componentsTakehiro Ito; Marcin Kaminski; Daniel Paulusma; Dimitrios M. Thilikos20112011, vol.412, no.45
12