A new model for scheduling packet radio networks
Wireless Networks
Robust algorithms for restricted domains
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
Ensemble planning for digital audio broadcasting
Handbook of wireless networks and mobile computing
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Efficient integration of multi-hop wireless and wired networks with QoS constraints
Proceedings of the 8th annual international conference on Mobile computing and networking
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
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
The on-line first-fit algorithm for radio frequency assignment problems
Information Processing Letters
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
On-line coloring of geometric intersection graphs
Computational Geometry: Theory and Applications
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Station Layouts in the Presence of Location Constraints
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On the Clique Problem in Intersection Graphs of Ellipses
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Online and Offline Distance Constrained Labeling of Disk Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Random channel assignment in the plane
Random Structures & Algorithms
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A Random Graph Model for Optical Networks of Sensors
IEEE Transactions on Mobile Computing
Coloring of Double Disk Graphs
Journal of Global Optimization
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Distributed construction of connected dominating set 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
Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Threshold Functions for Random Graphs on a Line Segment
Combinatorics, Probability and Computing
Robust algorithms for restricted domains
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
OVSF-CDMA code assignment in wireless ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
On distance constrained labeling of disk graphs
Theoretical Computer Science
Efficient integration of multihop wireless and wired networks with QoS constraints
IEEE/ACM Transactions on Networking (TON)
Dynamic coverage in ad-hoc sensor networks
Mobile Networks and Applications
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Topological Characteristics of Random Multihop Wireless Networks
Cluster Computing
Characterizing achievable multicast rates in multi-hop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
IEEE Transactions on Computers
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Energy efficient topology for wireless microsensor networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
The chromatic and clique numbers of random scaled sector graphs
Theoretical Computer Science - Graph colorings
A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Energy efficient distributed connected dominating sets construction in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Sphericity, cubicity, and edge clique covers of graphs
Discrete Applied Mathematics
A scalable key management and clustering scheme for ad hoc networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Mobile Networks and Applications
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
Wave scheduling and routing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
IEEE/ACM Transactions on Networking (TON)
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics
Routing of single-source and multiple-source queries in static sensor networks
Journal of Discrete Algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved approximation algorithms for connected sensor cover
Wireless Networks
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Theoretical Computer Science
Bounded-distance multi-coverage backbones in wireless sensor networks
Proceedings of the 2007 ACM symposium on Applied computing
IEEE Transactions on Mobile Computing
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing battery-aware virtual backbones in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols
EURASIP Journal on Wireless Communications and Networking
Stateless key distribution for secure intra and inter-group multicast in mobile wireless network
Computer Networks: The International Journal of Computer and Telecommunications Networking
A tight bound for online colouring of disk graphs
Theoretical Computer Science
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
Fast distributed dominating set based routing in large scale MANETs
Computer Communications
Analysis of the impact of hello protocol parameters over a wireless network self-organization
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Interactive wormhole detection and evaluation
Information Visualization
Computational Geometry: Theory and Applications
Efficiently reconfigurable backbones for wireless sensor networks
Computer Communications
Approximating geometric coverage problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
International Journal of Sensor Networks
On the hop count statistics for randomly deployed wireless sensor networks
International Journal of Sensor Networks
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Self-monitoring for sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Approximation schemes for wireless networks
ACM Transactions on Algorithms (TALG)
A scalable key management and clustering scheme for wireless ad hoc and sensor networks
Future Generation Computer Systems
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs
Proceedings of the fifth international workshop on Foundations of mobile computing
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
(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Approximating minimum independent dominating sets in wireless networks
Information Processing Letters
PTAS for Minimum Connected Dominating Set in Unit Ball Graph
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
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
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
Graph-Theoretic Concepts in Computer Science
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
Conflict-free coloring of unit disks
Discrete Applied Mathematics
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Maximum scan statistics and channel assignment problems in homogeneous wireless networks
Theoretical Computer Science
Balanced cut approximation in random geometric graphs
Theoretical Computer Science
Pervasive and Mobile Computing
A combinatorial algorithm for the TDMA message scheduling problem
Computational Optimization and Applications
A local algorithm for dominating sets of quasi-unit disk graphs
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Weakly connected dominating set-based secure clustering and operation in distributed sensor networks
International Journal of Communication Networks and Distributed Systems
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Approximate Conditional Distributions of Distances between Nodes in a Two-Dimensional Sensor Network
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Approximating node-weighted multicast trees in wireless ad-hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Counting birds with wireless sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
SINR diagrams: towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
SIGACT news online algorithms column 14
ACM SIGACT News
Identifying and locating–dominating codes in (random) geometric networks
Combinatorics, Probability and Computing
Acoustic counting algorithms for wireless sensor networks
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks
Journal of Global Optimization
An efficient broadcast relay scheme for MANETs
Computer Communications
Aproximating size of maximal clique in a node's neighbourhood in the ad hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
GOAFR Plus-ABC: geographic routing based on adaptive boundary circle in MANETs
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Note: Sphericity, cubicity, and edge clique covers of graphs
Discrete Applied Mathematics
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
An overview of Channel Assignment methods for multi-radio multi-channel wireless mesh networks
Journal of Parallel and Distributed Computing
Localized algorithms and their applications in ad hoc wireless networks
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Routing in wireless networks with position trees
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
Connectivity and coverage maintenance in wireless sensor networks
The Journal of Supercomputing
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)
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Energy-efficient dominating tree construction in wireless ad hoc and sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Typhoon: a reliable data dissemination protocol for wireless sensor networks
EWSN'08 Proceedings of the 5th European conference on 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
Structure and algorithms in the SINR wireless model
ACM SIGACT News
Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Efficient greedy geographical non-planar routing with reactive deflection
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
VBS: maximum lifetime sleep scheduling for wireless sensor networks using virtual backbones
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Two algorithms for minimum 2-connected r-hop dominating set
Information Processing Letters
On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Optimal scheduling for dynamic channel allocation in wireless LANs
Wireless Networks
Polynomial time approximation schemes for minimum disk cover problems
Journal of Combinatorial Optimization
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Minimum CDS in multihop wireless networks with disparate communication ranges
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
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
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Secure clustering in DSN with key pre-distribution and WCDS
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
Theoretical Computer Science
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
On supporting distributed collaboration in sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
A Serial MIS Based CDS Constructing Algorithm for Wireless Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Scheduling forwarding nodes for two-hop neighborhoods broadcast in wireless ad hoc networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Maximising lifetime for fault-tolerant target coverage in sensor networks
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Multiple-Target Tracking With Binary Proximity Sensors
ACM Transactions on Sensor Networks (TOSN)
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
Integer representations of convex polygon intersection graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Word sense disambiguation: a graph-based approach using N-Cliques partitioning technique
NLDB'11 Proceedings of the 16th international conference on Natural language processing and information systems
Energy efficient data aggregation in solar sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
A maximal independent set based giant component formation in random unit-disk graphs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
The MST of symmetric disk graphs (in arbitrary metric spaces) is light
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Estimating the density of brown plant hoppers from a light-traps network based on unit disk graph
AMT'11 Proceedings of the 7th international conference on Active media technology
Wireless Personal Communications: An International Journal
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Theoretical Computer Science
Proceedings of the Second Symposium on Information and Communication Technology
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Journal of Combinatorial Optimization
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
A key-predistribution-based weakly connected dominating set for secure clustering in DSN
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Theory and application of width bounded geometric separator
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Dynamic dominant index set for mobile peer-to-peer networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Approximation algorithms for minimum span channel assignment problems
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Infrastructure-establishment from scratch in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
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
Shortest hop multipath algorithm for wireless sensor networks
Computers & Mathematics with Applications
Minimum data-latency-bound k-sink placement problem in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A distributed efficient clustering approach for ad hoc and sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Energy-Aware broadcasting method for wireless sensor network
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
On the performances of the routing protocols in MANET: classical versus self-organized approaches
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Loop-Based topology maintenance in wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
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 tight bound for online coloring of disk graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A multiple path characterization of ad-hoc network capacity
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
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
A coloring based backbone construction algorithm in wireless ad hoc network
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Compact and low delay routing labeling scheme for Unit Disk Graphs
Computational Geometry: Theory and Applications
Distributed clustering algorithm for finding virtual backbone in ad hoc networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
GD'11 Proceedings of the 19th international conference on Graph Drawing
A localized link removal and addition based planarization algorithm
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Efficient algorithms for network localization using cores of underlying graphs
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
Journal of Combinatorial Optimization
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
GPS-free directional localization via dual wireless radios
Computer Communications
Conflict-Free Coloring of points on a line with respect to a set of intervals
Computational Geometry: Theory and Applications
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
Journal of Computer Science and Technology - Special issue on Natural Language Processing
SINR Diagrams: Convexity and Its Applications in Wireless Networks
Journal of the ACM (JACM)
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
SIAM Journal on Discrete Mathematics
In-Place algorithms for computing a largest clique in geometric intersection graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A 2-approximation algorithm for optimal deployment of k base stations in WSNs
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
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
Analytical modeling of wireless ad hoc networks: degree distribution and maximum clique size
Proceedings of the 1st ACM workshop on High performance mobile opportunistic systems
Minimum overhearing and transmission multicast routing protocol for sensor networks
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Lifetime aware deployment of k base stations in WSNs
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Connected dominating sets on dynamic geometric graphs
Computational Geometry: Theory and Applications
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory Series B
PTAS for the minimum weighted dominating set in growth bounded graphs
Journal of Global Optimization
DisC diversity: result diversification based on dissimilarity and coverage
Proceedings of the VLDB Endowment
Secure local algorithm for establishing a virtual backbone in 3D ad hoc network
International Journal of Networking and Virtual Organisations
On some coloring problems in grids
Theoretical Computer Science
Network topology models for multihop wireless networks
ISRN Communications and Networking
Reducing the number of flips in trilateration with noisy range measurements
Proceedings of the 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess
Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computational geometry column 56
ACM SIGACT News
Time-bounded essential localization for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
An energy efficient adaptive HELLO algorithm for mobile ad hoc networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Formal verification of real-time wireless sensor networks protocols with realistic radio links
Proceedings of the 21st International conference on Real-Time Networks and Systems
On the discovery of critical links and nodes for assessing network vulnerability
IEEE/ACM Transactions on Networking (TON)
European Journal of Combinatorics
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
Approximating 2-cliques in unit disk graphs
Discrete Applied Mathematics
An improved distributed data aggregation scheduling in wireless sensor networks
Journal of Combinatorial Optimization
Learning bounds via sample width for classifiers on finite metric spaces
Theoretical Computer Science
| Hi-index | 0.02 |