Volume 412; Issue 35

Theoretical Computer Science

Volume 412; Issue 35
2

Approximating some network design problems with node costs

Guy Kortsarz, Zeev Nutov
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 276 KB
english, 2011
4

The complexity of determining the rainbow vertex-connection of a graph

Lily Chen, Xueliang Li, Yongtang Shi
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 203 KB
english, 2011
5

Drawn -in-a-row games

Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 427 KB
english, 2011
6

One-to-one disjoint path covers on -ary -cubes

Yuan-Kang Shih, Shin-Shin Kao
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 1.21 MB
english, 2011
7

Lexicographically least words in the orbit closure of the Rudin–Shapiro word

James Currie
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 227 KB
english, 2011
8

Finding and enumerating Hamilton cycles in 4-regular graphs

Heidi Gebauer
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 319 KB
english, 2011
9

Kernel bounds for disjoint cycles and disjoint paths

Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 246 KB
english, 2011
10

An exact algorithm for the Boolean connectivity problem for -CNF

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 261 KB
english, 2011
11

Workspace theorems for regular-controlled grammars

Alexander Meduna, Petr Zemek
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 268 KB
english, 2011
12

Unbounded-error quantum query complexity

Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 264 KB
english, 2011
13

Disjoint path covers in recursive circulants with faulty elements

Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 392 KB
english, 2011
14

Hardness of subgraph and supergraph problems in -tournaments

S. Kanthi Kiran, N.S. Narayanaswamy
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 240 KB
english, 2011
17

Digraph decompositions and monotonicity in digraph searching

Stephan Kreutzer, Sebastian Ordyniak
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 393 KB
english, 2011
18

Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes

Ruo-Wei Hung
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 415 KB
english, 2011
19

Local algorithms for edge colorings in UDGs

Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 314 KB
english, 2011
21

Sum of digits sequences modulo

Thomas W. Cusick, Lavinia Corina Ciungu
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 199 KB
english, 2011
22

Editorial Board

Journal:
Theoretical Computer Science
Year:
2011
File:
PDF, 58 KB
2011
23

A note on the average number of RSA fixed points

Chae Hoon Lim
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 238 KB
english, 2011
24

Amortized efficiency of generating planar paths in convex position

Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 684 KB
english, 2011
26

Evolving schemas for streaming XML

M. Shoaran, A. Thomo
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 306 KB
english, 2011
27

Applying IsRewritten criterion on Buchberger algorithm

Amir Hashemi, Benyamin M.-Alizadeh
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 353 KB
english, 2011
28

Linear solving for sign determination

Daniel Perrucci
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 219 KB
english, 2011
30

Static and expanding grid coverage with ant robots: Complexity results

Yaniv Altshuler, Alfred M. Bruckstein
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 472 KB
english, 2011