Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Selecting forwarding neighbors in wireless Ad Hoc networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Information and Computation
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
On-line coloring of geometric intersection graphs
Computational Geometry: Theory and Applications
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Smooth kinetic maintenance of clusters
Proceedings of the nineteenth annual symposium on Computational geometry
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Smooth kinetic maintenance of clusters
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics
Approximability of identifying codes and locating--dominating codes
Information Processing Letters
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Theoretical Computer Science
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Computational Geometry: Theory and Applications
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Complexity of scheduling with analog network coding
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Approximation schemes for wireless networks
ACM Transactions on Algorithms (TALG)
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
The Roman Domination Problem in Unit Disk Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Approximating minimum independent dominating sets in wireless networks
Information Processing Letters
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Link Scheduling in Local Interference Models
Algorithmic Aspects of Wireless Sensor Networks
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation and Online Algorithms
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
ACM Transactions on Algorithms (TALG)
Cheap or Flexible Sensor Coverage
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Large independent sets in random regular graphs
Theoretical Computer Science
Smooth kinetic maintenance of clusters
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Approximation algorithms for geometric intersection graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Local approximation algorithms for scheduling problems in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Assigning sensors to missions with demands
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Domination in geometric intersection graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Optimal scheduling for dynamic channel allocation in wireless LANs
Wireless Networks
Polynomial time approximation schemes for minimum disk cover problems
Journal of Combinatorial Optimization
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Algorithms for dominating set in disk graphs: breaking the log n Barrier
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A PTAS for the minimum dominating set problem in unit disk graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation algorithms for unit disk graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Polynomial kernels for hard problems on disk graphs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Uncover low degree vertices and minimise the mess: independent sets in random regular graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimization problems in dotted interval graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
ACM Computing Surveys (CSUR)
On approximating string selection problems with outliers
Theoretical Computer Science
| Hi-index | 0.01 |