Integer points in the degree-sequence polytope
From MaRDI portal
Cites work
- A remark on the existence of finite graphs
- Degree Sequences in Complexes and Hypergraphs
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 17664 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Hypergraphic degree sequences are hard
- Nonconvexity of the set of hypergraph degree sequences
- On Integer Programming, Discrepancy, and Convolution
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the complexity of k-SAT
- On the complexity of integer programming
- On the sphere problem
- Optimization over degree sequences
- Parameterized algorithms
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Scheduling meets n-fold integer programming
- Some NP-complete problems for hypergraph degree sequences
- The complexity of computing the permanent
- The polytope of degree sequences of hypergraphs
- Tight complexity lower bounds for integer linear programming with few constraints
This page was built for publication: Integer points in the degree-sequence polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962505)
