The following pages link to On separating systems (Q875044):
Displaying 30 items.
- On the path separation number of graphs (Q313786) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- Search When the Lie Depends on the Target (Q4915262) (← links)
- On Covering Numbers, Young Diagrams, and the Local Dimension of Posets (Q4990391) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
- Separating path systems of almost linear size (Q6571612) (← links)
- On locating and neighbor-locating colorings of sparse graphs (Q6611083) (← links)
- Progress towards the two-thirds conjecture on locating-total dominating sets (Q6611728) (← links)
