The NP-completeness column: An ongoing guide

This publication has 21 references indexed in Scilit:

• Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete
  SIAM Journal on Computing, 1987
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• The monotone circuit complexity of boolean functions
  Combinatorica, 1987
• Hamiltonian circuits in interval graph generalizations
  Information Processing Letters, 1986
• Bounds for Width Two Branching Programs
  SIAM Journal on Computing, 1986
• Domination in permutation graphs
  Journal of Algorithms, 1985
• An algorithm for covering polygons with rectangles
  Information and Control, 1984
• Clustering and domination in perfect graphs
  Discrete Applied Mathematics, 1984
• Covering Regions by Rectangles
  SIAM Journal on Algebraic Discrete Methods, 1981
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
  SIAM Journal on Computing, 1975