Volume 410; Issue 21-23

Theoretical Computer Science

Volume 410; Issue 21-23
2

Paths, cycles and circular colorings in digraphs

Year:
2009
Language:
english
File:
PDF, 360 KB
english, 2009
3

Fast neighbor joining

Year:
2009
Language:
english
File:
PDF, 561 KB
english, 2009
4

On parameterized complexity of the Multi-MCS problem

Year:
2009
Language:
english
File:
PDF, 556 KB
english, 2009
6

Moves and displacements of particular elements in Quicksort

Year:
2009
Language:
english
File:
PDF, 393 KB
english, 2009
7

The complexity of clique graph recognition

Year:
2009
Language:
english
File:
PDF, 1.81 MB
english, 2009
8

Morphically primitive words

Year:
2009
Language:
english
File:
PDF, 836 KB
english, 2009
9

Asymptotic subword complexity of fixed points of group substitutions

Year:
2009
Language:
english
File:
PDF, 1.01 MB
english, 2009
10

Quasi-linear transformations and discrete tilings

Year:
2009
Language:
english
File:
PDF, 1.33 MB
english, 2009
11

Classifying rendezvous tasks of arbitrary dimension

Year:
2009
Language:
english
File:
PDF, 1.30 MB
english, 2009
12

Inapproximability of survivable networks

Year:
2009
Language:
english
File:
PDF, 414 KB
english, 2009
13

Collapsing words, permutation conditions and coherent colorings of trees

Year:
2009
Language:
english
File:
PDF, 964 KB
english, 2009
15

Truthful mechanisms for two-range-values variant of unrelated scheduling

Year:
2009
Language:
english
File:
PDF, 568 KB
english, 2009
16

Minimal achievable approximation ratio for MAX-MQ in finite fields

Year:
2009
Language:
english
File:
PDF, 401 KB
english, 2009
19

A best online algorithm for scheduling on two parallel batch machines

Year:
2009
Language:
english
File:
PDF, 388 KB
english, 2009
20

Coloring Artemis graphs

Year:
2009
Language:
english
File:
PDF, 503 KB
english, 2009
21

Matrix columns allocation problems

Year:
2009
Language:
english
File:
PDF, 859 KB
english, 2009
22

Approximation hardness of deadline-TSP reoptimization

Year:
2009
Language:
english
File:
PDF, 871 KB
english, 2009
23

Finding a tree structure in a resolution proof is NP-complete

Year:
2009
Language:
english
File:
PDF, 472 KB
english, 2009
24

Maximum scan statistics and channel assignment problems in homogeneous wireless networks

Year:
2009
Language:
english
File:
PDF, 751 KB
english, 2009
25

Deterministic bottom-up tree transducers and ground term rewrite systems

Year:
2009
Language:
english
File:
PDF, 2.03 MB
english, 2009
26

The simultaneous consecutive ones problem

Year:
2009
Language:
english
File:
PDF, 622 KB
english, 2009
28

Non-mitotic sets

Year:
2009
Language:
english
File:
PDF, 833 KB
english, 2009
29

Compound Node–Kayles on paths

Year:
2009
Language:
english
File:
PDF, 650 KB
english, 2009
32

Tight rank lower bounds for the Sherali–Adams proof system

Year:
2009
Language:
english
File:
PDF, 718 KB
english, 2009
33

Online scheduling on two uniform machines to minimize the makespan

Year:
2009
Language:
english
File:
PDF, 650 KB
english, 2009