Journal of Algorithms, Volume 63

Volume 63, Numbers 1-3, January-July 2008

• Marco Gavanelli, Toni Mancini:
  RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion. 1-2
  
• João Marques-Silva:
  Model checking with Boolean Satisfiability. 3-16
  
• Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
  SAT graph-based representation: A new perspective. 17-33
  
• Francesco Calimeri, Simona Perri, Francesco Ricca:
  Experimenting with parallelism for the instantiation of ASP programs. 34-54
  
• Luca Di Gaspero, Andrea Roli:
  Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony. 55-69
  
• Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone:
  Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. 70-89
  
• Matti Järvisalo, Ilkka Niemelä:
  The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. 90-113
  
• Richard J. Wallace, Diarmuid Grimes:
  Experimental studies of variable selection strategies based on constraint weights. 114-129
  
• Meritxell Vinyals, Andrea Giovannucci, Jesús Cerquides, Pedro Meseguer, Juan A. Rodríguez-Aguilar:
  A test suite for the evaluation of mixed multi-unit combinatorial auctions. 130-150
  

Volume 63, Number 4, October 2008

• Yuriy Brun:
  Solving satisfiability in the tile assembly model with a constant-size tileset. 151-166
  
• Jon Williamson:
  Objective Bayesian probabilistic logic. 167-183