On the public citation graph
Signable posets and partitionable simplicial complexes
0 signed · 38 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-4899-6752-7openalex-snapshot
Combinatorics and Commutative Algebra
inferredcites →https://doi.org/10.1007/b139094openalex-snapshot
Combinatorics and Commutative Algebra
inferredcites →https://doi.org/10.1007/bf01215121openalex-snapshot
Sch�lbare Cohen-Macauley-Komplexe und ihre Parametrisierung
inferredcites →https://doi.org/10.1016/0012-365x(95)00248-uopenalex-snapshot
Recognising a partitionable simplicial complex is in NP
inferredcites →https://doi.org/10.1016/0095-8956(80)90082-9openalex-snapshot
Convexity in oriented matroids
inferredcites →https://doi.org/10.1016/s0167-5060(08)70320-0openalex-snapshot
Which Spheres are Shellable?
inferredcites →https://doi.org/10.1016/s0167-5060(08)70321-2openalex-snapshot
A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm
inferredcites →https://doi.org/10.1017/cbo9780511662041.008openalex-snapshot
Homology and Shellability of Matroids and Geometric Lattices
inferredcites →https://doi.org/10.1070/rm1974v029n05abeh001296openalex-snapshot
THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
inferredcites →https://doi.org/10.1090/dimacs/006/11openalex-snapshot
New results for simplicial spherical polytopes
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0690055-6openalex-snapshot
On Lexicographically Shellable Posets
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1137/0607036openalex-snapshot
Hard Enumeration Problems in Geometry and Combinatorics
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1287/moor.5.4.576openalex-snapshot
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/eujc.1997.0141openalex-snapshot
Strongly Signable and Partitionable Posets
inferred← citeshttps://doi.org/10.1007/11496915_16openalex-snapshot
Unique Sink Orientations of Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_25openalex-snapshot
Query Complexity of Matroids
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/978-981-13-3059-9_3openalex-snapshot
Optimization Problems on Acyclic Orientations of Graphs, Shellability of Simplicial Complexes, and Acyclic Partitions
inferred← citeshttps://doi.org/10.1007/s00022-001-8577-xopenalex-snapshot
The Radon-split and the Helly-core of a point configuration
inferred← citeshttps://doi.org/10.1007/s00373-021-02339-0openalex-snapshot
Sequential Partitions of Nonpure Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s00453-007-9090-xopenalex-snapshot
Unique Sink Orientations of Grids
inferred← citeshttps://doi.org/10.1007/s00454-016-9787-1openalex-snapshot
A Mihalisin–Klee Theorem for Fans
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.073openalex-snapshot
A note on shellability and acyclic orientations
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103460openalex-snapshot
On the Holt–Klee property for oriented matroid programming
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.01.011openalex-snapshot
Obstructions to shellability, partitionability, and sequential Cohen–Macaulayness
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00195-4openalex-snapshot
Constructible complexes and recursive division of posets
inferred← citeshttps://doi.org/10.1109/focs.2006.53openalex-snapshot
On a Geometric Generalization of the Upper Bound Theorem
inferred← citeshttps://doi.org/10.1137/s1052623497344002openalex-snapshot
A Polynomial Time Algorithm for Shaped Partition Problems
inferred← citeshttps://doi.org/10.1287/moor.22.3.550openalex-snapshot
Colourful Linear Programming and its Relatives
inferred← citeshttps://doi.org/10.2139/ssrn.5358394openalex-snapshot
Riordan Patterns's Quest within Simplicial Complexes
inferred← citeshttps://doi.org/10.37236/29openalex-snapshot
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
inferred← citeshttps://doi.org/10.46298/dmtcs.6325openalex-snapshot
A non-partitionable Cohen–Macaulay simplicial complex
inferred← citeshttps://doi.org/10.48550/arxiv.math/9704226openalex-snapshot
A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes
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.