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