On the public citation graph
On the computational complexity of codes in graphs
0 signed · 44 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/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1016/0012-365x(84)90145-6openalex-snapshot
A note on total domination
inferredcites →https://doi.org/10.1016/0095-8956(75)90087-8openalex-snapshot
Perfect codes in the graphs Ok
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/0095-8956(86)90079-1openalex-snapshot
Perfect codes over graphs
inferredcites →https://doi.org/10.1017/s0017089500004146openalex-snapshot
Perfect codes in the graphs Ok and L(Ok)
inferredcites →https://doi.org/10.1137/0124010openalex-snapshot
On the Nonexistence of Perfect Codes over Finite Fields
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.2140/pjm.1975.61.225openalex-snapshot
Relations between packing and covering numbers of a tree
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.20432openalex-snapshot
Graph labelings derived from models in distributed computing: A complete complexity classification
inferred← citeshttps://doi.org/10.1007/11917496_27openalex-snapshot
Graph Labelings Derived from Models in Distributed Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_49openalex-snapshot
On Conflict-Free Chromatic Guarding of Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_35openalex-snapshot
Minimum Conflict Free Colouring Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_24openalex-snapshot
Parameterized Complexity of Minimum Membership Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_27openalex-snapshot
Perfect Roman Domination: Aspects of Enumeration and Parameterization
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_32openalex-snapshot
Incompressibility through Colors and IDs
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_10openalex-snapshot
Pattern Matching with Variables: A Multivariate Complexity Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-40164-0_14openalex-snapshot
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_45openalex-snapshot
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_25openalex-snapshot
On the Solvability Problem for Restricted Classes of Word Equations
inferred← citeshttps://doi.org/10.1007/s00453-023-01139-7openalex-snapshot
Parameterized Complexity of Minimum Membership Dominating Set
inferred← citeshttps://doi.org/10.1007/s10623-012-9666-6openalex-snapshot
A generalization of Lee codes
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/j.dam.2016.06.013openalex-snapshot
Kernelization of edge perfect code and its variants
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.027openalex-snapshot
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.026openalex-snapshot
Structural parameterization for minimum conflict-free colouring
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.006openalex-snapshot
Pattern matching with variables: A multivariate complexity analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.028openalex-snapshot
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
inferred← citeshttps://doi.org/10.1017/s0004972700040235openalex-snapshot
1-perfect codes in Sierpiński graphs
inferred← citeshttps://doi.org/10.1109/acssc.2012.6489192openalex-snapshot
Karatsuba implementation of FIR filters
inferred← citeshttps://doi.org/10.1109/induscon58041.2023.10374821openalex-snapshot
Interval Extensions as a Way to Achieve Reduction in Carbon Emissions and Energy Consumption
inferred← citeshttps://doi.org/10.1109/mwscas.2011.6026309openalex-snapshot
An Architecture for a 7 × 7-bit multiple-radix multiplier building block
inferred← citeshttps://doi.org/10.1145/2650261openalex-snapshot
Kernelization Lower Bounds Through Colors and IDs
inferred← citeshttps://doi.org/10.1145/3110290openalex-snapshot
Finding Consensus Strings with Small Length Difference between Input and Solution Strings
inferred← citeshttps://doi.org/10.3390/a17120576openalex-snapshot
Perfect Roman Domination: Aspects of Enumeration and Parameterization
inferred← citeshttps://doi.org/10.37236/536openalex-snapshot
The Complexity of Obtaining a Distance-Balanced Graph
inferred← citeshttps://doi.org/10.48550/arxiv.0711.4343openalex-snapshot
Perfect domination in regular grid graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0711.4345openalex-snapshot
Perfect domination in rectangular grid graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1439openalex-snapshot
Quasiperfect domination in triangular lattices
inferred← citeshttps://doi.org/10.7287/peerj.preprints.1301openalex-snapshot
Next generation cluster editing
inferred← citeshttps://doi.org/10.7287/peerj.preprints.1301v1openalex-snapshot
Next generation cluster editing
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.