Degenerate convex hulls in high dimensions without extra storage
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
How good are convex hull algorithms?
Proceedings of the eleventh annual symposium on Computational geometry
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Shadows and slices of polytopes
Proceedings of the twelfth annual symposium on Computational geometry
Enumeration of regular triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Primal-dual methods for vertex and facet enumeration (preliminary version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem
Computational Optimization and Applications
Exact arithmetic at low cost—a case study in linear programming
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Certified computation of the sign of a matrix determinant
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polymake: an approach to modular software design in computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Error control in polytope computations
Journal of Optimization Theory and Applications
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
On local transformation of polygons with visibility properties
Theoretical Computer Science
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the hardness of minkowski addition and related operations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Information Processing Letters
Computational Geometry: Theory and Applications
Pattern search in the presence of degenerate linear constraints
Optimization Methods & Software
Credal networks for military identification problems
International Journal of Approximate Reasoning
Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure
Journal of Computational and Applied Mathematics
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
Discrete Applied Mathematics
Estimation of surface area and surface area measure of three-dimensional sets from digitizations
Image and Vision Computing
Listing vertices of simple polyhedra associated with dual LI (2) systems
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
How bad is single-path routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Credal sets approximation by lower probabilities: application to credal networks
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Traversing symmetric polyhedral fans
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Using redundant constraints for refinement
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
An Algorithm to Find the Lineality Space of the Positive Hull of a Set of Vectors
Journal of Mathematical Modelling and Algorithms
On the Occurrence Probability of Local Binary Patterns: A Theoretical Study
Journal of Mathematical Imaging and Vision
Optimal solutions for the balanced minimum evolution problem
Computers and Operations Research
Ranking with uncertain scoring functions: semantics and sensitivity measures
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Proceedings of the twenty-seventh annual symposium on Computational geometry
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry
Bell inequalities and entanglement
Quantum Information & Computation
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
A presentation of the gfan software
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Enumerating non-crossing minimally rigid frameworks
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A reverse search algorithm for the neighborhood problem
Operations Research Letters
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
Enumerating constrained non-crossing geometric spanning trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Enumerating trichromatic triangles containing the origin in linear time
Journal of Discrete Algorithms
Computing the bounded subcomplex of an unbounded polyhedron
Computational Geometry: Theory and Applications
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
a-tint: A polymake extension for algorithmic tropical intersection theory
European Journal of Combinatorics
| Hi-index | 0.00 |