On the public citation graph
On the greedy dimension of a partial order
0 signed · 25 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-3-642-45567-4_23openalex-snapshot
A Construction for Strongly Greedy Ordered Sets
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00396269openalex-snapshot
Minimizing the jump number for partially ordered sets: A graph-theoretic approach
inferredcites →https://doi.org/10.1016/0012-365x(79)90082-7openalex-snapshot
The rank of a distributive lattice
inferredcites →https://doi.org/10.1016/0166-218x(85)90030-7openalex-snapshot
N-free posets as generalizations of series-parallel posets
inferredcites →https://doi.org/10.1051/ita/1979130100031openalex-snapshot
Nombre de sauts et graphes série-parallèles
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0417001-6openalex-snapshot
The Dimension of a Comparability Graph
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0715851-3openalex-snapshot
Optimal Linear Extensions by Interchanging Chains
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.24517/00011543openalex-snapshot
On the Dimension of Partially Ordered Sets.
inferredcites →https://doi.org/10.4064/fm-16-1-386-389openalex-snapshot
Sur l'extension de l'ordre partiel
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-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/bf00334853openalex-snapshot
Inequalities for the greedy dimensions of ordered sets
inferred← citeshttps://doi.org/10.1007/bf00337892openalex-snapshot
Representing an ordered set as the intersection of super greedy linear extensions
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90014-8openalex-snapshot
Greedy linear extensions with constraints
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90017-3openalex-snapshot
Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.026openalex-snapshot
Greedy balanced pairs in N -free ordered sets
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22460.xopenalex-snapshot
Super‐Greedy Linear Extensions of Ordered Setsa
inferred← citeshttps://doi.org/10.1137/15m1012396openalex-snapshot
On the Power of Graph Searching for Cocomparability Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11604openalex-snapshot
Greedy balanced pairs in $N$-free ordered sets
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.