On the public citation graph

Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs

https://doi.org/10.1007/bf01293664
0 signed · 60 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/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1002/net.3230150207openalex-snapshot
An efficiently solvable case of the minimum weight equivalent subgraph problem
inferredcites →https://doi.org/10.1002/net.3230160408openalex-snapshot
On multiple steiner subgraph problems
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-51486-4_54openalex-snapshot
Monadic second-order logic and context-free graph-grammars
inferredcites →https://doi.org/10.1007/3-540-51517-8_142openalex-snapshot
A combinatorial and logical approach to linear-time computability (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-54233-7_161openalex-snapshot
Finding minimal forbidden minors using a finite congruence
inferredcites →https://doi.org/10.1007/3-540-55121-2_2openalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
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/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1007/bfb0013875openalex-snapshot
Hyperedge Replacement: Grammars and Languages
inferredcites →https://doi.org/10.1016/0012-365x(90)90364-nopenalex-snapshot
On minimum dominating sets with minimum intersection
inferredcites →https://doi.org/10.1016/0012-365x(92)90687-bopenalex-snapshot
On the complexity of finding iso- and other morphisms for partial k-trees
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(87)90039-3openalex-snapshot
Linear-time computation of optimal subgraphs of decomposable graphs
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/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0196-6774(91)90020-yopenalex-snapshot
Algorithms finding tree-decompositions of graphs
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0304-3975(90)90106-ropenalex-snapshot
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
inferredcites →https://doi.org/10.1016/0377-2217(88)90258-5openalex-snapshot
Minimum-maximal matching in series-parallel 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/b978-0-12-386870-1.50030-7openalex-snapshot
Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0404043openalex-snapshot
Deterministic Dcomposition of Recursive Graph Classes
inferredcites →https://doi.org/10.1137/0606030openalex-snapshot
Disjoint Paths—A Survey
inferredcites →https://doi.org/10.1137/0607033openalex-snapshot
Characterization and Recognition of Partial 3-Trees
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/129712.129734openalex-snapshot
Finding approximate separators and computing tree width quickly
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel 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.0061openalex-snapshot
Edge-Coloring Partialk-Trees
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_110openalex-snapshot
Decomposable structures, Boolean function representations, and optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_11openalex-snapshot
Equitable Colorings of Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_3openalex-snapshot
Treewidth: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_13openalex-snapshot
Complexity of the Packing Coloring Problem for Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_17openalex-snapshot
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_12openalex-snapshot
Fixed-Parameter Tractability of Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/s004530010017openalex-snapshot
A Linear Algorithm for Finding \boldmath[{ g,f }]-Colorings of Partial \boldmath{ k }-Trees
inferred← citeshttps://doi.org/10.1007/s004530010019openalex-snapshot
Linear-Time Algorithms for Partial \boldmath k -Tree Complements
inferred← citeshttps://doi.org/10.1007/s10878-014-9753-xopenalex-snapshot
The $$k$$ k -separator problem: polyhedra, complexity and approximation results
inferred← citeshttps://doi.org/10.1016/j.artint.2009.10.003openalex-snapshot
Bounded treewidth as a key to tractability of knowledge representation and reasoning
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.2008.09.001openalex-snapshot
Complexity of the packing coloring problem for trees
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.09.009openalex-snapshot
Paths of bounded length and their cuts: Parameterized complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.027openalex-snapshot
Equitable colorings of bounded treewidth graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00173-6openalex-snapshot
On minimum cuts and the linear arrangement problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00240-6openalex-snapshot
Algorithms for generalized vertex-rankings of partial k-trees
inferred← citeshttps://doi.org/10.1016/s1566-2535(01)00039-2openalex-snapshot
System synthesis with morphological clique problem: fusion of subsystem evaluation decisions
inferred← citeshttps://doi.org/10.1145/1456650.1456654openalex-snapshot
Solving problems on recursively constructed graphs
inferred← citeshttps://doi.org/10.1201/b16132-54openalex-snapshot
Crossing Numbers
inferred← citeshttps://doi.org/10.1201/b16132-74openalex-snapshot
Algorithms on Recursively Constructed Graphs
inferred← citeshttps://doi.org/10.2200/s00596ed1v01y201409qmc009openalex-snapshot
Approximability of Optimization Problems through Adiabatic Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4498openalex-snapshot
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
inferred← citeshttps://doi.org/10.70675/a1e2af4az7dd4z4af2zb785zea8508373898openalex-snapshot
K-Separator problem
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.