Volume 64, Issue 2 | Algorithmica

Search all Algorithmica articles

Volume 64, Issue 2

October 2012

Special Issue: Computing and Combinatorics

Issue Editor:

My T. Thai

7 articles in this issue

Guest Editorial: Computing and Combinatorics
My T. Thai
EditorialNotes 13 April 2012 Pages: 213 - 214
Shorthand Universal Cycles for Permutations
Alexander E. Holroyd
Frank Ruskey
Aaron Williams
OriginalPaper 13 July 2011 Pages: 215 - 245
Zero-Knowledge Argument for Simultaneous Discrete Logarithms
Sherman S. M. Chow
Changshe Ma
Jian Weng
OriginalPaper 29 November 2011 Pages: 246 - 266
Tile-Packing Tomography Is \(\mathbb{NP}\)-hard
Marek Chrobak
Christoph Dürr
Nguyen Kim Thang
OriginalPaper Open access 19 February 2011 Pages: 267 - 278
Counting Paths in VPA Is Complete for #NC ¹
Andreas Krebs
Nutan Limaye
Meena Mahajan
OriginalPaper 16 March 2011 Pages: 279 - 294
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman
Marek Karpinski
Andrzej Lingas
OriginalPaper 16 November 2011 Pages: 295 - 310
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
Doron Nussbaum
Shuye Pu
Hamid Zarrabi-Zadeh
OriginalPaper 06 January 2011 Pages: 311 - 325