Volume 5; Issue 4

ACM Transactions on Algorithms

Volume 5; Issue 4
1

A better approximation ratio for the vertex cover problem

Karakostas, George
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 88 KB
english, 2009
2

A linear algorithm for computing convex hulls for random lines

Berend, Daniel, Braverman, Vladimir
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 680 KB
english, 2009
4

A generalized minimum cost k -clustering

Levin, Asaf
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 100 KB
english, 2009
6

All maximal independent sets and dynamic dominance for sparse graphs

Eppstein, David
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 107 KB
english, 2009
7

Enumeration of isolated cliques and pseudo-cliques

Ito, Hiro, Iwama, Kazuo
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 293 KB
english, 2009
8

Randomized fast design of short DNA words

Kao, Ming-Yang, Sanghi, Manan, Schweller, Robert
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 690 KB
english, 2009
9

Parametric analysis for ungapped Markov models of evolution

Fernández-Baca, David, Venkatachalam, Balaji
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 179 KB
english, 2009
11

A linear-time algorithm to find a separator in a graph excluding a minor

Reed, Bruce, Wood, David R.
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 3.76 MB
english, 2009
13

Low-dimensional lattice basis reduction revisited

Nguyen, Phong Q., Stehlé, Damien
Journal:
ACM Transactions on Algorithms
Year:
2009
Language:
english
File:
PDF, 813 KB
english, 2009