On the public citation graph

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

0 signed · 54 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.2000.1727openalex-snapshot
On the Complexity of k-SAT
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/978-3-030-45771-6_20openalex-snapshot
About the Complexity of Two-Stage Stochastic IPs
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/bf02579200openalex-snapshot
An application of simultaneous diophantine approximation in combinatorial optimization
inferredcites →https://doi.org/10.1007/s004530010033openalex-snapshot
Optimal Reconstruction of Graphs under the Additive Model
inferredcites →https://doi.org/10.1007/s10107-011-0490-yopenalex-snapshot
n-Fold integer programming in cubic time
inferredcites →https://doi.org/10.1007/s10107-019-01402-2openalex-snapshot
Combinatorial n-fold integer programming and applications
inferredcites →https://doi.org/10.1007/s10208-005-0174-1openalex-snapshot
Finiteness Theorems in Stochastic Integer Programming
inferredcites →https://doi.org/10.1007/s10951-017-0550-0openalex-snapshot
Scheduling meets n-fold integer programming
inferredcites →https://doi.org/10.1016/0166-218x(84)90081-7openalex-snapshot
A simplified NP-complete satisfiability problem
inferredcites →https://doi.org/10.1016/j.artint.2017.12.006openalex-snapshot
The Complexity Landscape of Decompositional Parameters for ILP
inferredcites →https://doi.org/10.1137/1.9781611975031.178openalex-snapshot
Covering a tree with rooted subtrees – parameterized and approximation algorithms
inferredcites →https://doi.org/10.1137/1.9781611975031.52openalex-snapshot
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
inferredcites →https://doi.org/10.1137/1.9781611975482.3openalex-snapshot
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
inferredcites →https://doi.org/10.1145/322276.322287openalex-snapshot
On the complexity of integer programming
inferredcites →https://doi.org/10.1145/3313906openalex-snapshot
Tight Lower Bounds for the Complexity of Multicoloring
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.24963/ijcai.2018/179openalex-snapshot
Unary Integer Linear Programming with Structural Restrictions
inferredcites →https://doi.org/10.4153/cjm-1966-007-2openalex-snapshot
Determination of a Subset from Certain Combinatorial Properties
inferredcites →https://doi.org/10.4153/cmb-1965-034-2openalex-snapshot
On a Combinatorial Problem in Number Theory
inferredcites →https://doi.org/10.48550/arxiv.1904.01361openalex-snapshot
An Algorithmic Theory of Integer Programming
inferredcites →https://doi.org/10.5555/2875343.2875346openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.5555/3310435.3310438openalex-snapshot
SETH-based lower bounds for subset sum and bicriteria path

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_20openalex-snapshot
About the Complexity of Two-Stage Stochastic IPs
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_14openalex-snapshot
On the Decision Tree Complexity of Threshold Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-77876-7_6openalex-snapshot
An FPTAS for the $\Delta$-modular multidimensional knapsack problem
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-32726-1_9openalex-snapshot
Optimizing Low Dimensional Functions over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_17openalex-snapshot
Tight Lower Bounds for Block-Structured Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_22openalex-snapshot
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_32openalex-snapshot
Space-Efficient Algorithm for Integer Programming with Few Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_8openalex-snapshot
Robust Scheduling on Uniform Machines
inferred← citeshttps://doi.org/10.1007/s10107-022-01837-0openalex-snapshot
The double exponential runtime is tight for 2-stage stochastic ILPs
inferred← citeshttps://doi.org/10.1007/s10107-022-01862-zopenalex-snapshot
Complexity of optimizing over the integers
inferred← citeshttps://doi.org/10.1007/s10107-024-02084-1openalex-snapshot
From approximate to exact integer programming
inferred← citeshttps://doi.org/10.1007/s10107-025-02296-zopenalex-snapshot
Tight lower bounds for block-structured integer programs
inferred← citeshttps://doi.org/10.1007/s10107-026-02341-5openalex-snapshot
(Near)-Optimal algorithms for sparse separable convex integer programs
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.1016/j.disopt.2020.100596openalex-snapshot
Integer programming in parameterized complexity: Five miniatures
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100743openalex-snapshot
Block-structured integer programming: Can we parameterize without the largest coefficient?
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100867openalex-snapshot
Integer points in the degree-sequence polytope
inferred← citeshttps://doi.org/10.1016/j.jpaa.2023.107589openalex-snapshot
Asymptotic behavior of Markov complexity
inferred← citeshttps://doi.org/10.1080/01621459.2024.2310181openalex-snapshot
Markov Bases: A 25 Year Update
inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00031openalex-snapshot
Choco-Q: Commute Hamiltonian-based QAOA for Constrained Binary Optimization
inferred← citeshttps://doi.org/10.1137/1.9781611975031.52openalex-snapshot
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
inferred← citeshttps://doi.org/10.1145/3725843.3756107openalex-snapshot
Rasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems
inferred← citeshttps://doi.org/10.1287/moor.2023.0162openalex-snapshot
Sparse Integer Programming Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.24963/kr.2020/29openalex-snapshot
Fine-Grained Complexity of Temporal Problems
inferred← citeshttps://doi.org/10.3390/a12120248openalex-snapshot
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
inferred← citeshttps://doi.org/10.3390/s24020485openalex-snapshot
Environmental-Driven Approach towards Level 5 Self-Driving
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2024.66openalex-snapshot
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
inferred← citeshttps://doi.org/10.48550/arxiv.1904.01361openalex-snapshot
An Algorithmic Theory of Integer Programming
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.