The following publications are possibly variants of this publication:
- Finding read-once refutations in 2CNF formulas and variants - a parameterized perspectiveK. Subramani, Piotr J. Wojciechowski. isaim 2018: [doi]
- Finding read-once resolution refutations in systems of 2CNF clausesHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. TCS, 729:42-56, 2018. [doi]
- Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint SystemsK. Subramani, Piotr J. Wojciechowski. lfcs 2022: 327-345 [doi]
- On the Computational Complexity of Read once Resolution Decidability in 2CNF FormulasHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. tamc 2017: 362-372 [doi]
- The Complexity of Finding Read-Once NAE-Resolution RefutationsHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. icla 2017: 64-76 [doi]
- Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI ConstraintsK. Subramani, Piotr J. Wojciechowski. cocoa 2024: 377-389 [doi]
- Read-Once Resolutions in Horn FormulasHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. faw 2019: 100-110 [doi]