On the public citation graph

Network Discovery and Verification

0 signed · 354 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/3-540-44676-1_13openalex-snapshot
On the Approximability of the Minimum Test Collection Problem
inferredcites →https://doi.org/10.1016/0166-218x(95)00106-2openalex-snapshot
Landmarks in graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.12.009openalex-snapshot
Exploring networks with traceroute-like probes: Theory and simulations
inferredcites →https://doi.org/10.1103/physreve.63.062101openalex-snapshot
Size-dependent degree distribution of a scale-free growing network
inferredcites →https://doi.org/10.1103/physreve.71.036135openalex-snapshot
Statistical theory of Internet exploration
inferredcites →https://doi.org/10.1109/90.974527openalex-snapshot
On inferring autonomous system relationships in the Internet
inferredcites →https://doi.org/10.1109/infcom.1997.644557openalex-snapshot
An analysis of Internet inter-domain topology and route stability
inferredcites →https://doi.org/10.1109/infcom.2000.832534openalex-snapshot
Heuristics for Internet map discovery
inferredcites →https://doi.org/10.1109/infcom.2002.1019307openalex-snapshot
Characterizing the Internet hierarchy from multiple vantage points
inferredcites →https://doi.org/10.1109/infcom.2003.1208666openalex-snapshot
Robust monitoring of link delays and faults in IP networks
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1109/sfcs.1994.365703openalex-snapshot
The power of team exploration: two robots can learn unlabeled directed graphs
inferredcites →https://doi.org/10.1109/tnet.2007.892878openalex-snapshot
Computing the Types of the Relationships Between Autonomous Systems
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1145/1060590.1060693openalex-snapshot
On the bias of traceroute sampling
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/258533.258642openalex-snapshot
Improved low-degree testing and its applications
inferredcites →https://doi.org/10.1145/505202.505204openalex-snapshot
On the marginal utility of network topology measurements
inferredcites →https://doi.org/10.1155/s0161171204311403openalex-snapshot
Conditional resolvability in graphs: a survey
inferredcites →https://doi.org/10.1287/moor.1030.0070openalex-snapshot
On Metric Generators of Graphs
inferredcites →https://doi.org/10.5486/pmd.1959.6.3-4.12openalex-snapshot
On random graphs. I.

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.20404openalex-snapshot
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
inferred← citeshttps://doi.org/10.1002/oca.2883openalex-snapshot
On the metric determination of linear dependence graph
inferred← citeshttps://doi.org/10.1002/rsa.20420openalex-snapshot
Topology discovery of sparse random graphs with few participants
inferred← citeshttps://doi.org/10.1002/rsa.21143openalex-snapshot
A simple algorithm for graph reconstruction
inferred← citeshttps://doi.org/10.1002/rsa.70017openalex-snapshot
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
inferred← citeshttps://doi.org/10.1007/11758471_10openalex-snapshot
Network Discovery and Verification with Distance Queries
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_103-1openalex-snapshot
The Metric Dimension of a Graph and Its Variants
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_6openalex-snapshot
Tracking Routes in Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-27195-4_13openalex-snapshot
On Approximation Algorithm for the Edge Metric Dimension Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_3openalex-snapshot
Monitoring the Edges of a Graph Using Distances
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_39openalex-snapshot
Fractional Maker-Breaker Resolving Game
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_1openalex-snapshot
Algorithms that Access the Input via Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_19openalex-snapshot
Monitoring Edge-Geodetic Sets in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52213-0_3openalex-snapshot
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity
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-3-031-92932-8_10openalex-snapshot
On the Computational Complexity of Graph Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_31openalex-snapshot
An Algorithm for Monitoring Edge-Geodetic Sets in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_17openalex-snapshot
Network Creation Games with Traceroute-Based Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-51281-5_18openalex-snapshot
Computing the Metric Dimension of Hypercube Graphs by Particle Swarm Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-72150-7_56openalex-snapshot
Attacking Unexplored Networks - The Probe-and-Attack Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_9openalex-snapshot
Discovery of Network Properties with All-Shortest-Paths Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-74871-7_8openalex-snapshot
Approximate Discovery of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_24openalex-snapshot
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_21openalex-snapshot
The Covert Set-Cover Problem with Application to Network Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-14478-3_42openalex-snapshot
Proposed Security Model and Threat Taxonomy for the Internet of Things (IoT)
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_15openalex-snapshot
On Approximation Complexity of Metric Dimension Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_24openalex-snapshot
Network Verification via Routing Table Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_37openalex-snapshot
On the Complexity of Metric Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_14openalex-snapshot
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_62openalex-snapshot
Graph Reconstruction via Distance Oracles
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_63openalex-snapshot
Near-Linear Query Complexity for Graph Inference
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-981-19-7014-6_8openalex-snapshot
On Fault-Tolerant Metric Dimension of Heptagonal Circular Ladder and Its Related Graphs
inferred← citeshttps://doi.org/10.1007/978-981-19-8054-1_6openalex-snapshot
Location Number of Edges and Vertices of Two-Fold Hepta-Pentagonal Circular Ladder
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/s00009-022-02096-1openalex-snapshot
Resolving sets tolerant to failures in three-dimensional grids
inferred← citeshttps://doi.org/10.1007/s00224-015-9664-yopenalex-snapshot
The Update Complexity of Selection and Related Problems
inferred← citeshttps://doi.org/10.1007/s00224-025-10242-xopenalex-snapshot
Some Symmetrical Planar Structures with their Fault-Tolerant Metric Dimension
inferred← citeshttps://doi.org/10.1007/s00236-024-00453-zopenalex-snapshot
Distance-edge-monitoring sets of networks
inferred← citeshttps://doi.org/10.1007/s00373-021-02447-xopenalex-snapshot
Completeness-Resolvable Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02627-xopenalex-snapshot
On Graphs of Order n with Metric Dimension $$n-4$$
inferred← citeshttps://doi.org/10.1007/s00453-014-9896-2openalex-snapshot
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
inferred← citeshttps://doi.org/10.1007/s00453-016-0184-1openalex-snapshot
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/s00453-020-00674-xopenalex-snapshot
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00808-9openalex-snapshot
Metric Dimension Parameterized By Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-022-01035-6openalex-snapshot
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
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/s10114-015-4160-5openalex-snapshot
The fractional metric dimension of permutation graphs
inferred← citeshttps://doi.org/10.1007/s10474-016-0606-1openalex-snapshot
Computing the metric dimension of convex polytopes generated by wheel related graphs
inferred← citeshttps://doi.org/10.1007/s10878-016-0073-1openalex-snapshot
The k-metric dimension
inferred← citeshttps://doi.org/10.1007/s10878-022-00899-2openalex-snapshot
On metric dimension of plane graphs with $$\frac{m}{2}$$ number of 10 sided faces
inferred← citeshttps://doi.org/10.1007/s10878-024-01229-4openalex-snapshot
On greedy approximation algorithm for the minimum resolving dominating set problem
inferred← citeshttps://doi.org/10.1007/s10898-020-00982-0openalex-snapshot
Resolving sets and integer programs for recommender systems
inferred← citeshttps://doi.org/10.1007/s10910-023-01507-2openalex-snapshot
On mixed metric dimension of crystal cubic carbon structure
inferred← citeshttps://doi.org/10.1007/s11227-024-06053-5openalex-snapshot
Fault-tolerant basis of generalized fat trees and perfect binary tree derived architectures
inferred← citeshttps://doi.org/10.1007/s11590-017-1184-zopenalex-snapshot
An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
inferred← citeshttps://doi.org/10.1007/s11786-011-0076-3openalex-snapshot
Conditional Resolvability of Honeycomb and Hexagonal Networks
inferred← citeshttps://doi.org/10.1007/s11786-015-0226-0openalex-snapshot
On the Strong Metric Dimension of Tetrahedral Diamond Lattice
inferred← citeshttps://doi.org/10.1007/s12190-018-01225-yopenalex-snapshot
On the fault-tolerant metric dimension of certain interconnection networks
inferred← citeshttps://doi.org/10.1007/s12190-026-02895-9openalex-snapshot
Exact metric and fault-tolerant metric dimensions of hexagonal and rectangular octahedral-cell tessellation graphs
inferred← citeshttps://doi.org/10.1007/s40009-026-02044-7openalex-snapshot
Metric Dimension of Total Graph of a Finite Commutative Ring
inferred← citeshttps://doi.org/10.1007/s40840-020-01068-6openalex-snapshot
Metric Dimension of Maximal Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s40840-022-01366-1openalex-snapshot
On Doubly Resolving Sets in Graphs
inferred← citeshttps://doi.org/10.1016/b978-0-443-36624-6.00037-8openalex-snapshot
Binary grey wolf optimizer for solving various resolving set problems
inferred← citeshttps://doi.org/10.1016/j.amc.2012.03.047openalex-snapshot
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
inferred← citeshttps://doi.org/10.1016/j.amc.2018.07.010openalex-snapshot
On the fault-tolerant metric dimension of convex polytopes
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126897openalex-snapshot
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128037openalex-snapshot
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129528openalex-snapshot
Metric dimensions of generalized Sierpiński graphs over squares
inferred← citeshttps://doi.org/10.1016/j.aml.2011.03.024openalex-snapshot
On randomly k -dimensional graphs
inferred← citeshttps://doi.org/10.1016/j.asej.2021.09.014openalex-snapshot
Resolvability of the starphene structure and applications in electronics
inferred← citeshttps://doi.org/10.1016/j.asej.2025.103287openalex-snapshot
An efficient way to represent the processors and their connections in omega networks
inferred← citeshttps://doi.org/10.1016/j.asej.2025.103452openalex-snapshot
On metric dimension of generalized subdivision prism graph
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.asej.2025.103922openalex-snapshot
Fault-tolerant basis and fault-tolerant edge basis of three classes of French windmill graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2008.08.002openalex-snapshot
Computing minimal doubly resolving sets of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.009openalex-snapshot
On the metric dimension of infinite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.018openalex-snapshot
On the metric dimension of line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.007openalex-snapshot
Partition dimension of rooted product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.002openalex-snapshot
Monitoring the edges of a graph using distances
inferred← citeshttps://doi.org/10.1016/j.dam.2021.11.013openalex-snapshot
Link dimension and exact construction of graphs from distance vectors
inferred← citeshttps://doi.org/10.1016/j.dam.2022.02.014openalex-snapshot
On the robustness of the metric dimension of grid graphs to adding a single edge
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.017openalex-snapshot
Graphs with doubly resolving number 2
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.012openalex-snapshot
On the distance-edge-monitoring numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.020openalex-snapshot
Erdös–Gallai-type problems for distance-edge-monitoring numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.032openalex-snapshot
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.03.015openalex-snapshot
The distance-edge-monitoring numbers of subdivision graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.040openalex-snapshot
Nordhaus–Gaddum-type results for monitoring edge-geodetic number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.020openalex-snapshot
Greediness is not always a vice: Efficient discovery algorithms for assignment problems
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.041openalex-snapshot
Monitoring edge-geodetic sets in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.06.018openalex-snapshot
Finding the diameter of a tree with distance queries
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.039openalex-snapshot
The fractional metric dimension of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113410openalex-snapshot
Sharp bound on the truncated metric dimension of trees
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.06.001openalex-snapshot
The weighted 2-metric dimension of trees in the non-landmarks model
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.029openalex-snapshot
On the limiting distribution of the metric dimension for random forests
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103317openalex-snapshot
Metric dimension of critical Galton–Watson trees and linear preferential attachment trees
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.02.019openalex-snapshot
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.058openalex-snapshot
Extremal Graph Theory for Metric Dimension and Diameter
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.004openalex-snapshot
On the Metric Dimension of Infinite Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.11.041openalex-snapshot
On the Metric Dimension of Join of a Graph with Empty Graph(O )
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e25654openalex-snapshot
Computing dominant metric dimensions of certain connected networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.04.006openalex-snapshot
Computing the metric dimension for chain graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.06.002openalex-snapshot
The metric dimension for resolving several objects
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.003openalex-snapshot
Network verification via routing table queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.06.006openalex-snapshot
Complexity of metric dimension on planar graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103528openalex-snapshot
Monitoring the edges of a graph using distances with given girth
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103602openalex-snapshot
Monitoring the edges of product networks using distances
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.010openalex-snapshot
Approximation complexity of Metric Dimension problem
inferred← citeshttps://doi.org/10.1016/j.jksus.2021.101779openalex-snapshot
Sharp bounds on partition dimension of hexagonal Möbius ladder
inferred← citeshttps://doi.org/10.1016/j.jmgm.2025.108957openalex-snapshot
On topological characterizations and computational analysis of benzenoid networks for drug discovery and development
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105141openalex-snapshot
Edge metric basis and its fault tolerance over certain interconnection networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2026.105254openalex-snapshot
Optimal landmark placement in cluster-based networks
inferred← citeshttps://doi.org/10.1016/j.procs.2015.12.072openalex-snapshot
Resolving Sets without Isolated Vertices
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.010openalex-snapshot
Discovery of network properties with all-shortest-paths queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.006openalex-snapshot
Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.026openalex-snapshot
Partition dimension of certain classes of series parallel graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.013openalex-snapshot
The solid-metric dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.032openalex-snapshot
Resolvability and fault-tolerant resolvability structures of convex polytopes
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.005openalex-snapshot
On approximation algorithm for the edge metric dimension problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.012openalex-snapshot
Tracking routes in communication networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.006openalex-snapshot
Reconstruction and verification of chordal graphs with a distance oracle
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.032openalex-snapshot
Query minimization under stochastic uncertainty
inferred← citeshttps://doi.org/10.1017/s0004972726100963openalex-snapshot
THE METRIC DIMENSION OF ZERO-DIVISOR GRAPHS OF BOOLEAN RINGS
inferred← citeshttps://doi.org/10.1038/s41598-025-24939-zopenalex-snapshot
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications
inferred← citeshttps://doi.org/10.1038/s41598-026-46610-xopenalex-snapshot
Structural identifiability in crystalline molecular networks using strong metric dimension
inferred← citeshttps://doi.org/10.1051/ro/2024106openalex-snapshot
Realizability problem of distance-edge-monitoring numbers
inferred← citeshttps://doi.org/10.1063/1.5112286openalex-snapshot
A study on metric dimension of some families of graphs
inferred← citeshttps://doi.org/10.1063/5.0164731openalex-snapshot
Characterization of locating connected domination number on cyclic graphs
inferred← citeshttps://doi.org/10.1080/00268976.2022.2086933openalex-snapshot
Mathematical analysis of one-dimensional lead sulphide crystal structure using molecular graph theory
inferred← citeshttps://doi.org/10.1080/00268976.2023.2252530openalex-snapshot
Localisation of honeycomb rectangular torus
inferred← citeshttps://doi.org/10.1080/00268976.2023.2254417openalex-snapshot
Note on the finite vertex-based partitioning of supramolecular chain in Dialkyltin
inferred← citeshttps://doi.org/10.1080/00268976.2023.2260899openalex-snapshot
Vertex-edge based resolvability parameters of vanadium carbide network with an application
inferred← citeshttps://doi.org/10.1080/00927872.2016.1175602openalex-snapshot
On the metric dimension of a zero-divisor graph
inferred← citeshttps://doi.org/10.1080/02331934.2013.772999openalex-snapshot
Minimal doubly resolving sets of prism graphs
inferred← citeshttps://doi.org/10.1080/02522667.2021.1936902openalex-snapshot
Bounds on partition dimension of Peterson graphs
inferred← citeshttps://doi.org/10.1080/09720529.2019.1624347openalex-snapshot
Some family of distance pattern distinguishing graphs and realization results
inferred← citeshttps://doi.org/10.1080/09720529.2021.1885806openalex-snapshot
On some applications related with algebraic structures through different well known graphs
inferred← citeshttps://doi.org/10.1080/09728600.2021.1962700openalex-snapshot
Metric dimension of ideal-intersection graph of the ring Zn
inferred← citeshttps://doi.org/10.1080/09728600.2023.2280799openalex-snapshot
Metric Dimension of Irregular Convex Triangular Networks
inferred← citeshttps://doi.org/10.1080/09728600.2025.2601753openalex-snapshot
Swapped optical transpose interconnection system: Fault-tolerant resolvability on cycle graphs
inferred← citeshttps://doi.org/10.1080/10406638.2021.2019066openalex-snapshot
Multiset and Mixed Metric Dimension for Starphene and Zigzag-Edge Coronoid
inferred← citeshttps://doi.org/10.1080/17445760.2023.2220143openalex-snapshot
Monitoring edge-geodetic numbers of convex polytopes and four networks
inferred← citeshttps://doi.org/10.1080/17445760.2025.2550694openalex-snapshot
The nonlocal metric dimension of some networks
inferred← citeshttps://doi.org/10.1080/23799927.2024.2364650openalex-snapshot
On hendecagonal circular ladder and its metric dimension
inferred← citeshttps://doi.org/10.1088/1402-4896/ad3addopenalex-snapshot
Mathematical analysis of the structure of one-heptagonal carbon nanocone in terms of its basis and dimension
inferred← citeshttps://doi.org/10.1088/1742-6596/1280/2/022037openalex-snapshot
The partition dimension of subdivision graph on the star
inferred← citeshttps://doi.org/10.1088/1742-6596/1714/1/012029openalex-snapshot
Fault-Tolerant Metric Dimension of Cube of Paths
inferred← citeshttps://doi.org/10.1109/access.2020.2990109openalex-snapshot
Barycentric Subdivision of Cayley Graphs With Constant Edge Metric Dimension
inferred← citeshttps://doi.org/10.1109/access.2020.2991685openalex-snapshot
Local Fractional Metric Dimensions of Rotationally Symmetric and Planar Networks
inferred← citeshttps://doi.org/10.1109/access.2020.3014883openalex-snapshot
Fault-Tolerant Metric Dimension of Interconnection Networks
inferred← citeshttps://doi.org/10.1109/access.2020.3025018openalex-snapshot
Sharp Bounds of Local Fractional Metric Dimensions of Connected Networks
inferred← citeshttps://doi.org/10.1109/access.2020.3044498openalex-snapshot
On Sharp Bounds on Partition Dimension of Convex Polytopes
inferred← citeshttps://doi.org/10.1109/access.2021.3071716openalex-snapshot
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
inferred← citeshttps://doi.org/10.1109/access.2021.3080130openalex-snapshot
Local Fractional Metric Dimensions of Generalized Petersen Networks
inferred← citeshttps://doi.org/10.1109/access.2021.3085584openalex-snapshot
Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid
inferred← citeshttps://doi.org/10.1109/access.2021.3126455openalex-snapshot
Computation of Metric-Based Resolvability of Quartz Without Pendant Nodes
inferred← citeshttps://doi.org/10.1109/access.2021.3131311openalex-snapshot
Local Fractional Strong Metric Dimension of Certain Rotationally Symmetric Planer Networks
inferred← citeshttps://doi.org/10.1109/access.2022.3158982openalex-snapshot
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
inferred← citeshttps://doi.org/10.1109/access.2022.3188319openalex-snapshot
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
inferred← citeshttps://doi.org/10.1109/access.2022.3207197openalex-snapshot
Study of Convexo-Symmetric Networks via Fractional Dimensions
inferred← citeshttps://doi.org/10.1109/access.2023.3235398openalex-snapshot
Patched Network and Its Vertex-Edge Metric-Based Dimension
inferred← citeshttps://doi.org/10.1109/access.2023.3282701openalex-snapshot
A Study on Minimal Doubly Resolving Sets of Certain Families of Networks
inferred← citeshttps://doi.org/10.1109/access.2024.3357147openalex-snapshot
Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks
inferred← citeshttps://doi.org/10.1109/access.2024.3359916openalex-snapshot
Honeycomb Rhombic Torus Vertex-Edge Based Resolvability Parameters and Its Application in Robot Navigation
inferred← citeshttps://doi.org/10.1109/access.2024.3370472openalex-snapshot
Cognitive Analysis of Neural Networks Using Fractional Metric Dimension and Applications
inferred← citeshttps://doi.org/10.1109/access.2024.3516206openalex-snapshot
Metric Dimension of Nonplanar Networks by Fractional Technique With Application
inferred← citeshttps://doi.org/10.1109/access.2026.3665940openalex-snapshot
Latency Analysis for Secure Communication in Cyclic Mesh Networks Using Fractional Strong Metric Resolvability
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919924openalex-snapshot
Reconstructing a Bounded-Degree Directed Tree Using Path Queries
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929414openalex-snapshot
On Learning a Hidden Directed Graph with Path Queries
inferred← citeshttps://doi.org/10.1109/ccc.2013.36openalex-snapshot
On the Parameterized and Approximation Hardness of Metric Dimension
inferred← citeshttps://doi.org/10.1109/cyberc.2018.00072openalex-snapshot
Metric Dimension and Robot Navigation in Specific Sensor Networks
inferred← citeshttps://doi.org/10.1109/icpcsi.2017.8391927openalex-snapshot
On the metric dimension of HDN 3 and PHDN 3
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934904openalex-snapshot
Index-based sampling policies for tracking dynamic networks under sampling constraints
inferred← citeshttps://doi.org/10.1109/race.2015.7097301openalex-snapshot
On the metric dimension of few network sheets
inferred← citeshttps://doi.org/10.1109/tnet.2019.2953921openalex-snapshot
Network Topology Mapping From Partial Virtual Coordinates and Graph Geodesics
inferred← citeshttps://doi.org/10.1109/tpami.2023.3283784openalex-snapshot
Learning Hidden Graphs From Samples
inferred← citeshttps://doi.org/10.1137/050641867openalex-snapshot
On the Metric Dimension of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.1137/16m1097833openalex-snapshot
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
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.1140/epje/s10189-025-00471-wopenalex-snapshot
Vertex-based parameters of hierarchal lattice tube with an application of metric dimension
inferred← citeshttps://doi.org/10.1140/epjp/s13360-021-01399-8openalex-snapshot
Metric-based resolvability of polycyclic aromatic hydrocarbons
inferred← citeshttps://doi.org/10.1142/s0217984925502781openalex-snapshot
Metric dimension analysis of single-walled titania nanotubes: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1142/s0219265922500037openalex-snapshot
Distance-Edge-Monitoring Sets in Hierarchical and Corona Graphs
inferred← citeshttps://doi.org/10.1142/s0219265925500124openalex-snapshot
The Monitoring-Edge-Geodetic Number of Some Planar Networks
inferred← citeshttps://doi.org/10.1142/s0219265925500136openalex-snapshot
Metric Dimension and Dominant Metric Dimension of Unit Graph Over Semi-Rings
inferred← citeshttps://doi.org/10.1142/s1793557120501211openalex-snapshot
Annihilating-ideal graphs of commutative rings
inferred← citeshttps://doi.org/10.1142/s1793830916500488openalex-snapshot
Minimum weight resolving sets of grid graphs
inferred← citeshttps://doi.org/10.1142/s1793830917500276openalex-snapshot
A characterization of some graphs with metric dimension two
inferred← citeshttps://doi.org/10.1142/s1793830918500660openalex-snapshot
Bounds on the sum of domination number and metric dimension of graphs
inferred← citeshttps://doi.org/10.1142/s179383092050010xopenalex-snapshot
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
inferred← citeshttps://doi.org/10.1142/s1793830920500706openalex-snapshot
Computing edge version of metric and double metric dimensions of Kayak paddle graphs
inferred← citeshttps://doi.org/10.1142/s1793830920500950openalex-snapshot
Metric dimension of heptagonal circular ladder
inferred← citeshttps://doi.org/10.1142/s1793830921500154openalex-snapshot
On graphs with same metric and upper dimension
inferred← citeshttps://doi.org/10.1142/s1793830921501329openalex-snapshot
Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
inferred← citeshttps://doi.org/10.1142/s1793830922500860openalex-snapshot
Computing vertex resolvability of some regular planar graphs
inferred← citeshttps://doi.org/10.1142/s1793830922500884openalex-snapshot
On weak metric dimension of digraphs
inferred← citeshttps://doi.org/10.1142/s1793830922501622openalex-snapshot
Fault-tolerant strong metric dimension of graphs
inferred← citeshttps://doi.org/10.1142/s1793830922501853openalex-snapshot
On metric dimension of some planar graphs with 2n odd sided faces
inferred← citeshttps://doi.org/10.1142/s1793830923500064openalex-snapshot
Maker-Breaker metric resolving games on graphs
showing the first 200 of 333 · page through all 333
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.