On the public citation graph
Largestj-simplices inn-polytopes
0 signed · 82 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/978-3-642-74862-2openalex-snapshot
Operations Research Proceedings 1988
inferredcites →https://doi.org/10.1007/978-3-642-74862-2_61openalex-snapshot
On the 0–1-Maximization of Positive Definite Quadratic Forms
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-94-011-0924-6_17openalex-snapshot
On the Complexity of Some Basic Problems in Computational Convexity
inferredcites →https://doi.org/10.1007/bf01391471openalex-snapshot
Die meisten konvexen K�rper sind glatt, aber nicht zu glatt
inferredcites →https://doi.org/10.1007/bf01459822openalex-snapshot
Some new results on smoothness and rotundity in normed linear spaces
inferredcites →https://doi.org/10.1007/bf01581081openalex-snapshot
Deciding uniqueness in norm maximization
inferredcites →https://doi.org/10.1007/bf01581243openalex-snapshot
Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces
inferredcites →https://doi.org/10.1007/bf01707721openalex-snapshot
Vorlesungen über Differentialgeometrie
inferredcites →https://doi.org/10.1007/bf02123011openalex-snapshot
Computational complexity of norm-maximization
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1016/0012-365x(94)00111-uopenalex-snapshot
On the complexity of some basic problems in computational convexity: I. Containment problems
inferredcites →https://doi.org/10.1016/0020-0190(79)90023-1openalex-snapshot
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
inferredcites →https://doi.org/10.1016/0024-3795(95)00541-2openalex-snapshot
Largest j-simplices in d-cubes: Some relatives of the hadamard maximum determinant problem
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0166-218x(93)e0123-gopenalex-snapshot
A random polynomial time algorithm for well-rounding convex bodies
inferredcites →https://doi.org/10.1016/0196-6774(85)90005-7openalex-snapshot
Finding the smallest triangles containing a given convex polygon
inferredcites →https://doi.org/10.1016/0196-6774(86)90007-6openalex-snapshot
An optimal algorithm for finding minimal enclosing triangles
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferredcites →https://doi.org/10.1017/s0305004100026542openalex-snapshot
An extremal property of the hypersphere
inferredcites →https://doi.org/10.1038/125266a0openalex-snapshot
An Introduction to the Geometry of N Dimensions
inferredcites →https://doi.org/10.1090/psapm/044/1141926openalex-snapshot
Computing the volume of convex bodies: a case where randomness provably helps
inferredcites →https://doi.org/10.1109/sfcs.1979.28openalex-snapshot
On a general method for maximizing and minimizing among certain geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1993.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1112/s0025579300005763openalex-snapshot
On maximal simplices inscribed in a central convex set
inferredcites →https://doi.org/10.1137/0607036openalex-snapshot
Hard Enumeration Problems in Geometry and Combinatorics
inferredcites →https://doi.org/10.1142/s0218195992000123openalex-snapshot
A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
inferredcites →https://doi.org/10.1145/103418.103439openalex-snapshot
Sampling and integration of near log-concave functions
inferredcites →https://doi.org/10.1145/12130.12173openalex-snapshot
Further applications of random sampling to computational geometry
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/800113.803625openalex-snapshot
Some complexity results for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.2140/pjm.1969.31.795openalex-snapshot
The content of some extreme simplexes
inferredcites →https://doi.org/10.2307/2301616openalex-snapshot
An Introduction to the Geometry of n Dimensions.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.1997.2789openalex-snapshot
Maximalj-Simplices in the Reald-Dimensional Unit Cube
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_14openalex-snapshot
Maximum Dispersion and Geometric Maximum Weight Cliques
inferred← citeshttps://doi.org/10.1007/978-3-540-37522-7_5openalex-snapshot
On the Mathematics of Semantic Spaces
inferred← citeshttps://doi.org/10.1007/jhep09(2025)127openalex-snapshot
The computational complexity of the Weak Gravity Conjecture
inferred← citeshttps://doi.org/10.1007/s00453-003-1074-xopenalex-snapshot
Maximum Dispersion and Geometric Maximum Weight Cliques
inferred← citeshttps://doi.org/10.1007/s00453-011-9582-6openalex-snapshot
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
inferred← citeshttps://doi.org/10.1007/s00453-023-01205-0openalex-snapshot
On the Parameterized Intractability of Determinant Maximization
inferred← citeshttps://doi.org/10.1007/s00453-026-01373-9openalex-snapshot
Convex relaxation for the generalized maximum-entropy sampling problem
inferred← citeshttps://doi.org/10.1007/s00454-002-0745-8openalex-snapshot
NP -Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes
inferred← citeshttps://doi.org/10.1007/s10958-008-9144-xopenalex-snapshot
Approximation of convex sets by polytopes
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/0024-3795(95)00541-2openalex-snapshot
Largest j-simplices in d-cubes: Some relatives of the hadamard maximum determinant problem
inferred← citeshttps://doi.org/10.1016/j.cad.2011.06.026openalex-snapshot
Efficient simplex computation for fixture layout design
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.006openalex-snapshot
Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope
inferred← citeshttps://doi.org/10.1016/j.laa.2020.02.010openalex-snapshot
On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00226-9openalex-snapshot
Polynomial-time approximation of largest simplices in V -polytopes
inferred← citeshttps://doi.org/10.1088/0305-4470/36/7/103openalex-snapshot
Entropy and Hadamard matrices
inferred← citeshttps://doi.org/10.1090/s0273-0979-05-01050-5openalex-snapshot
What is known about unit cubes
inferred← citeshttps://doi.org/10.1109/cvpr52688.2022.00690openalex-snapshot
SimT: Handling Open-set Noise for Domain Adaptive Semantic Segmentation
inferred← citeshttps://doi.org/10.1109/focs.2017.98openalex-snapshot
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration
inferred← citeshttps://doi.org/10.1109/tgrs.2015.2424719openalex-snapshot
Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No-Pure-Pixel Case
inferred← citeshttps://doi.org/10.1109/tgrs.2024.3402127openalex-snapshot
DLC: Dynamic Loss Correction for Cross-Domain Remotely Sensed Segmentation
inferred← citeshttps://doi.org/10.1109/tip.2020.2974062openalex-snapshot
Spectral Variability Aware Blind Hyperspectral Image Unmixing Based on Convex Geometry
inferred← citeshttps://doi.org/10.1109/tpami.2023.3246392openalex-snapshot
Handling Open-Set Noise and Novel Target Recognition in Domain Adaptive Semantic Segmentation
inferred← citeshttps://doi.org/10.1109/tsp.2016.2602800openalex-snapshot
Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
inferred← citeshttps://doi.org/10.1109/tsp.2021.3133690openalex-snapshot
Probabilistic Simplex Component Analysis
inferred← citeshttps://doi.org/10.1112/s1461157012001179openalex-snapshot
Computing zeta functions of nondegenerate hypersurfaces with few monomials
inferred← citeshttps://doi.org/10.1137/1.9781611973730.23openalex-snapshot
On largest volume simplices and sub-determinants
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/18m1209854openalex-snapshot
Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
inferred← citeshttps://doi.org/10.1137/25m1799684openalex-snapshot
Turning Big Data Into Tiny Data: Coresets for Unsupervised Learning Problems
inferred← citeshttps://doi.org/10.1137/s0097539794278384openalex-snapshot
On The Complexity of Computing Mixed Volumes
inferred← citeshttps://doi.org/10.1145/1839778.1839789openalex-snapshot
Efficient simplex computation for fixture layout design
inferred← citeshttps://doi.org/10.1145/2746539.2746628openalex-snapshot
Randomized Rounding for the Largest Simplex Problem
inferred← citeshttps://doi.org/10.1145/2897518.2897649openalex-snapshot
Maximizing determinants under partition constraints
inferred← citeshttps://doi.org/10.18653/v1/2021.acl-long.512openalex-snapshot
Determinantal Beam Search
inferred← citeshttps://doi.org/10.48550/arxiv.1006.4349openalex-snapshot
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
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.cs/0310037openalex-snapshot
Maximum dispersion and geometric maximum weight cliques
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.