On the public citation graph
Branch decompositions and minor containment
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.1002/(sici)1097-0118(199906)31:2<95::aid-jgt2>3.0.co;2-nopenalex-snapshot
An excluded minor theorem for the octahedron
inferredcites →https://doi.org/10.1006/inco.1997.2697openalex-snapshot
All Structured Programs Have Small Tree Width and Good Register Allocation
inferredcites →https://doi.org/10.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferredcites →https://doi.org/10.1006/jagm.1999.1011openalex-snapshot
Graphs with Branchwidth at Most Three
inferredcites →https://doi.org/10.1006/jctb.1993.1027openalex-snapshot
Graph Searching and a Min-Max Theorem for Tree-Width
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1006/jctb.1997.1761openalex-snapshot
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces
inferredcites →https://doi.org/10.1006/jctb.2001.2082openalex-snapshot
Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
inferredcites →https://doi.org/10.1007/3-540-45995-2_52openalex-snapshot
Improved Tree Decomposition Based Algorithms for Domination-like Problems
inferredcites →https://doi.org/10.1007/3-540-63165-8_217openalex-snapshot
Constructive linear time algorithms for branchwidth
inferredcites →https://doi.org/10.1007/978-3-540-39658-1_68openalex-snapshot
A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs
inferredcites →https://doi.org/10.1007/bf01758777openalex-snapshot
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
inferredcites →https://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0095-8956(90)90130-ropenalex-snapshot
A menger-like property of tree-width: The finite case
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(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
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.1016/s1571-0653(05)00746-8openalex-snapshot
Solving Frequency Assignment Problems via Tree-Decomposition
inferredcites →https://doi.org/10.1016/s1571-0653(05)80078-2openalex-snapshot
Treewidth: Computational Experiments
inferredcites →https://doi.org/10.1017/cbo9780511752506openalex-snapshot
Complexity: Knots, Colourings and Countings
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
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/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
inferredcites →https://doi.org/10.1137/s0895480195280010openalex-snapshot
The Structure and Number of Obstructions to Treewidth
inferredcites →https://doi.org/10.1145/129712.129734openalex-snapshot
Finding approximate separators and computing tree width quickly
inferredcites →https://doi.org/10.1287/ijoc.15.3.233.16078openalex-snapshot
Tour Merging via Branch-Decomposition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0121openalex-snapshot
Branch‐Width and Tangles
inferred← citeshttps://doi.org/10.1002/net.20050openalex-snapshot
Graphs, branchwidth, and tangles! Oh my!
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_59openalex-snapshot
Branchwidth and Branch Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-540-78568-2_34openalex-snapshot
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_31openalex-snapshot
Faster Parameterized Algorithms for Minor Containment
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_9openalex-snapshot
Fast Minor Testing in Planar Graphs
inferred← citeshttps://doi.org/10.1007/bf03342739openalex-snapshot
Generalizability and Applicability of Model-Based Business Process Compliance-Checking Approaches — A State-of-the-Art Analysis and Research Roadmap
inferred← citeshttps://doi.org/10.1007/s00453-011-9563-9openalex-snapshot
Fast Minor Testing in Planar Graphs
inferred← citeshttps://doi.org/10.1007/s10589-011-9397-zopenalex-snapshot
A combinatorial optimization algorithm for solving the branchwidth problem
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.026openalex-snapshot
Square roots of minor closed graph classes
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.03.002openalex-snapshot
Tree-width and the Sherali–Adams operator
inferred← citeshttps://doi.org/10.1016/j.endm.2011.10.014openalex-snapshot
Square Roots of Minor Closed Graph Classes
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.10.001openalex-snapshot
Irrelevant vertices for the planar Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.015openalex-snapshot
Faster parameterized algorithms for minor containment
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114369openalex-snapshot
Minor embedding in broken chimera and derived graphs is NP-complete
inferred← citeshttps://doi.org/10.1109/cbi.2013.42openalex-snapshot
A Framework for Fast Graph-Based Pattern Matching in Conceptual Models
inferred← citeshttps://doi.org/10.1287/educ.1053.0017openalex-snapshot
Branch and Tree Decomposition Techniques for Discrete Optimization
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0074openalex-snapshot
Planar Branch Decompositions II: The Cycle Method
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0075openalex-snapshot
Planar Branch Decompositions I: The Ratcatcher
inferred← citeshttps://doi.org/10.1287/ijoc.1120.0524openalex-snapshot
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0743openalex-snapshot
A Branch Decomposition Algorithm for the p-Median Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1409.2733openalex-snapshot
Scattered packings of cycles
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.