Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints | Algorithmica |
| 12 | 2019 |
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints | Algorithmica |
| 9 | 2017 |
Improved algorithms for optimal length resolution refutation in difference constraint systems | Formal Aspects of Computing |
| 7 | 2013 |
Optimal Length Resolution Refutations of Difference Constraint Systems | Journal of Automated Reasoning |
| 17 | 2009 |
A new approach to dynamic all pairs shortest paths | Journal of the ACM |
| 71 | 2004 |