On the public citation graph
Treewidth of cocomparability graphs and a new order-theoretic parameter
0 signed · 47 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/3-540-56939-1_66openalex-snapshot
Treewidth and pathwidth of permutation graphs
inferredcites →https://doi.org/10.1007/978-3-642-46908-4_70openalex-snapshot
A Linear Algorithm for the Pathwidth of Trees
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot
Graph Problems Related to Gate Matrix Layout and PLA Folding
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_4openalex-snapshot
Computationally Tractable Classes of 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/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1016/0012-365x(91)90010-yopenalex-snapshot
Interval dimension is a comparability invariant
inferredcites →https://doi.org/10.1016/0166-218x(93)90012-dopenalex-snapshot
On the pathwidth of chordal graphs
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1137/0406014openalex-snapshot
The Pathwidth and Treewidth of Cographs
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1137/s089548019121885xopenalex-snapshot
On the Interplay Between Interval Dimension and Dimension
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
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.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferred← citeshttps://doi.org/10.1007/10692760_8openalex-snapshot
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_8openalex-snapshot
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_35openalex-snapshot
Tree-width and path-width of comparability graphs of interval orders
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_27openalex-snapshot
SAT-Encodings for Special Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_22openalex-snapshot
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_10openalex-snapshot
A Characterisation of the Minimal Triangulations of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_27openalex-snapshot
Computing Pathwidth Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_18openalex-snapshot
Computing Directed Pathwidth in O(1.89 n ) Time
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/s00453-015-0015-9openalex-snapshot
Computing Directed Pathwidth in $$O(1.89^{n})$$ O ( 1 . 89 n ) Time
inferred← citeshttps://doi.org/10.1007/s00453-017-0399-9openalex-snapshot
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/s00453-018-0496-4openalex-snapshot
Counting Linear Extensions: Parameterizations by Treewidth
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00095-9openalex-snapshot
Triangulating graphs without asteroidal triples
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.12.001openalex-snapshot
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103777openalex-snapshot
Width notions for ordering-related problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.017openalex-snapshot
Treewidth and minimum fill-in on permutation graphs in linear time
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00026-2openalex-snapshot
Triangulating multitolerance graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00115-2openalex-snapshot
Triangulating graphs with few P4's
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00206-xopenalex-snapshot
On treewidth and minimum fill-in of asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch77openalex-snapshot
Linear Recognition of Almost Interval Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.13openalex-snapshot
The Complexity of Independent Set Reconfiguration on Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.117openalex-snapshot
Approximating Pathwidth for Graphs of Small Treewidth
inferred← citeshttps://doi.org/10.1145/3576044openalex-snapshot
Approximating Pathwidth for Graphs of Small Treewidth
inferred← citeshttps://doi.org/10.24963/ijcai.2021/2openalex-snapshot
Diversity in Kemeny Rank Aggregation: A Parameterized Approach
inferred← citeshttps://doi.org/10.26481/dis.20120405lmopenalex-snapshot
Treewidth : structural properties and algorithmic insights
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02002openalex-snapshot
Maximal cliques structure for cocomparability graphs and applications
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.