On the public citation graph

Independent sets with domination constraints

https://doi.org/10.1007/bfb0055051
0 signed · 21 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.1007/bf01994876openalex-snapshot
Approximating maximum independent sets by excluding subgraphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90022-2openalex-snapshot
Approximating the minimum maximal independence number
inferredcites →https://doi.org/10.1109/sfcs.1996.548522openalex-snapshot
Clique is hard to approximate within n/sup 1-ε/
inferredcites →https://doi.org/10.1145/258533.258538openalex-snapshot
A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.5555/640186.640195openalex-snapshot
Complexity of domination-type problems in graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.70028openalex-snapshot
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/11549345_53openalex-snapshot
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_10openalex-snapshot
Fixed Parameter Algorithms for Planar Dominating Set and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_11openalex-snapshot
Mod-2 Independence and Domination in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_26openalex-snapshot
Approximations of Weighted Independent Set and Hereditary Subset Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_26openalex-snapshot
The Path Set Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_43openalex-snapshot
The Importance of Network Topology in Local Contribution Games
inferred← citeshttps://doi.org/10.1007/bfb0053959openalex-snapshot
Approximations of independent sets in graphs
inferred← citeshttps://doi.org/10.1007/s00453-001-0116-5openalex-snapshot
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-025-01329-5openalex-snapshot
Parameterized Complexity of Path Set Packing
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00159-xopenalex-snapshot
Algorithm for optimal winner determination in combinatorial auctions
inferred← citeshttps://doi.org/10.1109/dsc.2018.00045openalex-snapshot
How to Control Target Nodes in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/wcnc45663.2020.9120733openalex-snapshot
Scheduling Stochastic Real-Time Jobs In Unreliable Workers
inferred← citeshttps://doi.org/10.13001/1081-3810.1592openalex-snapshot
A note on strongly regular graphs and (k,tau)-regular sets
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2591openalex-snapshot
Broadcast in sparse conversion optical networks using fewest converters
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.