Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the Chvátal Rank of Certain Inequalities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Mathematics of Operations Research
Note: On the Chvátal rank of the Pigeonhole Principle
Theoretical Computer Science
Integer Polyhedra for Program Analysis
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
On the linear ranking problem for integer linear-constraint loops
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |