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.
K. Subramani, Piotr Wojciechowki. A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica, 81(7):2765-2794, 2019. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Read-Once Certification of Linear Infeasibility in UTVPI ConstraintsK. Subramani, Piotr J. Wojciechowski. tamc 2019: 578-593 [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]
The following publications are possibly variants of this publication: