| Orthogonal colourings of Cayley graphs | 0 | 0.34 | 2020 |
| An Optimization Parameter for Seriation of Noisy Data | 0 | 0.34 | 2019 |
| Strongly n-e.c. Graphs and Independent Distinguishing Labellings. | 0 | 0.34 | 2019 |
| Uniform linear embeddings of graphons | 0 | 0.34 | 2017 |
| High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks. | 0 | 0.34 | 2017 |
| Rumors Spread Slowly in a Small-World Spatial Network. | 0 | 0.34 | 2017 |
| Burning a graph is hard. | 1 | 0.35 | 2017 |
| Nonuniform Distribution Of Nodes In The Spatial Preferential Attachment Model | 5 | 0.49 | 2016 |
| Rumours Spread Slowly in a Small World Spatial Network. | 1 | 0.37 | 2016 |
| How To Burn A Graph | 8 | 1.09 | 2016 |
| The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating. | 0 | 0.34 | 2016 |
| Uniform Linear Embeddings of Spatial Random Graphs | 0 | 0.34 | 2015 |
| Partial list colouring of certain graphs | 0 | 0.34 | 2015 |
| Recognition of certain square geometric graphs. | 0 | 0.34 | 2015 |
| Finding Safe Strategies For Competitive Diffusion On Trees | 1 | 0.36 | 2014 |
| Burning a Graph as a Model of Social Contagion. | 7 | 1.05 | 2014 |
| Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model. | 1 | 0.38 | 2013 |
| Infinite Random Geometric Graphs from the Hexagonal Metric. | 0 | 0.34 | 2012 |
| Algorithms and Models for the Web Graph - 9th International Workshop, WAW 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings | 13 | 0.86 | 2012 |
| Geometric Protean Graphs | 5 | 0.50 | 2012 |
| Linear embeddings of graphs and graph limits | 1 | 0.48 | 2012 |
| Model Selection For Social Networks Using Graphlets | 22 | 1.00 | 2012 |
| Geometric graph properties of the spatial preferred attachment model | 12 | 0.81 | 2011 |
| Rank-Based Attachment Leads to Power Law Graphs | 3 | 0.48 | 2010 |
| Estimating node similarity from co-citation in a spatial graph model | 5 | 0.55 | 2010 |
| Spatial models for virtual networks | 4 | 0.49 | 2010 |
| The Geometric Protean Model for On-Line Social Networks | 7 | 0.66 | 2010 |
| A geometric model for on-line social networks | 12 | 0.91 | 2010 |
| Protean graphs with a variety of ranking schemes | 5 | 0.54 | 2009 |
| Link-based event detection in email communication networks | 6 | 0.45 | 2009 |
| The n-ordered graphs: A new graph class | 1 | 0.43 | 2009 |
| Link-Based Anomaly Detection in Communication Networks | 2 | 0.41 | 2008 |
| Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers | 14 | 1.33 | 2008 |
| Modelling and Mining of Networked Information Spaces | 0 | 0.34 | 2006 |
| Workshop on Algorithms and Models for the Web Graph | 0 | 0.34 | 2006 |
| Fractional Isometric Path Number | 0 | 0.34 | 2006 |
| Using HMM to learn user browsing patterns for focused web crawling | 29 | 0.95 | 2006 |
| Characterization of Graphs Using Degree Cores | 14 | 0.75 | 2006 |
| Graph covers using t-colourable vertex sets | 0 | 0.34 | 2004 |
| Limits and power laws of models for the web graph and other networked information spaces | 2 | 0.46 | 2004 |
| Focused Crawling by Learning HMM from User's Topic-specific Browsing | 3 | 0.41 | 2004 |
| Distributive online channel assignment for hexagonal cellular networks with constraints | 5 | 0.74 | 2004 |
| Node similarity in networked information spaces | 22 | 1.87 | 2001 |
| Adaptive Multicolouring | 1 | 0.42 | 2000 |
| Bounded Stable Sets: Polytopes and Colorings | 2 | 0.38 | 1999 |
| Approximation algorithms for channel assignment with constraints | 5 | 0.70 | 1999 |
| Distributed online frequency assignment in cellular networks | 43 | 2.79 | 1998 |
| An analysis of channel assignment problems based on tours | 1 | 0.48 | 1997 |
| New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs | 32 | 3.22 | 1997 |
