Volume 67, Issue 2

October 2013

Special Issue: Computing and Combinatorics

Issue Editor:

10 articles in this issue

Editorial Note

Announcement 10 July 2013 Pages: 111 - 111
Derandomizing the HSSW Algorithm for 3-SAT
Kazuhisa Makino
Suguru Tamaki
Masaki Yamamoto
OriginalPaper 10 January 2013 Pages: 112 - 124
Compressed Directed Acyclic Word Graph with Application in Local Alignment
Huy Hoang Do
Wing Kin Sung
OriginalPaper 10 May 2013 Pages: 125 - 141
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
Malte Brinkmeyer
Thasso Griebel
Sebastian Böcker
OriginalPaper 11 October 2012 Pages: 142 - 160
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
Kei Uchizawa
Takanori Aoki
Xiao Zhou
OriginalPaper 26 September 2012 Pages: 161 - 179
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction
Narayan Vikas
OriginalPaper 27 December 2012 Pages: 180 - 206
Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets
Steven M. Kautz
Brad Shutters
OriginalPaper 10 October 2012 Pages: 207 - 233
Approximately Uniform Online Checkpointing with Bounded Memory
Lauri Ahlroth
Olli Pottonen
André Schumacher
OriginalPaper 11 April 2013 Pages: 234 - 246
The Parallel Complexity of Graph Canonization Under Abelian Group Action
V. Arvind
Johannes Köbler
OriginalPaper 27 June 2013 Pages: 247 - 276
On Total Unimodularity of Edge–Edge Adjacency Matrices
Yusuke Matsumoto
Naoyuki Kamiyama
Keiko Imai
OriginalPaper 21 June 2013 Pages: 277 - 292

Search