Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discrete Applied Mathematics, 305:272-294, 2021. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI ConstraintsPiotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. faw 2018: 300-314 [doi] A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI ConstraintsK. Subramani, Piotr Wojciechowki. algorithmica, 81(7):2765-2794, 2019. [doi] Optimal Length Resolution Refutations of Difference Constraint SystemsK. Subramani. JAR, 43(2):121-137, 2009. [doi] Read-Once Certification of Linear Infeasibility in UTVPI ConstraintsK. Subramani, Piotr J. Wojciechowski. tamc 2019: 578-593 [doi]
The following publications are possibly variants of this publication: