On the public citation graph
Discrete Isoperimetric Problems
0 signed · 76 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.1002/sapm1971502115openalex-snapshot
Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_27openalex-snapshot
A Theorem of Finite Sets
inferredcites →https://doi.org/10.1007/978-94-010-1826-5_11openalex-snapshot
Extremal Problems for Hypergraphs
inferredcites →https://doi.org/10.1016/0097-3165(74)90010-7openalex-snapshot
Inequalities concerning numbers of subsets of a finite set
inferredcites →https://doi.org/10.1016/s0021-9800(66)80034-0openalex-snapshot
On subsets containing a family of non-commensurable subsets of a finite set
inferredcites →https://doi.org/10.1016/s0021-9800(69)80016-5openalex-snapshot
A generalization of a combinatorial theorem of macaulay
inferredcites →https://doi.org/10.1112/plms/s2-26.1.531openalex-snapshot
Some Properties of Enumeration in the Theory of Modular Systems
inferredcites →https://doi.org/10.1145/321832.321838openalex-snapshot
A Combinatorial Problem Related to Multimodule Memory Organizations
inferredcites →https://doi.org/10.1525/9780520319875-014openalex-snapshot
12. The Number of Simplices in a Complex
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4814559openalex-extracted
An Isoperimetric Inequality and Pursuit-Evasion Games on Triangular Grid Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190060302openalex-snapshot
The bandwidth problem for graphs and matrices—a survey
inferred← citeshttps://doi.org/10.1006/eujc.1993.1026openalex-snapshot
Minimally Distant Sets of Lattice Points
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_19openalex-snapshot
On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_83openalex-snapshot
Optimal embedding of a toroidal array in a linear array
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_10openalex-snapshot
Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_41openalex-snapshot
On Minimal-Perimeter Lattice Animals
inferred← citeshttps://doi.org/10.1007/978-3-642-21073-0_19openalex-snapshot
Isoperimetrically Optimal Polygons in the Triangular Grid
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_16openalex-snapshot
Extremal Problems in Partially Ordered Sets
inferred← citeshttps://doi.org/10.1007/bf01275667openalex-snapshot
Edge-isoperimetric inequalities in the grid
inferred← citeshttps://doi.org/10.1007/s00453-022-01008-9openalex-snapshot
Algorithms for Counting Minimum-Perimeter Lattice Animals
inferred← citeshttps://doi.org/10.1007/s00493-003-0033-0openalex-snapshot
Set Systems with few Disjoint Pairs
inferred← citeshttps://doi.org/10.1007/s00493-015-3129-4openalex-snapshot
Counting sets with small sumset and applications
inferred← citeshttps://doi.org/10.1007/s11118-019-09784-wopenalex-snapshot
Asymptotic Estimates for the p-Laplacian on Infinite Graphs with Decaying Initial Data
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90013-0openalex-snapshot
On a problem of Yuzvinsky on separating the n-cube
inferred← citeshttps://doi.org/10.1016/0097-3165(77)90026-7openalex-snapshot
On systems of finite sets with constraints on their unions and intersections
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90021-8openalex-snapshot
Compressions and isoperimetric inequalities
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90022-9openalex-snapshot
Isoperimetric inequalities and fractional set systems
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.019openalex-snapshot
A note on the integrity of grids
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.025openalex-snapshot
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.060openalex-snapshot
The vertex isoperimetric problem for the powers of the diamond graph
inferred← citeshttps://doi.org/10.1016/j.disc.2007.05.014openalex-snapshot
A lower bound for the vertex boundary-width of complete k-ary trees
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.058openalex-snapshot
Antibandwidth and cyclic antibandwidth of meshes and hypercubes
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111902openalex-snapshot
Isoperimetry, stability, and irredundance in direct products
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.003openalex-snapshot
Discrepancies of spanning trees and Hamilton cycles
inferred← citeshttps://doi.org/10.1016/j.matpur.2021.12.010openalex-snapshot
Symmetry breaking in two–dimensional square grids: Persistence and failure of the dimensional crossover
inferred← citeshttps://doi.org/10.1016/j.spa.2018.12.001openalex-snapshot
Tunneling behavior of Ising and Potts models in the low-temperature regime
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.043openalex-snapshot
On isoperimetrically optimal polyforms
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00431-4openalex-snapshot
A local–global principle for vertex-isoperimetric problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00426-2openalex-snapshot
On the complexity of finding a local maximum of functions on discrete planar subsets
inferred← citeshttps://doi.org/10.1017/s0963548303006035openalex-snapshot
On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
inferred← citeshttps://doi.org/10.1017/s0963548397003350openalex-snapshot
Isoperimetric Inequalities for Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.1023/b:supe.0000049323.47732.02openalex-snapshot
Scalarization Using Loop Alignment and Loop Skewing
inferred← citeshttps://doi.org/10.1080/00207160.2012.737914openalex-snapshot
Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
inferred← citeshttps://doi.org/10.1090/proc/16439openalex-snapshot
Isoperimetric stability in lattices
inferred← citeshttps://doi.org/10.1109/pdp.2014.10openalex-snapshot
On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers
inferred← citeshttps://doi.org/10.1112/blms.13122openalex-snapshot
Rearrangement inequalities on the lattice graph
inferred← citeshttps://doi.org/10.1112/jlms.70041openalex-snapshot
On the independence number of sparser random Cayley graphs
inferred← citeshttps://doi.org/10.1137/0403004openalex-snapshot
An Isoperimetric Inequality on the Discrete Torus
inferred← citeshttps://doi.org/10.1137/080715081openalex-snapshot
A Simple Proof of the Karakhanyan–Riordan Theorem on the Even Discrete Torus
inferred← citeshttps://doi.org/10.1137/s0895480100375053openalex-snapshot
Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs
inferred← citeshttps://doi.org/10.1137/s0895480194278234openalex-snapshot
An Ordering on the Even Discrete Torus
inferred← citeshttps://doi.org/10.1142/s0129054112500128openalex-snapshot
VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH
inferred← citeshttps://doi.org/10.1142/s0129054199000216openalex-snapshot
THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS
inferred← citeshttps://doi.org/10.1145/567112.567115openalex-snapshot
Tight bounds on cache use for stencil operations on rectangular grids
inferred← citeshttps://doi.org/10.1214/18-ejp210openalex-snapshot
Metastability of hard-core dynamics on bipartite graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.788.89aopenalex-snapshot
Search for the end of a path in the d-dimensional grid and in other graphs
inferred← citeshttps://doi.org/10.37236/10055openalex-snapshot
Planar Lattice Subsets with Minimal Vertex Boundary
inferred← citeshttps://doi.org/10.37236/10770openalex-snapshot
Minimum-Perimeter Lattice Animals and the Constant-Isomer Conjecture
inferred← citeshttps://doi.org/10.37236/11024openalex-snapshot
On a Characterization of Lattice Cubes via Discrete Isoperimetric Inequalities
inferred← citeshttps://doi.org/10.37236/12133openalex-snapshot
An Extremal Graph Problem on a Grid and an Isoperimetric Problem for Polyominoes
inferred← citeshttps://doi.org/10.37236/2426openalex-snapshot
Vertex Isoperimetric Inequalities for a Family of Graphs on $\mathbb{Z}^k$
inferred← citeshttps://doi.org/10.4064/ba8149-5-2018openalex-snapshot
Minimal growth function of uniform amenability for discrete abelian groups
inferred← citeshttps://doi.org/10.4064/sm230526-15-10openalex-snapshot
Discrete rearrangements and the Pólya–Szegő inequality on graphs
inferred← citeshttps://doi.org/10.4233/uuid:5b9353c1-6d89-4730-b1ff-caca2301ed92openalex-snapshot
On Lattice Methods in Integer Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1201.0697openalex-snapshot
Isoperimetric Inequalities on Hexagonal Grids
inferred← citeshttps://doi.org/10.48550/arxiv.1205.6063openalex-snapshot
The Edge-Isoperimetric Problem in $(\mathbb{N}^2,\infty)$
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3144openalex-snapshot
On phase transition in the hard-core model on ${\bf Z}^d$
inferred← citeshttps://doi.org/10.48550/arxiv.1303.4139openalex-snapshot
Monotonicity of the optimal perimeter in isoperimetric problems on ${\mathbb{Z}}^{k} \times {\mathbb{N}}^{d}$
inferred← citeshttps://doi.org/10.48550/arxiv.1711.08237openalex-snapshot
The Stochastic Firefighter Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04709openalex-snapshot
Poincaré profiles of lamplighter diagonal products
inferred← citeshttps://doi.org/10.48550/arxiv.2007.14457openalex-snapshot
Isoperimetric stability in lattices
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0007027openalex-snapshot
Efficient cache use for stencil operations on structured discretization grids
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-015openalex-snapshot
Isoperimetric stability in lattices
inferred← citeshttps://doi.org/10.70675/a1dfbe53z646bz4278za6e8z20733c8c6ddbopenalex-snapshot
Separation and Poincaré profiles
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.