The following publications are possibly variants of this publication:
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulasK. Subramani, Piotr J. Wojciechowski. AMAI, 90(1):3-29, 2022. [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]
- The Complexity of Read-Once ResolutionHans Kleine Büning, Xishun Zhao. AMAI, 36(4):419-435, 2002.
- Finding read-once refutations in 2CNF formulas and variants - a parameterized perspectiveK. Subramani, Piotr J. Wojciechowski. isaim 2018: [doi]
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systemsK. Subramani, Piotr J. Wojciechowski. TCS, 883:1-18, 2021. [doi]
- On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint SystemsK. Subramani, Piotr J. Wojciechowski. tamc 2022: 293-304 [doi]
- On Unit Read-Once Resolutions and Copy ComplexityPiotr J. Wojciechowski, K. Subramani. cocoa 2020: 273-288 [doi]