| Influential users in Twitter: detection and evolution analysis. | 0 | 0.34 | 2019 |
| Twitter: Temporal Events Analysis | 0 | 0.34 | 2018 |
| The Analysis of Influential Users Evolution in Microblogging Social Networks - (Extended Abstract). | 0 | 0.34 | 2017 |
| Estimation of distance-based metrics for very large graphs with MinHash Signatures | 0 | 0.34 | 2017 |
| 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 |
| Moving Beyond the Twitter Follow Graph. | 0 | 0.34 | 2015 |
| Time-based Microblog Distillation. | 1 | 0.43 | 2014 |
| Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. | 1 | 0.35 | 2013 |
| Smooth movement and Manhattan path based Random Waypoint mobility | 0 | 0.34 | 2011 |
| Optimal head-driven parsing complexity for linear context-free rewriting systems | 4 | 0.39 | 2011 |
| Spatial node distribution of manhattan path based random waypoint mobility models with applications | 6 | 0.46 | 2009 |
| Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings | 1 | 0.40 | 2008 |
| MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks | 6 | 0.53 | 2008 |
| Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms | 5 | 0.48 | 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 |
| 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 |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents | 8 | 0.57 | 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 |
| Optimal covering designs: complexity results and new bounds | 3 | 0.50 | 2004 |
| 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 |
| Text sparsification via local maxima | 1 | 0.39 | 2003 |
| Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | 9 | 0.60 | 2003 |
| On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs | 142 | 9.53 | 2001 |
| On the Complexity of Approximating Colored-Graph Problems | 3 | 0.50 | 1999 |
