Decompositions for the edge colouring of reduced indifference graphs
Theoretical Computer Science - Latin American theoretical informatics
Fast parallel edge colouring of graphs
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Discrete Applied Mathematics
A route-based scheduling in wireless multi-hop mesh networks for collision avoidance
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Decompositions for edge-coloring join graphs and cobipartite graphs
Discrete Applied Mathematics
Proteus: a topology malleable data center network
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Speed dating: an algorithmic case study involving matching and scheduling
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Local algorithms for edge colorings in UDGs
Theoretical Computer Science
Journal of Combinatorial Optimization
OSA: an optical switching architecture for data center networks with unprecedented flexibility
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
Journal of Discrete Algorithms
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.90 |