Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Edge-Directions of Standard Polyhedra with Applications to Network Flows
Journal of Global Optimization
Construction of rankings on partial derivatives
ACM Communications in Computer Algebra
On the hardness of minkowski addition and related operations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On the exact maximum complexity of Minkowski sums of convex polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Brief paper: The minimal disturbance invariant set: Outer approximations via its partial sums
Automatica (Journal of IFAC)
Universal characteristic decomposition of radical differential ideals
Journal of Symbolic Computation
Minkowski sums of rotating convex polyhedra
Proceedings of the twenty-fourth annual symposium on Computational geometry
Covering Minkowski sum boundary using points with applications
Computer Aided Geometric Design
A linear equation for Minkowski sums of polytopes relatively in general position
European Journal of Combinatorics
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Brief paper: On feasible sets for MPC and their approximations
Automatica (Journal of IFAC)
Border basis detection is NP-complete
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Signature-based algorithms to compute Gröbner bases
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans
Computer-Aided Design
Minkowski sum based octree generation for triangular meshes
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
The maximum number of faces of the Minkowski sum of two convex polytopes
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Successive linear programs for computing all integral points in a minkowski sum
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
iB4e: a software framework for parametrizing specialized LP problems
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Enumerating a subset of the integer points inside a Minkowski sum
Computational Geometry: Theory and Applications
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
Computer-Aided Design
Complexity of Gröbner basis detection and border basis detection
Theoretical Computer Science
The maximum number of faces of the minkowski sum of three convex polytopes
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.01 |