Volume 423; Issue none

Main
Theoretical Computer Science
Volume 423; Issue none

Theoretical Computer Science

Volume 423; Issue none

1

The set of parameterized -covers problem

A.A. Gorbenko, V.Yu. Popov

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 221 KB

english, 2012

2

On the NP-completeness of the perfect matching free subgraph problem

Mathieu Lacroix, A. Ridha Mahjoub, Sébastien Martin, Christophe Picouleau

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 231 KB

english, 2012

3

An improved algorithm for online rectangle filling

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 507 KB

english, 2012

4

Monge properties of sequence alignment

Luís M.S. Russo

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 1.60 MB

english, 2012

5

Finding all maximally-matchable edges in a bipartite graph

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 259 KB

english, 2012

6

Corrigendum to “A simple and efficient Union–Find–Delete algorithm” [Theoret. Comput. Sci. 412 (4–5) 487–492]

Amir M. Ben-Amram, Simon Yoffe

Journal:

Theoretical Computer Science

Year:

2012

File:

PDF, 119 KB

2012

7

Determining the chromatic number of triangle-free -free graphs in polynomial time

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 283 KB

english, 2012

8

A note on sorting buffers offline

Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 222 KB

english, 2012

9

Editorial Board

Journal:

Theoretical Computer Science

Year:

2012

File:

PDF, 58 KB

2012