Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
10.3233/SAT190030 | 2007 | |||
A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling | The Computer Journal |
| 7 | 2005 |
An Analysis of Totally Clairvoyant Scheduling | Journal of Scheduling |
| 8 | 2005 |
A new approach to dynamic all pairs shortest paths | Journal of the ACM |
| 71 | 2004 |
On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries | Mathematical Logic Quarterly |
| 9 | 2004 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Farkas Bounds on Horn Constraint Systems | Theory of Computing Systems |
| 2024 | |
Arc-dependent networks: theoretical insights and a computational study | Annals of Operations Research |
| 2024 | |
Unit Read-once Refutations for Systems of Difference Constraints | Theory of Computing Systems |
| 2023 | |
Optimal length cutting plane refutations of integer programs | Discrete Optimization |
| 2023 | |
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling | Algorithmica |
| 2022 |