| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximation of satisfactory bisection problems
|
Bazgan, Cristina
|
|
2008
|
74 |
5 |
p. 875-883
9 p.
|
article
|
| 2 |
A unified theory of structural tractability for constraint satisfaction problems
|
Cohen, David
|
|
2008
|
74 |
5 |
p. 721-743
23 p.
|
article
|
| 3 |
Compact roundtrip routing with topology-independent node names
|
Arias, Marta
|
|
2008
|
74 |
5 |
p. 775-795
21 p.
|
article
|
| 4 |
Compact samples for data dissemination
|
Milo, Tova
|
|
2008
|
74 |
5 |
p. 697-720
24 p.
|
article
|
| 5 |
Computational complexity of auditing finite attributes in statistical databases
|
Jonsson, Peter
|
|
2008
|
74 |
5 |
p. 898-909
12 p.
|
article
|
| 6 |
Contents
|
|
|
2008
|
74 |
5 |
p. OBC-
1 p.
|
article
|
| 7 |
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
|
Moran, Shlomo
|
|
2008
|
74 |
5 |
p. 850-869
20 p.
|
article
|
| 8 |
Cryptanalysis of a password authentication scheme over insecure networks
|
Xiang, Tao
|
|
2008
|
74 |
5 |
p. 657-661
5 p.
|
article
|
| 9 |
Editorial Board
|
|
|
2008
|
74 |
5 |
p. IFC-
1 p.
|
article
|
| 10 |
Efficient algorithms for counting parameterized list H-colorings
|
Díaz, Josep
|
|
2008
|
74 |
5 |
p. 919-937
19 p.
|
article
|
| 11 |
Fast periodic graph exploration with constant memory
|
Gąsieniec, Leszek
|
|
2008
|
74 |
5 |
p. 808-822
15 p.
|
article
|
| 12 |
Fault tolerance in cellular automata at high fault rates
|
McCann, Mark
|
|
2008
|
74 |
5 |
p. 910-918
9 p.
|
article
|
| 13 |
Finite automata for testing composition-based reconstructibility of sequences
|
Li, Qiang
|
|
2008
|
74 |
5 |
p. 870-874
5 p.
|
article
|
| 14 |
Hardness of optimal spaced seed design
|
Nicolas, François
|
|
2008
|
74 |
5 |
p. 831-849
19 p.
|
article
|
| 15 |
Improved bounds on sorting by length-weighted reversals
|
Bender, Michael A.
|
|
2008
|
74 |
5 |
p. 744-774
31 p.
|
article
|
| 16 |
Maximal repetitions in strings
|
Crochemore, Maxime
|
|
2008
|
74 |
5 |
p. 796-807
12 p.
|
article
|
| 17 |
On the Approximation of Correlation Clustering and Consensus Clustering
|
Bonizzoni, Paola
|
|
2008
|
74 |
5 |
p. 671-696
26 p.
|
article
|
| 18 |
Simultaneous matchings: Hardness and approximation
|
Kutz, Martin
|
|
2008
|
74 |
5 |
p. 884-897
14 p.
|
article
|
| 19 |
The gap in circumventing the impossibility of consensus
|
Guerraoui, Rachid
|
|
2008
|
74 |
5 |
p. 823-830
8 p.
|
article
|
| 20 |
Tight approximation algorithm for connectivity augmentation problems
|
Kortsarz, Guy
|
|
2008
|
74 |
5 |
p. 662-670
9 p.
|
article
|
Journal description