The following publications are possibly variants of this publication:
- Improved algorithms for optimal length resolution refutation in difference constraint systemsK. Subramani, Matthew Williamson, Xiaofeng Gu. fac, 25(2):319-341, 2013. [doi]
- Unit Refutations of Difference Constraint SystemsK. Subramani, Piotr Wojciechowski 0001. ecai 2023: 2226-2233 [doi]
- Unit Read-once Refutations for Systems of Difference ConstraintsK. Subramani, Piotr Wojciechowski 0002. mst, 67(4):877-899, August 2023. [doi]
- Optimal length tree-like resolution refutations for 2SAT formulasK. Subramani. tocl, 5(2):316-320, 2004. [doi]
- Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI ConstraintsPiotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. faw 2018: 300-314 [doi]
- Analyzing Unit Read-Once Refutations in Difference Constraint SystemsK. Subramani, Piotr J. Wojciechowski. jelia 2021: 147-161 [doi]
- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint SystemsBugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr J. Wojciechowski. caldam 2018: 45-58 [doi]
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraintsPiotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. DAM, 305:272-294, 2021. [doi]
- Optimal length cutting plane refutations of integer programsK. Subramani, Piotr Wojciechowski 0002. disopt, 50:100806, November 2023. [doi]
- Optimal Length Cutting Plane Refutations of Integer ProgramsK. Subramani, Piotr Wojciechowski 0002. caldam 2023: 15-27 [doi]