On the public citation graph
Intersection properties of boxes in R d
0 signed · 39 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/bf01589171openalex-snapshot
Common secants for families of polyhedra
inferredcites →https://doi.org/10.1090/pspum/007/0157289openalex-snapshot
Helly’s theorem and its relatives
inferredcites →https://doi.org/10.1090/s0002-9947-1947-0022686-9openalex-snapshot
Polygons Circumscribed About Closed Convex Curves
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-642-54423-1_27openalex-snapshot
Helly-Type Theorems in Property Testing
inferred← citeshttps://doi.org/10.1007/bf01230330openalex-snapshot
Sets with convex closure which are unions of two starshaped sets and families of segments which have a 2-partition
inferred← citeshttps://doi.org/10.1007/bf01836091openalex-snapshot
j-partitions for visible shorelines
inferred← citeshttps://doi.org/10.1007/bf02783298openalex-snapshot
Intersection properties of boxes. Part I: An upper-bound theorem
inferred← citeshttps://doi.org/10.1007/bfb0054358openalex-snapshot
Constrained square-center problems
inferred← citeshttps://doi.org/10.1007/bfb0070404openalex-snapshot
Food webs, competition graphs, and the boxicity of ecological phase space
inferred← citeshttps://doi.org/10.1007/s00010-014-0294-2openalex-snapshot
Staircase convex results for a certain class of orthogonal polytopes
inferred← citeshttps://doi.org/10.1007/s00454-007-9028-8openalex-snapshot
Discrete and Lexicographic Helly-Type Theorems
inferred← citeshttps://doi.org/10.1007/s10474-018-0817-8openalex-snapshot
A note on the intersection property for flat boxes and boxicity in $${\mathbb{R}^{d}}$$ R d
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00115-iopenalex-snapshot
Niche space, multigraphs, and the Helly condition
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50017-1openalex-snapshot
Helly, Radon, and Carathéodory Type Theorems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.09.007openalex-snapshot
A fractional Helly theorem for boxes
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.026openalex-snapshot
2-piercings via graph theory
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.044openalex-snapshot
Colorful two-piercing theorem for boxes
inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.020openalex-snapshot
About the piercing number of a family of intervals
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111825openalex-snapshot
The geometry and combinatorics of discrete line segment hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112091openalex-snapshot
On Wegner’s inequality for axis-parallel rectangles
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114269openalex-snapshot
Stabbing boxes with finitely many axis-parallel lines and flats
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00336-3openalex-snapshot
Fast stabbing of boxes in high dimensions
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00052-8openalex-snapshot
Discrete rectilinear 2-center problems
inferred← citeshttps://doi.org/10.1080/00029890.1969.12000319openalex-snapshot
Intersection and Covering Properties of Convex Sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0929001-6openalex-snapshot
𝑘-partitions and a characterization for compact unions of 𝑘 starshaped sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1992-1089402-6openalex-snapshot
Illumination for unions of boxes in 𝑅^{𝑑}
inferred← citeshttps://doi.org/10.1090/s0002-9939-96-03806-3openalex-snapshot
On a conjecture of Danzer and Grünbaum
inferred← citeshttps://doi.org/10.1109/focs.2004.47openalex-snapshot
On the Power of Discrete and of Lexicographic Helly-Type Theorems
inferred← citeshttps://doi.org/10.1137/060656309openalex-snapshot
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
inferred← citeshttps://doi.org/10.1142/s0218195918500115openalex-snapshot
Helly-Type Theorems in Property Testing
inferred← citeshttps://doi.org/10.1142/s0218195999000170openalex-snapshot
3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES
inferred← citeshttps://doi.org/10.1145/237218.237255openalex-snapshot
Rectilinear and polygonal p -piercing and p -center problems
inferred← citeshttps://doi.org/10.1145/258726.258828openalex-snapshot
Rectilinear p-piercing problems
inferred← citeshttps://doi.org/10.2140/pjm.1985.120.19openalex-snapshot
A Krasnosel’skiĭ-type theorem for unions of two starshaped sets in the plane
inferred← citeshttps://doi.org/10.48550/arxiv.0706.3405openalex-snapshot
On Point Coverings of Boxes in $\mathbb R^d$
inferred← citeshttps://doi.org/10.48550/arxiv.1412.8190openalex-snapshot
Extremal results on intersection graphs of boxes in $R^d$
inferred← citeshttps://doi.org/10.48550/arxiv.1708.02185openalex-snapshot
A note on the intersection property for flat boxes and boxicity in $\mathbb{R}^d$
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.