Journals in DBLP

Discrete Applied Mathematics
2007, volume: 155, number: 12

1. Henry A. Kautz, Bart Selman
   The state of SAT. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1514-1524 [Journal]
   
2. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
   The unsatisfiability threshold revisited. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1525-1538 [Journal]
   
3. Ilya Shlyakhter
   Generating effective symmetry-breaking predicates for search problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1539-1548 [Journal]
   
4. Eugene Goldberg, Yakov Novikov
   BerkMin: A fast and robust Sat-solver. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1549-1561 [Journal]
   
5. Brian C. Williams, Robert J. Ragno
   Conflict-directed A^* and its role in model-based embedded systems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1562-1595 [Journal]
   
6. Kazuo Iwama, Suguru Tamaki
   Exploiting partial knowledge of satisfying assignments. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1596-1603 [Journal]
   
7. Inês Lynce, João P. Marques Silva
   Random backtracking in backtrack search algorithms for satisfiability. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1604-1612 [Journal]
   
8. Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes
   Regular-SAT: A many-valued approach to solving combinatorial problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1613-1626 [Journal]
   
9. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
   Phase transitions of PP-complete satisfiability problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:12, pp:1627-1639 [Journal]