Volume 396; Issue 1-3

Theoretical Computer Science

Volume 396; Issue 1-3
1

Comparison between parallel and serial dynamics of Boolean networks

E. Goles, L. Salinas
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 394 KB
english, 2008
3

Covering by squares

L. Salinas, E. Goles
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 5.15 MB
english, 2008
4

Inverse min–max spanning tree problem under the Weighted sum-type Hamming distance

Longcheng Liu, Enyu Yao
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 253 KB
english, 2008
5

Jug measuring: Algorithms and complexity

Min-Zheng Shieh, Shi-Chun Tsai
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 267 KB
english, 2008
6

On a quasi-ordering on Boolean functions

Miguel Couceiro, Maurice Pouzet
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 429 KB
english, 2008
7

Probabilistic analysis for scheduling with conflicts

Sandy Irani, Vitus Leung
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 441 KB
english, 2008
9

Tight bounds for the multiplicative complexity of symmetric functions

Joan Boyar, René Peralta
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 617 KB
english, 2008
10

All-pairs disjoint paths from a common ancestor in time

Raphael Yuster
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 342 KB
english, 2008
11

The 2nd-order conditional 3-coloring of claw-free graphs

Xueliang Li, Wenli Zhou
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 287 KB
english, 2008
12

Weak-vertex-pancyclicity of (n, k)-star graphs

Ying-You Chen, Dyi-Rong Duh, Tai-Ling Ye, Jung-Sheng Fu
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 705 KB
english, 2008
14

On the weight of universal insertion grammars

Lila Kari, Petr Sosík
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 239 KB
english, 2008
15

Partitioned probe comparability graphs

David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 358 KB
english, 2008
16

The NP-hardness of finding a directed acyclic graph for regular resolution

Samuel R. Buss, Jan Hoffmann
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 293 KB
english, 2008
17

A simple transitive signature scheme for directed trees

Gregory Neven
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 235 KB
english, 2008
19

On the clique partitioning problem in weighted interval graphs

Young-Soo Myung
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 289 KB
english, 2008
20

On the obfuscation complexity of planar graphs

Oleg Verbitsky
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 279 KB
english, 2008
21

Editorial Board

Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 80 KB
english, 2008
22

Palindrome positions in ternary square-free words

James D. Currie
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 179 KB
english, 2008
24

A better differential approximation ratio for symmetric TSP

Bruno Escoffier, Jérôme Monnot
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 339 KB
english, 2008
25

Modelling the navigation potential of a web page

Trevor Fenner, Mark Levene, George Loizou
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 439 KB
english, 2008
27

Paths in circuit graphs of matroids

Guizhen Liu, Ping Li
Journal:
Theoretical Computer Science
Year:
2008
Language:
english
File:
PDF, 435 KB
english, 2008