Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Hamilton Paths in Grid Graphs
- Planar Formulae and Their Uses
- Some simplified NP-complete graph problems
- The Location of Emergency Service Facilities
- The NP-completeness column: An ongoing guide
- The NP-completeness column: An ongoing guide
- The NP-completeness column: an ongoing guide
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Unit disk graphs
- Universality considerations in VLSI circuits
Cited in
(only showing first 100 items - show all)- Routing-efficient CDS construction in disk-containment graphs
- Twin-width and polynomial kernels
- The complexity of data aggregation in static and dynamic wireless sensor networks
- On the hardness of energy minimisation for crystal structure prediction
- PTAS for the minimum weighted dominating set in growth bounded graphs
- On dominating set of some subclasses of string graphs
- Impact of locality on location aware unit disk graphs
- scientific article; zbMATH DE number 1286037 (Why is no real title available?)
- Sphericity, cubicity, and edge clique covers of graphs
- Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems
- Minimum dominating set problem for unit disks revisited
- A tight analysis of geometric local search
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- Perfectness and imperfectness of unit disk graphs on triangular lattice points
- Two algorithms for minimum 2-connected \(r\)-hop dominating set
- Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference
- Planar subgraphs without low-degree nodes
- Co-bipartite neighborhood edge elimination orderings
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- On embeddability of unit disk graphs onto straight lines
- Balanced cut approximation in random geometric graphs
- Refining the hierarchies of classes of geometric intersection graphs
- On some matching problems under the color-spanning model
- Dominating set of rectangles intersecting a straight line
- Distributed coloring and the local structure of unit-disk graphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Grid-obstacle representations with connections to staircase guarding
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks
- Locating battery charging stations to facilitate almost shortest paths
- (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
- Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs
- A Survey of the Game “Lights Out!”
- scientific article; zbMATH DE number 754942 (Why is no real title available?)
- Improper Colourings of Unit Disk Graphs
- On the hardness of energy minimisation for crystal structure prediction
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
- Minimum bisection is NP-hard on unit disk graphs
- On local structures of cubicity 2 graphs
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Approximation Algorithms for Geometric Intersection Graphs
- Global Rigidity of Unit Ball Graphs
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
- Connected domination
- Bottleneck matching in the plane
- Sensor network topology design and analysis for efficient data gathering by a mobile mule
- Theoretical Aspects of Graph Models for MANETs
- The connected disk covering problem
- On Embeddability of Unit Disk Graphs onto Straight Lines
- The complexity of data aggregation in static and dynamic wireless sensor networks
- scientific article; zbMATH DE number 7765365 (Why is no real title available?)
- Computing maximum matchings in temporal graphs
- Revising Johnson's table for the 21st century
- On edge intersection graphs of paths with 2 bends
- The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost
- Theory and application of width bounded geometric separators
- In-place algorithms for computing a largest clique in geometric intersection graphs
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
- Minimum ply covering of points with disks and squares
- On pseudo-disk hypergraphs
- CPG graphs: some structural and hardness results
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
- The connected domination number of grids
- Optimization problems over unit-distance representations of graphs
- Generalized disk graphs
- Reverse shortest path problem for unit-disk graphs
- On arrangements of orthogonal circles
- The maximum distance-\(d\) independent set problem on unit disk graphs
- Stabbing pairwise intersecting disks by five points
- A PTAS for the Weighted Unit Disk Cover Problem
- An order-based algorithm for minimum dominating set with application in graph mining
- Path optimization for graph partitioning problems
- Local construction and coloring of spanners of location aware unit disk graphs
- A better constant-factor approximation for weighted dominating set in unit disk graph
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
- On-line coloring of geometric intersection graphs
- Clique number and ball containment number of unit ball graphs
- Connected dominating sets on dynamic geometric graphs
- Bounds on the size of the minimum dominating sets of some cylindrical grid graphs
- Polynomial time approximation schemes for minimum disk cover problems
- Domination number of the cross product of paths
- Efficient algorithms for network localization using cores of underlying graphs
- The on-line first-fit algorithm for radio frequency assignment problems.
- The chromatic and clique numbers of random scaled sector graphs
- Geometric red-blue set cover for unit squares and related problems
- An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks
- Faster approximation for maximum independent set on unit disk graph
- Gridline indifference graphs
- The number of disk graphs
- On domination numbers of graphs bundles
- Compact Routing in Unit Disk Graphs
- Efficient independent set approximation in unit disk graphs
- Learning bounds via sample width for classifiers on finite metric spaces
- A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- Cliques in hyperbolic random graphs
- On forbidden induced subgraphs for unit disk graphs
This page was built for publication: Unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174134)
