Cited in
(only showing first 100 items - show all)- Integer Points in Polyhedra — Geometry, Number Theory, Algebra, Optimization
- MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Computations of volumes and Ehrhart series in four candidates elections
- A chaotic lattice field theory in one dimension
- Computing rational powers of monomial ideals
- The combinatorics of interval vector polytopes
- Exact sampling and counting for fixed-margin matrices
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Armchair or Zigzag? A tool for characterizing graphene edge
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Quantifying software reliability via model-counting
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Pattern-avoiding polytopes
- Exploiting polyhedral symmetries in social choice
- Petri Net Reductions for Counting Markings
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Polyhedral star-shaped distributions
- On the enumeration of certain weighted graphs
- Using invariants for phylogenetic tree construction
- Computing points of bounded height in projective space over a number field
- Ehrhart tensor polynomials
- On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts
- Column basis reduction and decomposable knapsack problems
- Sparsity in sums of squares of polynomials
- Computing algebraic numbers of bounded height
- Compactifications of rational maps, and the implicit equations of their images
- Roots of Ehrhart polynomials arising from graphs
- Algebraic combinatorics of diametric magic circles
- Topics in hyperplane arrangements, polytopes and box-splines
- Sparse representation of vectors in lattices and semigroups
- Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
- Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
- The complexity of generating functions for integer points in polyhedra and beyond
- Polymake and Lattice Polytopes
- Implicitization of curves and (hyper)surfaces using predicted support
- Quantitative static analysis of communication protocols using abstract Markov chains
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- On the complexity of computing Kronecker coefficients
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Polynomial time reachability analysis in discrete state chemical reaction networks obeying conservation laws
- Integer Polynomial Optimization in Fixed Dimension
- Representation-compatible power indices
- Volume computation for polytopes and partition functions for classical root systems
- Counting integral points in polytopes via numerical analysis of contour integration
- Enumeration of Totally Real Number Fields of Bounded Root Discriminant
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections
- Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
- Local Euler-Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of a rational polytope
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- Computing the integer programming gap
- An extension of Wilf's conjecture to affine semigroups
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- The partial-fractions method for counting solutions to integral linear systems
- Enumerating projections of integer points in unbounded polyhedra
- An example of probability computations under the IAC assumption: the stability of scoring rules
- Rational generating functions and integer programming games
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Computing the integer hull of convex polyhedral sets
- Computing convex hulls and counting integer points with \texttt{polymake}
- The probability of majority inversion in a two-stage voting system with three states
- cdd
- FEXACT
- Normaliz
- polymake
- AS 51
- lp_solve
- JavaView
- lpSolve
- 4ti2
- cddplus
- azove
- lrs
- barvinok
- ELIAS
- TOPCOM
- TRIP
- Mgfun
- PARTITIONS
- Unimodularity
- Convex
- PrefLib
- CaTS
- RunLim
- NZMATH
- PermLib
- PolyLib
- edgecount
- SymPol
- Omega
- Nauty
- Polyhedra
- SMAPO
- Unimodularity Test
- Cobra
- AS 144
- AS 159
- Zeta
This page was built for software: LattE
