The computational complexity of knot and link problems
Journal of the ACM (JACM)
A new bound for the Carathéodory rank of the bases of a matroid
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Theoretical Computer Science
On greedy bases packing in matroids
European Journal of Combinatorics
An Introduction to Empty Lattice Simplices
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Non-standard approaches to integer programming
Discrete Applied Mathematics
Improved bound for the Carathéodory rank of the bases of a matroid
Journal of Combinatorial Theory Series B
Characterizations of Total Dual Integrality
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
The combinatorics of modeling and analyzing biological systems
Natural Computing: an international journal
Polyhedra with the Integer Carathéodory Property
Journal of Combinatorial Theory Series B
Basis of solutions for a system of linear inequalities in integers: computation and applications
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On test sets for nonlinear integer maximization
Operations Research Letters
Carathéodory bounds for integer cones
Operations Research Letters
| Hi-index | 0.00 |