On the public citation graph
Liar's domination
0 signed · 55 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.1002/(sici)1520-6610(2000)8:2<151::aid-jcd8>3.0.co;2-sopenalex-snapshot
On binary codes for identification
inferredcites →https://doi.org/10.1002/net.3230170105openalex-snapshot
Domination and location in acyclic graphs
inferredcites →https://doi.org/10.1006/jctb.2001.2106openalex-snapshot
On the Density of Identifying Codes in the Square Lattice
inferredcites →https://doi.org/10.1007/3-540-45624-4_9openalex-snapshot
Codes Identifying Sets of Vertices
inferredcites →https://doi.org/10.1007/s00454-002-0730-2openalex-snapshot
On the Identification of Sets of Points in the Square Lattice
inferredcites →https://doi.org/10.1016/j.dam.2006.01.002openalex-snapshot
Locating and total dominating sets in trees
inferredcites →https://doi.org/10.1016/j.dam.2006.03.011openalex-snapshot
On graphs on n vertices having an identifying code of cardinality ⌈log2(n+1)⌉
inferredcites →https://doi.org/10.1016/j.dam.2006.03.037openalex-snapshot
On robust identification in the square and king grids
inferredcites →https://doi.org/10.1016/j.disc.2006.04.028openalex-snapshot
An optimal locating-dominating set in the infinite triangular grid
inferredcites →https://doi.org/10.1016/j.disc.2006.07.041openalex-snapshot
Codes identifying sets of vertices in random networks
inferredcites →https://doi.org/10.1016/j.disc.2008.07.019openalex-snapshot
Liar’s domination in graphs
inferredcites →https://doi.org/10.1016/j.ejc.2003.12.013openalex-snapshot
Identifying and locating-dominating codes on chains and cycles
inferredcites →https://doi.org/10.1016/j.ejc.2004.09.002openalex-snapshot
On locating–dominating sets in infinite grids
inferredcites →https://doi.org/10.1016/j.ipl.2003.09.009openalex-snapshot
On identifying codes in the hexagonal mesh
inferredcites →https://doi.org/10.1016/j.jctb.2003.10.002openalex-snapshot
On identification in the triangular grid
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.007openalex-snapshot
Identifying codes in some subgraphs of the square lattice
inferredcites →https://doi.org/10.1016/s0012-365x(01)00113-3openalex-snapshot
Bounds on identifying codes
inferredcites →https://doi.org/10.1016/s0012-365x(01)00244-8openalex-snapshot
Fault-tolerant locating-dominating sets
inferredcites →https://doi.org/10.1016/s0012-365x(03)00111-0openalex-snapshot
On the identification problems in products of cycles
inferredcites →https://doi.org/10.1016/s0012-365x(03)00297-8openalex-snapshot
Well-located graphs: a collection of well-covered ones
inferredcites →https://doi.org/10.1016/s0020-0190(98)00199-9openalex-snapshot
On the covering of vertices for fault diagnosis in hypercubes
inferredcites →https://doi.org/10.1016/s0166-218x(01)00248-7openalex-snapshot
Families of optimal codes for strong identification
inferredcites →https://doi.org/10.1016/s1571-0653(05)80141-6openalex-snapshot
Well-located graphs: A collection of well-covered ones
inferredcites →https://doi.org/10.1109/12.908992openalex-snapshot
On codes identifying vertices in the two-dimensional square lattice with diagonals
inferredcites →https://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferredcites →https://doi.org/10.1109/18.995650openalex-snapshot
Two families of optimal identifying codes in binary Hamming spaces
inferredcites →https://doi.org/10.1109/tit.2005.862097openalex-snapshot
On robust and dynamic identifying codes
inferredcites →https://doi.org/10.1137/s0895480104444089openalex-snapshot
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
inferredcites →https://doi.org/10.1137/s0895480199360990openalex-snapshot
Bounds for Codes Identifying Vertices in the Hexagonal Grid
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.37236/1451openalex-snapshot
New Bounds for Codes Identifying Vertices in Graphs
inferredcites →https://doi.org/10.46298/dmtcs.322openalex-snapshot
On Locating-Dominating Codes in Binary Hamming Spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4614-7582-8_9openalex-snapshot
Models for Assessing Vulnerability in Imperfect Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_5openalex-snapshot
Algorithm and Hardness Results on Liar’s Dominating Set and $$\varvec{k}$$-tuple Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_43openalex-snapshot
Liar’s Dominating Set in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/s10878-012-9542-3openalex-snapshot
Hardness results and approximation algorithm for total liar’s domination in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.011openalex-snapshot
Liar’s domination in graphs: Complexity and algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.006openalex-snapshot
On upper bounds for multiple domination numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.023openalex-snapshot
Liar’s dominating sets in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.008openalex-snapshot
Linear kernels for k -tuple and liar’s domination in bounded genus graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.01.017openalex-snapshot
Liar’s dominating set problem on unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.012openalex-snapshot
A linear time algorithm for liarʼs domination problem in proper interval graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106178openalex-snapshot
On d-distance m-tuple (ℓ,r)-domination in graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2020.05.108openalex-snapshot
Liar’s Domination in Generalized Petersen Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.041openalex-snapshot
Hardness results, approximation and exact algorithms for liar's domination problem in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.029openalex-snapshot
Liar's domination in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116249openalex-snapshot
Parameterized algorithms for variations of vertex-edge domination in graphs
inferred← citeshttps://doi.org/10.1063/5.0017053openalex-snapshot
Upper bound of Liar’s Domination number for fuzzy graphs and some specific fuzzy graphs
inferred← citeshttps://doi.org/10.1142/s1793830913500249openalex-snapshot
CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS
inferred← citeshttps://doi.org/10.26637/mjm0803/0050openalex-snapshot
Connected, regular and split liar domination on fuzzy graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1838openalex-snapshot
Fault tolerant detectors for distinquishing sets in graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1878openalex-snapshot
Various bounds for liar's domination number
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.