On the public citation graph
On integer points in polyhedra
0 signed · 95 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01068924openalex-snapshot
Algebraic approach in integer programming
inferredcites →https://doi.org/10.1007/bf01204716openalex-snapshot
On integer points in polyhedra: A lower bound
inferredcites →https://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferredcites →https://doi.org/10.1007/bf02579233openalex-snapshot
Brick decompositions and the matching rank of graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90067-7openalex-snapshot
The vertices of the knapsack polytope
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0220044openalex-snapshot
On Counting Lattice Points in Polyhedra
inferredcites →https://doi.org/10.1145/102782.102783openalex-snapshot
A random polynomial-time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1145/322139.322141openalex-snapshot
Two Algorithms for Determining Volumes of Convex Polyhedra
inferredcites →https://doi.org/10.1145/322276.322287openalex-snapshot
On the complexity of integer programming
inferredcites →https://doi.org/10.1145/73007.73043openalex-snapshot
A random polynomial time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1287/opre.18.5.940openalex-snapshot
On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/11774938_3openalex-snapshot
The Exact Lattice Width of Planar Sets and Minimal Arithmetical Thickness
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_13openalex-snapshot
An Improved Upper Bound on the Size of Planar Convex-Hulls
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_19openalex-snapshot
On the Complexity of Nonlinear Mixed-Integer Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-85165-1_15openalex-snapshot
On the Pseudo-Periodicity of the Integer Hull of Parametric Convex Polygons
inferred← citeshttps://doi.org/10.1007/978-3-031-14788-3_14openalex-snapshot
Computing the Integer Hull of Convex Polyhedral Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_8openalex-snapshot
From Approximate to Exact Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_1openalex-snapshot
Exact and Approximate High-Multiplicity Scheduling on Identical Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_1openalex-snapshot
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_14openalex-snapshot
Integer Programming and Algorithmic Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_15openalex-snapshot
Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_9openalex-snapshot
Integer Polyhedra for Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-04397-0_5openalex-snapshot
Efficient Lattice Width Computation in Arbitrary Dimension
inferred← citeshttps://doi.org/10.1007/978-94-011-5678-3_24openalex-snapshot
Deciphering Threshold Functions of k -Valued Logic
inferred← citeshttps://doi.org/10.1007/bf01204716openalex-snapshot
On integer points in polyhedra: A lower bound
inferred← citeshttps://doi.org/10.1007/bf02574364openalex-snapshot
Computing the Ehrhart polynomial of a convex lattice polytope
inferred← citeshttps://doi.org/10.1007/jhep06(2018)153openalex-snapshot
Biadjoint scalar tree amplitudes and intersecting dual associahedra
inferred← citeshttps://doi.org/10.1007/s002080050217openalex-snapshot
The convex hull of the integer points in a large ball
inferred← citeshttps://doi.org/10.1007/s00373-016-1683-1openalex-snapshot
On the Number of Irreducible Points in Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-003-0836-1openalex-snapshot
The Randomized Integer Convex Hull
inferred← citeshttps://doi.org/10.1007/s10107-013-0639-yopenalex-snapshot
The triangle closure is a polyhedron
inferred← citeshttps://doi.org/10.1007/s10107-017-1178-8openalex-snapshot
On approximation algorithms for concave mixed-integer quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-022-01907-3openalex-snapshot
An approximation algorithm for indefinite mixed integer quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-024-02084-1openalex-snapshot
From approximate to exact integer programming
inferred← citeshttps://doi.org/10.1007/s10626-013-0159-1openalex-snapshot
Shrinking of Time Petri nets
inferred← citeshttps://doi.org/10.1007/s10851-017-0711-yopenalex-snapshot
About the Decidability of Polyhedral Separability in the Lattice $$\mathbb {Z}^d$$ Z d
inferred← citeshttps://doi.org/10.1007/s10898-022-01165-9openalex-snapshot
On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems
inferred← citeshttps://doi.org/10.1007/s10958-008-9144-xopenalex-snapshot
Approximation of convex sets by polytopes
inferred← citeshttps://doi.org/10.1007/s11590-021-01729-wopenalex-snapshot
How to find the convex hull of all integer points in a polyhedron?
inferred← citeshttps://doi.org/10.1007/s12532-018-0132-yopenalex-snapshot
Intersection cuts for single row corner relaxations
inferred← citeshttps://doi.org/10.1007/s43069-024-00310-2openalex-snapshot
On a Simple Connection Between $$\Delta$$-Modular ILP and LP, and a New Bound on the Number of Integer Vertices
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90058-6openalex-snapshot
On the maximal number of edges of convex digital polygons included into an m × m-grid
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50021-xopenalex-snapshot
10.1016/b978-044488002-4/50021-x
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103820openalex-snapshot
Fair and efficient allocation with few agent types, few item types, or small value levels
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100596openalex-snapshot
Integer programming in parameterized complexity: Five miniatures
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.11.006openalex-snapshot
A Euclid style algorithm for MacMahon's partition analysis
inferred← citeshttps://doi.org/10.1016/j.orl.2015.03.002openalex-snapshot
Note on the complexity of the mixed-integer hull of a polyhedron
inferred← citeshttps://doi.org/10.1016/j.orl.2021.11.005openalex-snapshot
Parameterized complexity of configuration integer programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.009openalex-snapshot
Computing efficiently the lattice width in any dimension
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00348-1openalex-snapshot
Cutting planes in integer and mixed integer programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12004-0openalex-snapshot
Integer Programming, Lattices, and Results in Fixed Dimension
inferred← citeshttps://doi.org/10.1017/9781009701587.004openalex-snapshot
An Algorithmic Theory of Lattice Points in Polyhedra
inferred← citeshttps://doi.org/10.1051/ro/2022198openalex-snapshot
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
inferred← citeshttps://doi.org/10.1090/s0273-0979-08-01210-xopenalex-snapshot
Random points and lattice points in convex bodies
inferred← citeshttps://doi.org/10.1109/focs.2012.43openalex-snapshot
Computing Multiplicities of Lie Group Representations
inferred← citeshttps://doi.org/10.1109/icpr.2008.4761404openalex-snapshot
The lattice width and quasi-straightness in digital spaces
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366830openalex-snapshot
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3379368openalex-snapshot
Distributed-Optimization With Centralized-Refining for Efficient Resource Allocation in Future Wireless Networks
inferred← citeshttps://doi.org/10.1134/s1990478908040157openalex-snapshot
Some estimates for the number of vertices of integer polyhedra
inferred← citeshttps://doi.org/10.1137/0220044openalex-snapshot
On Counting Lattice Points in Polyhedra
inferred← citeshttps://doi.org/10.1137/1.9781611973402.61openalex-snapshot
Polynomiality for Bin Packing with a Constant Number of Item Types
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch118openalex-snapshot
An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra
inferred← citeshttps://doi.org/10.1137/1.9781611974782.103openalex-snapshot
About the Structure of the Integer Cone and its Application to Bin Packing
inferred← citeshttps://doi.org/10.1137/1.9781611976496.3openalex-snapshot
New Bounds for the Vertices of the Integer Hull
inferred← citeshttps://doi.org/10.1137/17m1162792openalex-snapshot
The Support of Integer Optimal Solutions
inferred← citeshttps://doi.org/10.1137/21m139935xopenalex-snapshot
Enumerating Integer Points in Polytopes with Bounded Subdeterminants
inferred← citeshttps://doi.org/10.1145/109648.109666openalex-snapshot
On the convex hull of the integer points in a disc
inferred← citeshttps://doi.org/10.1145/180139.181124openalex-snapshot
Geometrical concept learning and convex polytopes
inferred← citeshttps://doi.org/10.1145/326619.326744openalex-snapshot
Termination of programs in constraint query languages
inferred← citeshttps://doi.org/10.1145/3421750openalex-snapshot
Polynomiality for Bin Packing with a Constant Number of Item Types
inferred← citeshttps://doi.org/10.1287/moor.1080.0320openalex-snapshot
Parametric Integer Programming in Fixed Dimension
inferred← citeshttps://doi.org/10.1287/moor.17.3.608openalex-snapshot
Neighbors of the Origin for Four by Three Matrices
inferred← citeshttps://doi.org/10.1287/moor.2015.0738openalex-snapshot
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
inferred← citeshttps://doi.org/10.1287/moor.26.1.31.10590openalex-snapshot
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
inferred← citeshttps://doi.org/10.1287/moor.26.2.304.10555openalex-snapshot
Cutting Planes and the Elementary Closure in Fixed Dimension
inferred← citeshttps://doi.org/10.15480/882.4138openalex-snapshot
Multitype Integer Monoid Optimization and Applications
inferred← citeshttps://doi.org/10.22028/d291-25909openalex-snapshot
Gomory-Chvátal cutting planes and the elementary closure of Polyhedra
inferred← citeshttps://doi.org/10.23919/ecc55457.2022.9838543openalex-snapshot
Distributed Optimization for Mixed-Integer Consensus in Multi-Agent Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1780openalex-snapshot
The Triangle Closure is a Polyhedron
inferred← citeshttps://doi.org/10.48550/arxiv.1412.2520openalex-snapshot
Note on the Complexity of the Mixed-Integer Hull of a Polyhedron
inferred← citeshttps://doi.org/10.48550/arxiv.math/0611356openalex-snapshot
On the number of vertices in integer linear programming problems
inferred← citeshttps://doi.org/10.53846/goediss-6621openalex-snapshot
Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming
inferred← citeshttps://doi.org/10.5555/314161.314378openalex-snapshot
Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.