On the public citation graph
Dimension and algorithms
0 signed · 57 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-56402-0_30openalex-snapshot
On improved time bounds for permutation graph problems
inferredcites →https://doi.org/10.1007/3-540-56503-5_11openalex-snapshot
Treewidth of chordal bipartite graphs
inferredcites →https://doi.org/10.1007/3-540-56939-1_66openalex-snapshot
Treewidth and pathwidth of permutation graphs
inferredcites →https://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferredcites →https://doi.org/10.1007/3-540-57785-8_188openalex-snapshot
Finding all minimal separators of a graph
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-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00340778openalex-snapshot
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
inferredcites →https://doi.org/10.1007/bf00383402openalex-snapshot
Transitive closure for restricted classes of partial orders
inferredcites →https://doi.org/10.1007/bf00383597openalex-snapshot
On the greedy dimension of a partial order
inferredcites →https://doi.org/10.1007/bf00385814openalex-snapshot
Cycle-free partial orders and chordal comparability graphs
inferredcites →https://doi.org/10.1007/bf00814403openalex-snapshot
The dimension of cycle-free orders
inferredcites →https://doi.org/10.1007/bf01462229openalex-snapshot
Treewidth of cocomparability graphs and a new order-theoretic parameter
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0017474openalex-snapshot
A new linear algorithm for Modular Decomposition
inferredcites →https://doi.org/10.1007/bfb0045387openalex-snapshot
Treewidth and pathwidth of cocomparability graphs of bounded dimension
inferredcites →https://doi.org/10.1016/0012-365x(83)90019-5openalex-snapshot
Comparability graphs and intersection graphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90188-fopenalex-snapshot
Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
inferredcites →https://doi.org/10.1016/0097-3165(78)90030-4openalex-snapshot
The dimension of semiorders
inferredcites →https://doi.org/10.1016/0166-218x(79)90043-xopenalex-snapshot
On the X-join decomposition for undirected graphs
inferredcites →https://doi.org/10.1016/0196-6774(88)90041-7openalex-snapshot
Efficient data structures for range searching on a grid
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-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.1016/s0167-5060(08)70955-5openalex-snapshot
Annals of Discrete Mathematics 46
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1109/sfcs.1975.26openalex-snapshot
Preserving order in a forest in less than logarithmic time
inferredcites →https://doi.org/10.1137/0214048openalex-snapshot
On Comparability and Permutation Graphs
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.1137/1.9781611970401openalex-snapshot
Graph Theory and Its Applications to Problems of Society
inferredcites →https://doi.org/10.1137/s0895480191197210openalex-snapshot
Nonredundant 1’s in $\Gamma $-Free Matrices
inferredcites →https://doi.org/10.1145/2157.2158openalex-snapshot
Improving the performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/321707.321710openalex-snapshot
Permutation Graphs and Transitive Graphs
inferredcites →https://doi.org/10.1145/41958.41960openalex-snapshot
Finding the visibility graph of a simple polygon in time proportional to its size
inferredcites →https://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferredcites →https://doi.org/10.1287/moor.8.2.170openalex-snapshot
A Fast Algorithm for the Decomposition of Graphs and Posets
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
inferredcites →https://doi.org/10.5555/127787.127852openalex-snapshot
An O(n2) time algorithm for the 2-chain cover problem and related problems
inferredcites →https://doi.org/10.5555/313559.313637openalex-snapshot
An O(n2 algorithm for circular-arc graph recognition
inferredcites →https://doi.org/10.5555/314464.314641openalex-snapshot
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
inferredcites →https://doi.org/10.56021/9780801844256openalex-snapshot
Combinatorics and Partially Ordered Sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_89openalex-snapshot
A compact data structure and parallel algorithms for permutation graphs
inferred← citeshttps://doi.org/10.1007/bfb0019422openalex-snapshot
Orders, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1007/s00355-013-0735-1openalex-snapshot
The computational complexity of rationalizing Pareto optimal choice behavior
inferred← citeshttps://doi.org/10.1007/s11083-009-9135-7openalex-snapshot
The Complexity of Embedding Orders into Small Products of Chains
inferred← citeshttps://doi.org/10.1016/0045-6535(96)00314-1openalex-snapshot
Stability of comparative evaluation —Example: Environmental databases
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.084openalex-snapshot
The Hardness of Approximating Poset Dimension
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00090-2openalex-snapshot
On building the transitive reduction of a two-dimensional poset
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00166-xopenalex-snapshot
Computing a poset from its realizer
inferred← citeshttps://doi.org/10.1137/15m1007720openalex-snapshot
The Complexity of the Partial Order Dimension Problem: Closing the Gap
inferred← citeshttps://doi.org/10.48550/arxiv.2003.10216openalex-snapshot
Characterization of the existence of semicontinuous Richter-Peleg multi-utility representations
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.