On the public citation graph
A Dynamic Programming Approach to the Dominating Set Problem on k -Trees
0 signed · 51 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.1016/0020-0190(75)90011-3openalex-snapshot
A linear algorithm for the domination number of a tree
inferredcites →https://doi.org/10.1016/0022-247x(70)90066-1openalex-snapshot
The concept of “state” in discrete dynamic programming
inferredcites →https://doi.org/10.1016/0166-218x(83)90003-3openalex-snapshot
A linear algorithm for the domination number of a series-parallel graph
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0214056openalex-snapshot
Decomposing a Polygon into Simpler Components
inferredcites →https://doi.org/10.1137/0603025openalex-snapshot
Isomorphism Testing in Hookup Classes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48041-7_16openalex-snapshot
Using Genetic Algorithms to Find Good K-Tree Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_52openalex-snapshot
Improved Tree Decomposition Based Algorithms for Domination-like Problems
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_142openalex-snapshot
A combinatorial and logical approach to linear-time computability (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_26openalex-snapshot
Algorithmic Aspects of Domination in Graphs
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-030-10564-8_19openalex-snapshot
Weighted Upper Edge Cover: Complexity and Approximability
inferred← citeshttps://doi.org/10.1007/978-3-030-57852-7_3openalex-snapshot
On the Complexity of the Upper r-Tolerant Edge Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_31openalex-snapshot
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_76openalex-snapshot
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_12openalex-snapshot
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/bf02060472openalex-snapshot
Locating facilities which interact: Some solvable cases
inferred← citeshttps://doi.org/10.1007/s00453-011-9545-yopenalex-snapshot
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90357-nopenalex-snapshot
Dominating sets in perfect graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90359-popenalex-snapshot
Permutation graphs: Connected domination and Steiner trees
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/0020-0190(86)90022-0openalex-snapshot
Total domination in interval graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90031-ropenalex-snapshot
The weighted perfect domination problem
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90086-8openalex-snapshot
The complexity of generalized clique covering
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90120-5openalex-snapshot
Labeling algorithms for domination problems in sun-free chordal 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(92)90201-kopenalex-snapshot
An optimal algorithm for finding dominating cycles in circular-arc graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90178-qopenalex-snapshot
The complexity of domination problems in circle graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90228-gopenalex-snapshot
On the SPANNING k-TREE problem
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90020-5openalex-snapshot
A recurrence template for several parameters in series–parallel graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00048-vopenalex-snapshot
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50030-7openalex-snapshot
Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.003openalex-snapshot
Upper and lower bounds for finding connected motifs in vertex-colored graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71046-xopenalex-snapshot
Dominating Sets in Perfect Graphs
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/s0305-0548(00)00059-9openalex-snapshot
Using a hybrid of exact and genetic algorithms to design survivable networks
inferred← citeshttps://doi.org/10.1109/drcn.2005.1563849openalex-snapshot
Algorithms to evaluate the reliability of a network
inferred← citeshttps://doi.org/10.1109/pccc.2007.358889openalex-snapshot
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters
inferred← citeshttps://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferred← citeshttps://doi.org/10.1137/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
inferred← citeshttps://doi.org/10.1142/s012905410500284xopenalex-snapshot
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
inferred← citeshttps://doi.org/10.1287/trsc.28.2.104openalex-snapshot
Solving Structured Multifacility Location Problems Efficiently
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2591openalex-snapshot
Broadcast in sparse conversion optical networks using fewest converters
inferred← citeshttps://doi.org/10.70675/80f73784z475az47adzb2ccz764d88c268e2openalex-snapshot
Contributions to approximation and parameterization in combinatorial optimization
inferred← citeshttps://doi.org/10.70675/f7dd3434zb39cz4cc8z9795z51c31a47c8cfopenalex-snapshot
Extension of NP Optimization Problems
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.