J. Algorithms

Keyphrases

Publications

volume 64, number 1, 2009

volume 64, number 2-3, 2009

volume 64, number 4, 2009

volume 63, number 1-3, 2008

Matti Järvisalo, Ilkka Niemelä
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. J. Algorithms 63 (1-3) (2008)
Luca Di Gaspero, Andrea Roli
Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony. J. Algorithms 63 (1-3) (2008)
Richard J. Wallace, Diarmuid Grimes
Experimental studies of variable selection strategies based on constraint weights. J. Algorithms 63 (1-3) (2008)
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. J. Algorithms 63 (1-3) (2008)
Marco Gavanelli, Toni Mancini
RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion. J. Algorithms 63 (1-3) (2008)
João Marques-Silva
Model checking with Boolean Satisfiability. J. Algorithms 63 (1-3) (2008)
Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. J. Algorithms 63 (1-3) (2008)
Francesco Calimeri, Simona Perri, Francesco Ricca
Experimenting with parallelism for the instantiation of ASP programs. J. Algorithms 63 (1-3) (2008)
Gilles Audemard, Saïd Jabbour, Lakhdar Sais
SAT graph-based representation: A new perspective. J. Algorithms 63 (1-3) (2008)

volume 63, number 4, 2008

Jon Williamson
Objective Bayesian probabilistic logic. J. Algorithms 63 (4) (2008)
Yuriy Brun
Solving satisfiability in the tile assembly model with a constant-size tileset. J. Algorithms 63 (4) (2008)

volume 62, number 1, 2007

Amin Coja-Oghlan
Solving NP-hard semirandom graph problems in polynomial expected time. J. Algorithms 62 (1) (2007)
Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
Computing shortest paths with uncertainty. J. Algorithms 62 (1) (2007)

volume 62, number 2, 2007

volume 62, number 3-4, 2007

volume 61, number 1, 2006

volume 61, number 2, 2006

volume 60, number 1, 2006

volume 60, number 2, 2006

volume 59, number 2, 2006

Zhi-Zhong Chen, Tatsuie Tsukiji
Computing bounded-degree phylogenetic roots of disconnected graphs. J. Algorithms 59 (2) (2006)
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
On generalized gossiping and broadcasting. J. Algorithms 59 (2) (2006)
Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
-tree core problem in a tree network. J. Algorithms 59 (2) (2006)