Tassos Dimitriou SAT distributions with planted assignments and phase transitions between decision and optimization problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:58-72 [Journal]

András Faragó On the typical case complexity of graph optimization. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:73-88 [Journal]

John V. Franco Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:89-123 [Journal]

Yong Gao, Joseph C. Culberson Resolution complexity of random constraint satisfaction problems: Another half of the story. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:124-140 [Journal]

Gabriel Istrate Threshold properties of random boolean constraint satisfaction problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:141-152 [Journal]

Ulrich Voll A novel giant-subgraph phase-transition in sparse random k-partite graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:153-181 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP