Discriminating Codes in Geometric Setups
From MaRDI portal
Publication:6065423
DOI10.4230/lipics.isaac.2020.24OpenAlexW3112074310MaRDI QIDQ6065423
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Publication date: 14 November 2023
Full work available at URL: https://hal.science/hal-03041359
Related Items (2)
The \textsc{red-blue separation} problem on graphs ⋮ Complexity and approximation for discriminating and identifying code problems in geometric setups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved results on geometric hitting set problems
- Separating collections of points in Euclidean spaces
- A simplified NP-complete satisfiability problem
- Discriminating codes in (bipartite) planar graphs
- Approximation algorithms for the test cover problem
- Shattering a set of objects in 2D
- Identification of points using disks
- On separating points by lines
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Demand Hitting and Covering of Intervals
- Undirected single-source shortest paths with positive integer weights in linear time
- SEPARATING POINTS BY AXIS-PARALLEL LINES
- Discriminating codes in bipartite graphs
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks
- Identifying Codes and Covering Problems
- Star Partitions of Perfect Graphs
- Covering segments with unit squares
This page was built for publication: Discriminating Codes in Geometric Setups
