The following publications are possibly variants of this publication:
- A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI ConstraintsK. Subramani, Piotr Wojciechowki. algorithmica, 81(7):2765-2794, 2019. [doi]
- A Graphical Analysis of Integer Infeasibility in UTVPI ConstraintsK. Subramani, Piotr J. Wojciechowski. aiia 2019: 223-234 [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]
- 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]