On the public citation graph
Weighted Efficient Domination for $S_{1,3,3}$-Free Bipartite Graphs in Polynomial Time
0 signed · 19 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.1007/10692760_1openalex-extracted
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
inferredcites →https://doi.org/10.1007/978-3-031-09496-5_9openalex-extracted
Efficient Domination in Graphs
inferredcites →https://doi.org/10.1007/978-3-319-74180-2_1openalex-extracted
Efficient Domination and Efficient Edge Domination: A Brief Survey
inferredcites →https://doi.org/10.1007/978-3-642-35261-4_30openalex-extracted
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
inferredcites →https://doi.org/10.1007/978-3-642-40313-2_19openalex-extracted
New Polynomial Cases of the Weighted Efficient Domination Problem
inferredcites →https://doi.org/10.1007/978-3-662-53536-3_4openalex-extracted
Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs
inferredcites →https://doi.org/10.1007/s002249910009openalex-extracted
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
inferredcites →https://doi.org/10.1016/0012-365x(95)00094-dopenalex-extracted
Generalized domination and efficient domination in graphs
inferredcites →https://doi.org/10.1016/0095-8956(73)90042-7openalex-extracted
Perfect codes in graphs
inferredcites →https://doi.org/10.1016/j.dam.2015.06.030openalex-extracted
Classifying the clique-width of H -free bipartite graphs
inferredcites →https://doi.org/10.1016/j.dam.2019.06.004openalex-extracted
On efficient domination for some classes of H -free bipartite graphs
inferredcites →https://doi.org/10.1016/j.ipl.2014.09.024openalex-extracted
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
inferredcites →https://doi.org/10.1016/j.ipl.2018.08.002openalex-extracted
Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs
inferredcites →https://doi.org/10.1016/s0166-218x(01)00184-6openalex-extracted
Weighted efficient domination problem on some perfect graphs
inferredcites →https://doi.org/10.1137/15m1039821openalex-extracted
Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs
inferredcites →https://doi.org/10.18453/rosdok_id00001431openalex-extracted
Efficient domination and polarity
inferredcites →https://doi.org/10.48550/arxiv.2008.04046openalex-extracted
Finding Efficient Domination for $S_{1,3,3}$-Free Bipartite Graphs in Polynomial Time
inferredcites →https://doi.org/10.48550/arxiv.2010.16076openalex-snapshot
Finding Efficient Domination for $S_{1,1,5}$-Free Bipartite Graphs in Polynomial Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4862280openalex-extracted
Weighted Efficient Domination for $S_{1,1,5}$-Free Bipartite Graphs in Polynomial Time
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.