1. I. Razgon "Partial matching width and its application to lower bounds for branching programs". (link)
  2. A. Cali, F. Capelli and I. Razgon "Non-FPT lower bounds for structural restrictions of decision DNNF". (link)
  3. O. Lachish and I. Razgon "Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs". (link)
  4. A. Atminas, V. Lozin and I.Razgon "Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation". (link)