On the public citation graph

Isomorphism for Graphs of Bounded Distance Width

https://doi.org/10.1007/pl00009273
0 signed · 42 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.1002/jgt.3190200412openalex-snapshot
Some results on tree decomposition of graphs
inferredcites →https://doi.org/10.1007/bfb0028825openalex-snapshot
Tree-partite graphs and the complexity of algorithms
inferredcites →https://doi.org/10.1016/0012-365x(89)90083-6openalex-snapshot
Graphs with small bandwidth and cutwidth
inferredcites →https://doi.org/10.1016/0012-365x(91)90436-6openalex-snapshot
Tree-partitions of infinite graphs
inferredcites →https://doi.org/10.1016/0012-365x(93)e0219-topenalex-snapshot
Bandwidth of the complete k-ary tree
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
inferredcites →https://doi.org/10.1016/0196-6774(90)90013-5openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1137/0210015openalex-snapshot
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s0097539793255709openalex-snapshot
The Linkage of a Graph

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.20293openalex-snapshot
Neighborhood hypergraphs of bipartite graphs
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_40openalex-snapshot
Determining Similarity of Conformational Polymorphs
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_22openalex-snapshot
On Weak Isomorphism of Rooted Vertex-Colored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0openalex-snapshot
Treewidth, Kernels, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_32openalex-snapshot
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_30openalex-snapshot
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_16openalex-snapshot
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_22openalex-snapshot
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_46openalex-snapshot
The Isomorphism Problem for k-Trees Is Complete for Logspace
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_9openalex-snapshot
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_32openalex-snapshot
Isomorphism of (mis)Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_25openalex-snapshot
Approximability of the Path-Distance-Width for AT-free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_21openalex-snapshot
On Tractable Parameterizations of Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_48openalex-snapshot
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width
inferred← citeshttps://doi.org/10.1007/s00453-013-9787-yopenalex-snapshot
Colored Hypergraph Isomorphism is Fixed Parameter Tractable
inferred← citeshttps://doi.org/10.1016/j.dam.2012.11.015openalex-snapshot
Approximating the path-distance-width for AT-free graphs and graphs in related classes
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.011openalex-snapshot
Minors in graphs of large θr -girth
inferred← citeshttps://doi.org/10.1016/j.ic.2012.04.002openalex-snapshot
The isomorphism problem for k-trees is complete for logspace
inferred← citeshttps://doi.org/10.1016/j.ic.2012.05.003openalex-snapshot
Restricted space algorithms for isomorphism on bounded treewidth graphs
inferred← citeshttps://doi.org/10.1109/focs.2014.28openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1137/140999980openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1145/1937128.1937134openalex-snapshot
Automatic classification of semantic user interface services
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.103openalex-snapshot
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0818openalex-snapshot
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04593openalex-snapshot
Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1682openalex-snapshot
The path-distance-width of hypercubes
inferred← citeshttps://doi.org/10.9734/jamcs/2023/v38i101835openalex-snapshot
Revisiting Linear Width: Rethinking the Relationship between Single Ideal and Linear Obstacle
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.