On the public citation graph
Tree-partite graphs and the complexity of algorithms
0 signed · 74 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/mana.19790870103openalex-snapshot
Some Graph Theoretical Operations and Decidability
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(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1145/800061.808765openalex-snapshot
Languages which capture complexity classes
inferredcites →https://doi.org/10.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
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.20183openalex-snapshot
Vertex partitions of chordal graphs
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_56openalex-snapshot
On some generalizations of outerplanar graphs: Results and open problems
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_31openalex-snapshot
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_41openalex-snapshot
Decidable Theories of Cayley-Graphs
inferred← citeshttps://doi.org/10.1007/3-540-54487-9_49openalex-snapshot
Monadic second order logic, tree automata and forbidden minors
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_79openalex-snapshot
Isomorphism for graphs of bounded distance width
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_28openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_7openalex-snapshot
Problems Hard for Treewidth but Easy for Stable Gonality
inferred← citeshttps://doi.org/10.1007/978-3-031-47417-0_11openalex-snapshot
Tree-Partitions with Bounded Degree Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-47417-0_9openalex-snapshot
Product Structure of Graph Classes with Bounded Treewidth
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-540-31843-9_14openalex-snapshot
Really Straight Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_18openalex-snapshot
Tree-Partitions of k-Trees with Applications in Graph Layout
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_28openalex-snapshot
Easy Problems for Grid-Structured Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_25openalex-snapshot
Parity Games of Bounded Tree- and Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_7openalex-snapshot
Packing and Covering Immersion Models of Planar Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-81-322-1812-8_44-1openalex-snapshot
Terms and Automata Through Logic
inferred← citeshttps://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferred← citeshttps://doi.org/10.1007/bfb0040395openalex-snapshot
Fast self-reduction algorithms for combinatorial problems of VLSI design
inferred← citeshttps://doi.org/10.1007/pl00009273openalex-snapshot
Isomorphism for Graphs of Bounded Distance Width
inferred← citeshttps://doi.org/10.1007/s00453-017-0313-5openalex-snapshot
An $$O(\log \mathrm {OPT})$$ O ( log OPT ) -Approximation for Covering and Packing Minor Models of $$\theta _r$$ θ r
inferred← citeshttps://doi.org/10.1007/s10994-024-06536-9openalex-snapshot
Generalization bounds for learning under graph-dependence: a survey
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90364-nopenalex-snapshot
On minimum dominating sets with minimum intersection
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00337-iopenalex-snapshot
On tree-partitions of graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90025-6openalex-snapshot
Regularity and locality in k-terminal graphs
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90054-popenalex-snapshot
The structure of the models of decidable monadic theories of graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90078-gopenalex-snapshot
A regular characterization of graph languages definable in monadic second-order logic
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.002openalex-snapshot
Logical aspects of Cayley-graphs: the group case
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.08.002openalex-snapshot
Graph drawings with few slopes
inferred← citeshttps://doi.org/10.1016/j.cosrev.2014.08.001openalex-snapshot
Practical algorithms for MSO model-checking on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.011openalex-snapshot
Vertex-minor reductions can simulate edge contractions
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.017openalex-snapshot
On the model-checking of monadic second-order formulas with edge set quantifications
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.025openalex-snapshot
Recent techniques and results on the Erdős–Pósa property
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.ejc.2017.05.009openalex-snapshot
Packing and covering immersion-expansions of planar sub-cubic graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71053-7openalex-snapshot
On Minimum Dominating Sets with Minimum Intersection
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71054-9openalex-snapshot
Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80203-8openalex-snapshot
Linear Time Computable Problems and Logical Descriptions
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1093/comjnl/bxm052openalex-snapshot
Width Parameters Beyond Tree-width and their Applications
inferred← citeshttps://doi.org/10.1109/secon.1992.202325openalex-snapshot
On polynomial time algorithms for tree-decomposable graphs
inferred← citeshttps://doi.org/10.1137/080744463openalex-snapshot
Extension Preservation Theorems on Classes of Acyclic Finite Structures
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferred← citeshttps://doi.org/10.4204/eptcs.346.3openalex-snapshot
Witnessing Subsystems for Probabilistic Systems with Low Tree Width
inferred← citeshttps://doi.org/10.46298/dmtcs.346openalex-snapshot
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1602.04042openalex-snapshot
Packing and Covering Immersion Models of Planar subcubic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2012.07651openalex-snapshot
Edge-connectivity and tree-structure in finite and infinite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0405112openalex-snapshot
Really Straight Graph Drawings
inferred← citeshttps://doi.org/10.48550/arxiv.math/0604467openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.5555/314613.314769openalex-snapshot
The maximum subforest problem: approximation and exact algorithms
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of 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.