On the public citation graph
On the complexity of diagram testing
0 signed · 27 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/bf00337921openalex-snapshot
On graphs that can be oriented as diagrams of ordered sets
inferredcites →https://doi.org/10.1007/bf00390104openalex-snapshot
On reorienting graphs by pushing down maximal vertices
inferredcites →https://doi.org/10.1016/0012-365x(91)90015-topenalex-snapshot
Balanced graphs and noncovering graphs
inferredcites →https://doi.org/10.1090/conm/057/856234openalex-snapshot
Orientations and reorientations of graphs
inferredcites →https://doi.org/10.1145/167088.167172openalex-snapshot
On the hardness of approximating minimization problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.1997.1769openalex-snapshot
The Number of Dependent Arcs in an Acyclic Orientation
inferred← citeshttps://doi.org/10.1007/978-3-030-95018-7_5openalex-snapshot
Comparability Graphs Among Cover-Incomparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1007/bf01110379openalex-snapshot
The complexity of cover graph recognition for some varieties of finite lattices
inferred← citeshttps://doi.org/10.1007/s00453-020-00738-yopenalex-snapshot
Enumerating k-Arc-Connected Orientations
inferred← citeshttps://doi.org/10.1007/s11083-009-9117-9openalex-snapshot
On the Complexity of Cover-Incomparability Graphs of Posets
inferred← citeshttps://doi.org/10.1007/s11083-015-9369-5openalex-snapshot
Planar Posets, Dimension, Breadth and the Number of Minimal Elements
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.033openalex-snapshot
Semi-transitive orientations and word-representable graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.082openalex-snapshot
Non-cover generalized Mycielski, Kneser, and Schrijver graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.002openalex-snapshot
Independent arcs of acyclic orientations of complete r -partite graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.017openalex-snapshot
Dimension and height for posets with planar cover graphs
inferred← citeshttps://doi.org/10.1134/s1990478918020084openalex-snapshot
Word-Representable Graphs: a Survey
inferred← citeshttps://doi.org/10.1137/17m1157374openalex-snapshot
Outerstring Graphs are $\chi$-Bounded
inferred← citeshttps://doi.org/10.11575/cdm.v10i2.62228openalex-snapshot
On universally rigid frameworks on the line
inferred← citeshttps://doi.org/10.1214/23-aap2039openalex-snapshot
Maximum likelihood thresholds via graph rigidity
inferred← citeshttps://doi.org/10.35537/10915/2331openalex-snapshot
Sobre grafos cubridores de los grafos de comparabilidad
inferred← citeshttps://doi.org/10.48550/arxiv.1202.5720openalex-snapshot
When is the Direct Product of Generalized Mycielskians a Cover Graph?
inferred← citeshttps://doi.org/10.70675/6cfdfdabzdcc8z4393z93ceza47fc3a0185bopenalex-snapshot
Output-sensitive algorithms for enumeration problems in graphs
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.