Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds K Kothapalli, C Scheideler, M Onus, C Schindelhauer Proceedings 20th IEEE International Parallel & Distributed Processing …, 2006 | 95 | 2006 |

Minimum maximum-degree publish–subscribe overlay network design M Onus, AW Richa IEEE/ACM Transactions on Networking 19 (5), 1331-1343, 2011 | 77 | 2011 |

Linearization: Locally self-stabilizing sorting in graphs M Onus, A Richa, C Scheideler 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007 | 73 | 2007 |

Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design M Onus, AW Richa Computer Networks 94, 307-317, 2016 | 48 | 2016 |

Scalable and accurate graph clustering and community structure detection HN Djidjev, M Onus IEEE Transactions on Parallel and Distributed Systems 24 (5), 1022-1029, 2012 | 45* | 2012 |

Constant density spanners for wireless ad-hoc networks K Kothapalli, C Scheideler, M Onus, A Richa Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005 | 40 | 2005 |

Efficient broadcasting and gathering in wireless ad-hoc networks M Onus, A Richa, K Kothapalli, C Scheideler 8th International Symposium on Parallel Architectures, Algorithms and …, 2005 | 31 | 2005 |

Distributed coloring in bit rounds K Kothapalli, C Scheideler, M Onus, C Schindelhauer Proc. 20th IPDPS, 44-44, 2006 | 16 | 2006 |

Heuristics for minimum Brauer chain problem F Gelgi, M Onus Computer and Information Sciences–ISCIS 2006: 21th International Symposium …, 2006 | 4 | 2006 |

Overlay network construction in highly decentralized networks M Onus Arizona State University, 2009 | 3 | 2009 |