On the public citation graph
Complexity of metric dimension on planar graphs
0 signed · 53 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/11604686_12openalex-snapshot
Network Discovery and Verification
inferredcites →https://doi.org/10.1007/978-3-319-06686-8_12openalex-snapshot
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
inferredcites →https://doi.org/10.1007/978-3-642-36092-3_10openalex-snapshot
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete
inferredcites →https://doi.org/10.1007/978-3-662-53174-7_32openalex-snapshot
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
inferredcites →https://doi.org/10.1007/s00453-014-9896-2openalex-snapshot
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1016/j.ipl.2015.04.006openalex-snapshot
Computing the metric dimension for chain graphs
inferredcites →https://doi.org/10.1016/j.jda.2011.12.010openalex-snapshot
Approximation complexity of Metric Dimension problem
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.035openalex-snapshot
Locating a robber on a graph via distance queries
inferredcites →https://doi.org/10.1016/s0166-218x(00)00198-0openalex-snapshot
Resolvability in graphs and the metric dimension of a graph
inferredcites →https://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferredcites →https://doi.org/10.1137/050641867openalex-snapshot
On the Metric Dimension of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1137/1.9781611973082openalex-snapshot
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/16m1057383openalex-snapshot
Metric Dimension of Bounded Tree-length Graphs
inferredcites →https://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.48550/arxiv.1306.2187openalex-snapshot
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete
inferredcites →https://doi.org/10.5555/1070432.1070514openalex-snapshot
Bidimensionality: new connections between FPT algorithms and PTASs
inferredcites →https://doi.org/10.5555/1251203.1251227openalex-snapshot
Beacon vector routing: scalable point-to-point routing in wireless sensornets
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-3-030-04693-4_3openalex-snapshot
Sequential Metric Dimension
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_17openalex-snapshot
Algorithms and Hardness for Metric Dimension on Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_22openalex-snapshot
Resolving Sets in Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_4openalex-snapshot
Enumerating Minimal Solution Sets for Metric Graph Problems
inferred← citeshttps://doi.org/10.1007/978-981-33-6966-5_15openalex-snapshot
Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional
inferred← citeshttps://doi.org/10.1007/s00453-020-00707-5openalex-snapshot
Sequential Metric Dimension
inferred← citeshttps://doi.org/10.1007/s00453-021-00808-9openalex-snapshot
Metric Dimension Parameterized By Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-022-01005-yopenalex-snapshot
Hardness of Metric Dimension in Graphs of Constant Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-023-01132-0openalex-snapshot
On Finding the Best and Worst Orientations for the Metric Dimension
inferred← citeshttps://doi.org/10.1007/s00453-025-01300-4openalex-snapshot
Enumerating Minimal Solution Sets for Metric Graph Problems
inferred← citeshttps://doi.org/10.1007/s40840-020-01068-6openalex-snapshot
Metric Dimension of Maximal Outerplanar Graphs
inferred← citeshttps://doi.org/10.1016/j.asej.2025.103650openalex-snapshot
Uniquely identifying the vertices of pendant-free tricyclic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.019openalex-snapshot
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.027openalex-snapshot
The edge metric dimensions of convex polytopes
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.011openalex-snapshot
On the local metric dimension of K 5 -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112763openalex-snapshot
Local metric dimension for graphs with small clique numbers
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103776openalex-snapshot
Algorithms and hardness for Metric Dimension on digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.028openalex-snapshot
Alternative parameterizations of Metric Dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.031openalex-snapshot
Computing a metric basis of a 2-connected bipartite distance-hereditary graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.015openalex-snapshot
Computing a metric basis of a bipartite distance-hereditary graph
inferred← citeshttps://doi.org/10.1080/17445760.2025.2550694openalex-snapshot
The nonlocal metric dimension of some networks
inferred← citeshttps://doi.org/10.1109/access.2026.3740170openalex-snapshot
Mixed Triple Metric Dimension: A Systematic Literature Review and Mathematical Framework for Plane Graphs
inferred← citeshttps://doi.org/10.1137/21m1409512openalex-snapshot
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
inferred← citeshttps://doi.org/10.1137/22m1510911openalex-snapshot
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
inferred← citeshttps://doi.org/10.1142/s1793830925500740openalex-snapshot
Planar graph with n 2 six and ten sided faces with its metric dimension
inferred← citeshttps://doi.org/10.1371/journal.pone.0313788openalex-snapshot
Computation of mixed resolvability for a circular ladder and its unbounded nature
inferred← citeshttps://doi.org/10.14232/actacyb.23.3.2018.2openalex-snapshot
The Metric Dimension of Two-Dimensional Extended Meshes
inferred← citeshttps://doi.org/10.3390/math11040869openalex-snapshot
Metric Dimensions of Bicyclic Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2024.66openalex-snapshot
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
inferred← citeshttps://doi.org/10.48550/arxiv.2107.04877openalex-snapshot
Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results
inferred← citeshttps://doi.org/10.61091/jcmcc119-17openalex-snapshot
Computing Metric Dimension of Two Types of Claw-free Cubic Graphs with Applications
inferred← citeshttps://doi.org/10.70675/1d768991zd8dbz4f2eza492zf5133d171d3fopenalex-snapshot
Domination and identification games in graphs
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.