On the public citation graph

Treewidth and pathwidth of cocomparability graphs of bounded dimension

https://doi.org/10.1007/bfb0045387
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-56939-1_66openalex-snapshot
Treewidth and pathwidth of permutation graphs
inferredcites →https://doi.org/10.1145/167088.167161openalex-snapshot
A linear time algorithm for finding tree-decompositions of small treewidth

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1998.0997openalex-snapshot
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_68openalex-snapshot
How to use the minimal separators of a graph for its chordal triangulation
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_161openalex-snapshot
Approximating the bandwidth for asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_10openalex-snapshot
Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters
inferred← citeshttps://doi.org/10.1007/bfb0009493openalex-snapshot
Vertex ranking of asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/bfb0019425openalex-snapshot
Dimension and algorithms
inferred← citeshttps://doi.org/10.1007/bfb0024492openalex-snapshot
Algorithms for the treewidth and minimum fill-in of HHD-free graphs
inferred← citeshttps://doi.org/10.1007/bfb0045375openalex-snapshot
Treewidth
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00046-1openalex-snapshot
The complexity of subgraph isomorphism for classes of partial k-trees
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.016openalex-snapshot
Representing a concept lattice by a graph
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.001openalex-snapshot
A wide-range algorithm for minimal triangulation from an arbitrary ordering
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00278-xopenalex-snapshot
Asteroidal triples of moplexes
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00041-3openalex-snapshot
Characterizations and algorithmic applications of chordal graph embeddings
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00146-8openalex-snapshot
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
inferred← citeshttps://doi.org/10.1137/050637091openalex-snapshot
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
inferred← citeshttps://doi.org/10.21914/anziamj.v58i0.10993openalex-snapshot
Isolated Scattering Number Can be Computed in Polynomial Time for Interval 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.