| Min-max communities in graphs: Complexity and computational properties. | 1 | 0.35 | 2016 |
| Reducing the diameter of a unit disk graph via node addition | 1 | 0.36 | 2015 |
| Distributed Community Detection in Dynamic Graphs - (Extended Abstract). | 0 | 0.34 | 2013 |
| Distributed Community Detection in Dynamic Graphs | 6 | 0.47 | 2013 |
| Smooth movement and Manhattan path based Random Waypoint mobility | 0 | 0.34 | 2011 |
| Spatial node distribution of manhattan path based random waypoint mobility models with applications | 6 | 0.46 | 2009 |
| Minimum-Energy Broadcast and disk cover in grid wireless networks | 7 | 0.77 | 2008 |
| Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings | 1 | 0.40 | 2008 |
| Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks | 0 | 0.34 | 2007 |
| On the bounded-hop MST problem on random Euclidean instances | 2 | 0.38 | 2007 |
| Minimum energy broadcast and disk cover in grid wireless networks | 2 | 0.36 | 2006 |
| A distributed protocol for the bounded-hops converge-cast in ad-hoc networks | 2 | 0.40 | 2006 |
| Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks | 6 | 0.50 | 2005 |
| Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances | 4 | 0.49 | 2005 |
| Equilibria for broadcast range assignment games in ad-hoc networks | 2 | 0.39 | 2005 |
| The range assignment problem in non-homogeneous static ad-hoc networks | 10 | 0.48 | 2004 |
| Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks | 17 | 0.74 | 2004 |
| Approximating call-scheduling makespan in all-optical networks. | 0 | 0.34 | 2004 |
| The minimum broadcast range assignment problem on linear multi-hop wireless networks | 26 | 1.18 | 2003 |
| Deadlock prevention by acyclic orientations | 1 | 0.39 | 2003 |
| Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks | 1 | 0.37 | 2003 |
| Approximating Call-Scheduling Makespan in All-Optical Networks | 0 | 0.34 | 2000 |
| Wormhole Deadlock Prediction | 2 | 0.40 | 2000 |
| Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems | 7 | 0.75 | 2000 |
| Approximation algorithms for routing and call scheduling in all-optical chains and rings | 2 | 0.37 | 1999 |
| Efficient delay routing | 5 | 0.45 | 1998 |
| Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees | 2 | 0.39 | 1998 |
| Parameterized Parallel Complexity | 5 | 0.62 | 1998 |
| Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract) | 2 | 0.39 | 1997 |
| Computation Models for Parameterized Complexity | 12 | 1.33 | 1997 |
| Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract) | 3 | 0.39 | 1996 |
| Efficient Delay Routing (Extended Abstract) | 0 | 0.34 | 1996 |
| On the hardness of approximating optimum schedule problems in store and forward networks | 3 | 0.45 | 1996 |
| Systolic Acyclic Orientations for Deadlock Prevention | 3 | 0.43 | 1995 |
| Optimum schedule problems in store and forward networks | 2 | 0.38 | 1994 |
| Deadlock Prediction in the Case of Dynamic Routing | 1 | 0.38 | 1990 |
