On the public citation graph
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
0 signed · 29 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.1006/jagm.1999.1011openalex-snapshot
Graphs with Branchwidth at Most Three
inferredcites →https://doi.org/10.1007/11523468_16openalex-snapshot
Measure and Conquer: Domination – A Case Study
inferredcites →https://doi.org/10.1007/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7openalex-snapshot
Graph Theory and Sparse Matrix Computation
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_21openalex-snapshot
Exact (Exponential) Algorithms for the Dominating Set Problem
inferredcites →https://doi.org/10.1007/s00453-001-0116-5openalex-snapshot
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
inferredcites →https://doi.org/10.1016/0020-0190(84)90126-1openalex-snapshot
Dominating sets for split and bipartite graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90178-qopenalex-snapshot
The complexity of domination problems in circle graphs
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/j.ipl.2005.10.012openalex-snapshot
Pathwidth of cubic graphs and exact algorithms
inferredcites →https://doi.org/10.1016/j.jda.2005.03.002openalex-snapshot
A note on the complexity of minimum dominating set
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.7151/dmgt.1004openalex-snapshot
Problems remaining NP-complette for sparse or dense graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11917496_8openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_4openalex-snapshot
On the max min vertex cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_50openalex-snapshot
Inclusion/Exclusion Meets Measure and Conquer
inferred← citeshttps://doi.org/10.1007/s00026-020-00521-4openalex-snapshot
MAX MIN Vertex Cover and the Size of Betti Tables
inferred← citeshttps://doi.org/10.1007/s00453-013-9759-2openalex-snapshot
Inclusion/Exclusion Meets Measure and Conquer
inferred← citeshttps://doi.org/10.1007/s10878-011-9396-0openalex-snapshot
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.001openalex-snapshot
On the max min vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.009openalex-snapshot
Finding a dominating set on bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.014openalex-snapshot
An exact algorithm for the minimum dominating clique problem
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2138243/v1openalex-snapshot
Minimum Dominating Sets in Uncertain Graphs
inferred← citeshttps://doi.org/10.3233/jifs-17398openalex-snapshot
Hybrid bat algorithm for minimum dominating set 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.