Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

Approximate strong separation with application in fractional graph coloring and preemptive scheduling

Theoretical Computer Science

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

Discrete Applied Mathematics

Local edge colouring of Yao-like subgraphs of Unit Disk Graphs

Theoretical Computer Science

Multiflows in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing

On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks

Proceedings of the 4th Annual International Conference on Wireless Internet

Local edge colouring of Yao-like subgraphs of unit disk graphs

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity

Sensor-mission assignment in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)

Assigning sensors to missions with demands

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks

Computational aspects of optimal schedules with power control and multiple bitrates selection in multihop wireless networks

Wireless Networks

Densest k-subgraph approximation on intersection graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Practical computation of optimal schedules in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Better approximation schemes for disk graphs

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Approximation algorithms for unit disk graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Independence and coloring problems on intersection graphs of disks

Efficient Approximation and Online Algorithms

Integer realizations of disk and segment graphs

Journal of Combinatorial Theory Series B

The number of disk graphs

European Journal of Combinatorics