The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2005, volume: 153, number: 1-3

  1. Lefteris M. Kirousis, E. Kranakisdeg
    Special Issue on Typical Case Complexity and Phase Transitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:1- [Journal]
  2. Adam Beacham, Joseph C. Culberson
    On the complexity of unfrozen problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:3-24 [Journal]
  3. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
    The resolution complexity of random graph k-colorability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:25-47 [Journal]
  4. Nadia Creignou, Hervé Daudé, John V. Franco
    A sharp threshold for the renameable-Horn and the q-Horn properties. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:48-57 [Journal]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002