| String factorisations with maximum or minimum dimension | 0 | 0.34 | 2020 |
| A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs | 0 | 0.34 | 2019 |
| Some classes of graphs that are not PCGs. | 0 | 0.34 | 2019 |
| Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). | 0 | 0.34 | 2018 |
| On variants of Vertex Geography on undirected graphs. | 0 | 0.34 | 2018 |
| On dynamic threshold graphs and related classes. | 0 | 0.34 | 2018 |
| A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. | 0 | 0.34 | 2016 |
| Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. | 0 | 0.34 | 2016 |
| Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). | 0 | 0.34 | 2015 |
| Fast Flooding over Manhattan | 8 | 0.54 | 2013 |
| Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game | 0 | 0.34 | 2013 |
| Optimal gossiping in geometric radio networks in the presence of dynamical faults | 2 | 0.36 | 2012 |
| Information Spreading in Stationary Markovian Evolving Graphs | 41 | 1.42 | 2011 |
| Reverse-free codes and permutations. | 0 | 0.34 | 2011 |
| Information spreading in stationary Markovian evolving graphs | 49 | 1.85 | 2011 |
| Flooding Time of Edge-Markovian Evolving Graphs | 35 | 1.40 | 2010 |
| On Reverse-Free Codes and Permutations | 4 | 0.53 | 2010 |
| Modelling Mobility: A Discrete Revolution. | 0 | 0.34 | 2010 |
| Broadcasting in dynamic radio networks | 29 | 1.19 | 2009 |
| Flooding time in edge-Markovian dynamic graphs | 61 | 2.77 | 2008 |
| Minimum-Energy Broadcast and disk cover in grid wireless networks | 7 | 0.77 | 2008 |
| Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms | 5 | 0.48 | 2008 |
| An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem | 1 | 0.36 | 2007 |
| Spanning trees with many leaves in regular bipartite graphs | 0 | 0.34 | 2007 |
| Communication in dynamic radio networks | 23 | 1.29 | 2007 |
| On the bounded-hop MST problem on random Euclidean instances | 2 | 0.38 | 2007 |
| Optimal gossiping in directed geometric radio networks in presence of dynamical faults | 3 | 0.40 | 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 |
| 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 |
| Distributed broadcast in radio networks of unknown topology | 68 | 2.44 | 2003 |
| Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks | 12 | 0.68 | 2002 |
| A better bound for locally thin set families | 3 | 0.45 | 2001 |
| Delta-systems and qualitative (in)dependence | 2 | 0.59 | 2001 |
| Compact Representations of the Intersection Structure of Families of Finite Sets | 1 | 0.41 | 2001 |
| Distributed multi-broadcast in unknown radio networks | 16 | 1.15 | 2001 |
| Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks | 34 | 1.48 | 2001 |
| Self-Similarity Bounds for Locally Thin Set Families | 1 | 0.38 | 2001 |
| Selective families, superimposed codes, and broadcasting on unknown radio networks | 132 | 4.68 | 2001 |
| On Computing Ad-hoc Selective Families | 15 | 0.90 | 2001 |
| Logical definability of Y-tree and trellis systolic omega-languages | 1 | 0.36 | 2001 |
| Distributed Broadcast in Wireless Networks with Unknown Topology | 1 | 0.36 | 2001 |
| String Quartets in Binary | 6 | 1.26 | 2000 |
| Systolic tree &ohgr;-languages: the operational and the logical view | 4 | 0.53 | 2000 |
| A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees | 22 | 1.69 | 1999 |
| A Logical Characterization of Systolic Languages | 1 | 0.44 | 1998 |
| Testing and reconfiguration of VLSI linear arrays | 9 | 1.36 | 1998 |
