Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Efficient vertex- and edge-coloring of outerplanar graphs
SIAM Journal on Algebraic and Discrete Methods
Introduction to graph theory
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
Discrete Mathematics - Topics on domination
Automatic domain partitioning in three dimensions
SIAM Journal on Scientific and Statistical Computing
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Points, spheres, and separators: a unified geometric approach to graph partitioning
Points, spheres, and separators: a unified geometric approach to graph partitioning
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for multi-hop radio networks
Scheduling algorithms for multi-hop radio networks
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
A new model for scheduling packet radio networks
Wireless Networks
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Moments of inertia and graph separators
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Coloring powers of planar graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An Approximation Scheme for Bin Packing with Conflicts
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
On colorings of squares of outerplanar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
OVSF-CDMA code assignment in wireless ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Computing throughput capacity for realistic wireless multihop networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Routing of single-source and multiple-source queries in static sensor networks
Journal of Discrete Algorithms
IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A multi-channel defense against jamming attacks in wireless sensor networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Modeling and computing throughput capacity of wireless multihop networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed time-optimal scheduling for convergecast in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
Link Scheduling in Local Interference Models
Algorithmic Aspects of Wireless Sensor Networks
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
A sequential approach for optimal broadcast scheduling in packet radio networks
IEEE Transactions on Communications
Self-stabilizing routing algorithms for wireless ad-hoc networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A probabilistic greedy algorithm for channel assignment in cellular radio networks
IEEE Transactions on Communications
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
SIAM Journal on Scientific Computing
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Does more connectivity help groups to solve social problems
Proceedings of the 12th ACM conference on Electronic commerce
An Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks
Mobile Networks and Applications
A parallel distance-2 graph coloring algorithm for distributed memory computers
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Distributed time slot assignment in wireless ad hoc networks for STDMA
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Almost optimal distributed M2M multicasting in wireless mesh networks
Theoretical Computer Science
Adaptive energy-efficient scheduling for hierarchical wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
ColPack: Software for graph coloring and related problems in scientific computing
ACM Transactions on Mathematical Software (TOMS)
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
On channel-discontinuity-constraint routing in wireless networks
Ad Hoc Networks
Scientific Programming - A New Overview of the Trilinos Project --Part 1
| Hi-index | 0.00 |
We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can be cast as a variant of the vertex coloring problem (called the distance-2 coloring problem) on the graph that models a given packet radio network. We present efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks. The class of graphs considered include (r, s)-civilized graphs, planar graphs, graphs with bounded genus, etc.