Approximability of identifying codes and locating--dominating codes
Information Processing Letters
On minimum metric dimension of honeycomb networks
Journal of Discrete Algorithms
An efficient representation of Benes networks and its applications
Journal of Discrete Algorithms
Computing minimal doubly resolving sets of graphs
Computers and Operations Research
Computing the metric dimension of graphs by genetic algorithms
Computational Optimization and Applications
On families of convex polytopes with constant metric dimension
Computers & Mathematics with Applications
On the metric dimension of corona product graphs
Computers & Mathematics with Applications
On approximation complexity of metric dimension problem
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Metric bases for polyhedral gauges
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Topology discovery of sparse random graphs with few participants
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Topology discovery of sparse random graphs with few participants
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Network verification via routing table queries
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Virtual coordinates with backtracking for void traversal in geographic routing
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
network discovery and verification
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The covert set-cover problem with application to network discovery
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Approximation complexity of Metric Dimension problem
Journal of Discrete Algorithms
On the metric dimension of infinite graphs
Discrete Applied Mathematics
Approximate discovery of random graphs
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Locating a robber on a graph via distance queries
Theoretical Computer Science
On the complexity of metric dimension
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The (weighted) metric dimension of graphs: hard and easy cases
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Resolving sets for Johnson and Kneser graphs
European Journal of Combinatorics
On the metric dimension of line graphs
Discrete Applied Mathematics
On the metric dimension, the upper dimension and the resolving number of graphs
Discrete Applied Mathematics
On dimension partitions in discrete metric spaces
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Metric dimension of some distance-regular graphs
Journal of Combinatorial Optimization
On the partition dimension of trees
Discrete Applied Mathematics
Hi-index | 0.05 |