On the public citation graph
On the complexity of four polyhedral set containment problems
0 signed · 83 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-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01583784openalex-snapshot
Optimal scaling of balls and polyhedra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6050openalex-snapshot
A task‐based approach to parallel parametric linear programming solving, and application to polyhedral computations
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_6openalex-snapshot
Intersection Cuts for Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_10openalex-snapshot
On the Implementation and Strengthening of Intersection Cuts for QCQPs
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_30openalex-snapshot
Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_3openalex-snapshot
Linear Inequalities and Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_7openalex-snapshot
Valid Inequalities for Structured Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_8openalex-snapshot
Reformulations and Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-319-70566-8_30openalex-snapshot
Some Recent Developments in Spectrahedral Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_2openalex-snapshot
Some Algorithmic Problems in Polytope Theory
inferred← citeshttps://doi.org/10.1007/bf00119988openalex-snapshot
Mathematical programs with a two-dimensional reverse convex constraint
inferred← citeshttps://doi.org/10.1007/bf01099268openalex-snapshot
Linear programs with an additional rank two reverse convex constraint
inferred← citeshttps://doi.org/10.1007/bf01416243openalex-snapshot
Novel approaches to the discrimination problem
inferred← citeshttps://doi.org/10.1007/bf01581243openalex-snapshot
Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces
inferred← citeshttps://doi.org/10.1007/bf01581278openalex-snapshot
D.c. sets, d.c. functions and nonlinear equations
inferred← citeshttps://doi.org/10.1007/bf01582144openalex-snapshot
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
inferred← citeshttps://doi.org/10.1007/bf02123011openalex-snapshot
Computational complexity of norm-maximization
inferred← citeshttps://doi.org/10.1007/jhep09(2025)127openalex-snapshot
The computational complexity of the Weak Gravity Conjecture
inferred← citeshttps://doi.org/10.1007/pl00009300openalex-snapshot
On Helly's Theorem: Algorithms and Extensions
inferred← citeshttps://doi.org/10.1007/s00373-013-1299-7openalex-snapshot
Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/s00454-008-9097-3openalex-snapshot
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
inferred← citeshttps://doi.org/10.1007/s10107-014-0799-4openalex-snapshot
A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
inferred← citeshttps://doi.org/10.1007/s10107-020-01484-3openalex-snapshot
Outer-product-free sets for polynomial optimization and oracle-based cuts
inferred← citeshttps://doi.org/10.1007/s10107-022-01808-5openalex-snapshot
On the implementation and strengthening of intersection cuts for QCQPs
inferred← citeshttps://doi.org/10.1007/s10957-020-01762-2openalex-snapshot
Is a Finite Intersection of Balls Covered by a Finite Union of Balls in Euclidean Spaces?
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00111-uopenalex-snapshot
On the complexity of some basic problems in computational convexity: I. Containment problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-89597-4.50008-1openalex-snapshot
Finite Packing and Covering
inferred← citeshttps://doi.org/10.1016/j.amc.2012.03.014openalex-snapshot
Spherical coverage verification
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.07.004openalex-snapshot
On a cone covering problem
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.006openalex-snapshot
Colorful linear programming, Nash equilibrium, and pivots
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.024openalex-snapshot
Restricted risk measures and robust optimization
inferred← citeshttps://doi.org/10.1016/j.engappai.2008.05.012openalex-snapshot
Convex sets as prototypes for classifying patterns
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.08.006openalex-snapshot
Convex hulls, oracles, and homology
inferred← citeshttps://doi.org/10.1016/j.laa.2013.08.009openalex-snapshot
Which nonnegative matrices are slack matrices?
inferred← citeshttps://doi.org/10.1016/j.robot.2026.105522openalex-snapshot
GEO-SAT: A new approach for knowledge-based agent decision making
inferred← citeshttps://doi.org/10.1016/s0925-7721(03)00048-8openalex-snapshot
Inner and outer approximations of polytopes using boxes
inferred← citeshttps://doi.org/10.1023/a:1021207718605openalex-snapshot
Set Containment Characterization
inferred← citeshttps://doi.org/10.1080/01621459.2022.2089574openalex-snapshot
Learning Topic Models: Identifiability and Finite-Sample Analysis
inferred← citeshttps://doi.org/10.1080/24725854.2025.2477690openalex-snapshot
Capacity representation in sales and operations planning: Aggregation through projection
inferred← citeshttps://doi.org/10.1088/1742-6596/36/1/014openalex-snapshot
Quantum marginal problem and N-representability
inferred← citeshttps://doi.org/10.1090/crmp/048/02openalex-snapshot
Generating vertices of polyhedra and related problems of monotone generation
inferred← citeshttps://doi.org/10.1098/rsif.2015.0881openalex-snapshot
Ordering structured populations in multiplayer cooperation games
inferred← citeshttps://doi.org/10.1109/cdc.2014.7040158openalex-snapshot
Lipschitz robust control from off-policy trajectories
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029363openalex-snapshot
Linear Encodings for Polytope Containment Problems
inferred← citeshttps://doi.org/10.1109/lsp.2024.3411521openalex-snapshot
Checking the Sufficiently Scattered Condition Using a Global Non-Convex Optimization Software
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743451openalex-snapshot
Approximation of diameters: randomization doesn't help
inferred← citeshttps://doi.org/10.1109/tac.2022.3211959openalex-snapshot
Exact Computation of Maximal Invariant Sets for Safe Markov Chains—Lattice Theoretic Approach
inferred← citeshttps://doi.org/10.1109/tsp.2013.2285514openalex-snapshot
Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
inferred← citeshttps://doi.org/10.1112/s0025579300014364openalex-snapshot
Deterministic and randomized polynomial‐time approximation of radii
inferred← citeshttps://doi.org/10.1112/s0025579314000291openalex-snapshot
SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES
inferred← citeshttps://doi.org/10.1137/120867263openalex-snapshot
Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes
inferred← citeshttps://doi.org/10.1137/120874898openalex-snapshot
Containment Problems for Polytopes and Spectrahedra
inferred← citeshttps://doi.org/10.1137/140971634openalex-snapshot
A Semidefinite Hierarchy for Containment of Spectrahedra
inferred← citeshttps://doi.org/10.1137/15m1013341openalex-snapshot
Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes
inferred← citeshttps://doi.org/10.1137/18m1203183openalex-snapshot
A Matrix Positivstellensatz with Lifting Polynomials
inferred← citeshttps://doi.org/10.1137/s1052623497329245openalex-snapshot
Polyhedral Boundary Projection
inferred← citeshttps://doi.org/10.1145/1377676.1377707openalex-snapshot
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
inferred← citeshttps://doi.org/10.1145/3173127.3173138openalex-snapshot
Computational Geometry Column 66
inferred← citeshttps://doi.org/10.1287/deca.2019.0389openalex-snapshot
Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1092openalex-snapshot
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
inferred← citeshttps://doi.org/10.1287/moor.2014.0689openalex-snapshot
Tight Approximations of Dynamic Risk Measures
inferred← citeshttps://doi.org/10.1287/moor.28.4.625.20509openalex-snapshot
On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
inferred← citeshttps://doi.org/10.1287/opre.2021.2156openalex-snapshot
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming
inferred← citeshttps://doi.org/10.15807/jorsj.50.14openalex-snapshot
OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a12openalex-snapshot
Computational Aspects of the Hausdorff Distance in Unbounded Dimension
inferred← citeshttps://doi.org/10.22028/d291-25948openalex-snapshot
Complexity of some polyhedral enumeration problems
inferred← citeshttps://doi.org/10.3389/fphys.2013.00190openalex-snapshot
Plurigon: three dimensional visualization and classification of high-dimensionality data
inferred← citeshttps://doi.org/10.3929/ethz-a-004448632openalex-snapshot
Quadratic programming in geometric optimization: theory, implementation, and applications
inferred← citeshttps://doi.org/10.48550/arxiv.0802.4008openalex-snapshot
Dynamic symmetry approach to entanglement
inferred← citeshttps://doi.org/10.48550/arxiv.0804.4150openalex-snapshot
On Computing the Shadows and Slices of Polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1101.3027openalex-snapshot
Sparse Recovery, Kashin Decomposition and Conic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1109.2361openalex-snapshot
Spherical coverage verification
inferred← citeshttps://doi.org/10.48550/arxiv.1303.5670openalex-snapshot
Which Nonnegative Matrices Are Slack Matrices?
inferred← citeshttps://doi.org/10.48550/arxiv.1509.02735openalex-snapshot
Containment Problems for Projections of Polyhedra and Spectrahedra
inferred← citeshttps://doi.org/10.48550/arxiv.1603.03634openalex-snapshot
A Semidefinite Hierarchy for Disjointly Constrained Multilinear Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01072openalex-snapshot
Empirical Studies on the Properties of Linear Regions in Deep Neural Networks
inferred← citeshttps://doi.org/10.70675/2dc95cfazb8d5z44e4zb281z08798d42cad9openalex-snapshot
Parallel algorithms for tracking of particles
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.