| Perception of Node-Link Diagrams: The Effect of Layout on the Perception of Graph Properties | 0 | 0.34 | 2022 |
| Working Memory Decline In Alzheimer'S Disease Is Detected By Complexity Analysis Of Multimodal Eeg-Fnirs | 0 | 0.34 | 2020 |
| The Effect of Graph Layout on the Perception of Graph Properties. | 1 | 0.34 | 2020 |
| Independent sets in Line of Sight networks | 0 | 0.34 | 2020 |
| Dynamic programming optimization in line of sight networks | 0 | 0.34 | 2020 |
| Complexity of Frontal Cortex fNIRS Can Support Alzheimer Disease Diagnosis in Memory and Visuo-Spatial Tests. | 0 | 0.34 | 2019 |
| Easy knapsacks and the complexity of energy allocation problems in the smart grid. | 1 | 0.34 | 2018 |
| Independent Sets in Restricted Line of Sight Networks. | 0 | 0.34 | 2017 |
| Finding Large Independent Sets in Line of Sight Networks. | 0 | 0.34 | 2017 |
| Heuristic algorithm for coordinating smart houses in MicroGrid | 2 | 0.44 | 2015 |
| Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs. | 0 | 0.34 | 2014 |
| The Complexity of the Empire Colouring Problem | 3 | 0.44 | 2014 |
| The complexity of the empire colouring problem for linear forests. | 0 | 0.34 | 2013 |
| Vertex Unique Labelled Subgraph Mining for Vertex Label Classification. | 1 | 0.37 | 2013 |
| Minimal Vertex Unique Labelled Subgraph Mining | 7 | 0.50 | 2013 |
| Vertex Unique Labelled Subgraph Mining. | 1 | 0.37 | 2013 |
| A survey of frequent subgraph mining algorithms. | 103 | 2.07 | 2013 |
| Smart domestic renewable energy management using knapsack | 1 | 0.36 | 2013 |
| Web-Site Boundary Detection Using Incremental RandomWalk Clustering. | 1 | 0.35 | 2011 |
| Incremental web-site boundary detection using random walks | 3 | 0.39 | 2011 |
| Empires make cartography hard: the complexity of the empire colouring problem | 4 | 0.52 | 2011 |
| Frequent sub-graph mining on edge weighted graphs | 11 | 0.60 | 2010 |
| Text classification using graph mining-based feature extraction | 48 | 1.37 | 2010 |
| Web-Site Boundary Detection | 3 | 0.40 | 2010 |
| Finding frequent subgraphs in longitudinal social network data using a weighted graph mining approach | 2 | 0.38 | 2010 |
| The Block Connectivity of Random Trees | 1 | 0.35 | 2009 |
| Martingales on trees and the empire chromatic number of random trees | 5 | 0.74 | 2009 |
| An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm | 0 | 0.34 | 2009 |
| Large independent sets in random regular graphs | 3 | 0.49 | 2009 |
| Packing vertices and edges in random regular graphs | 3 | 0.42 | 2008 |
| Colouring Random Empire Trees | 6 | 1.04 | 2008 |
| The unsatisfiability threshold revisited | 6 | 0.65 | 2007 |
| Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases | 12 | 0.73 | 2007 |
| Uncover low degree vertices and minimise the mess: independent sets in random regular graphs | 1 | 0.38 | 2007 |
| Dominating sets of random recursive trees | 0 | 0.34 | 2006 |
| On the approximability of the maximum induced matching problem | 33 | 1.35 | 2005 |
| Large k-separated matchings of random regular graphs | 1 | 0.36 | 2005 |
| Large k-independent sets of regular graphs | 2 | 0.37 | 2005 |
| Lower Bounds And Algorithms For Dominating Sets In Web Graphs | 23 | 1.40 | 2005 |
| Dominating Sets in Web Graphs | 1 | 0.35 | 2004 |
| Small Maximal Matchings in Random Graphs | 6 | 0.63 | 2003 |
| On polynomial-time approximation algorithms for the variable length scheduling problem | 1 | 0.38 | 2003 |
| A PTAS for the sparsest 2-spanner of 4-connected planar triangulations | 8 | 0.50 | 2003 |
| Packing Edges in Random Regular Graphs | 6 | 0.65 | 2002 |
| Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold | 4 | 0.52 | 2001 |
| Efficient web searching using temporal factors | 9 | 0.99 | 2001 |
| Complexity-theoretic models of phase transitions in search problems | 3 | 0.64 | 2000 |
| Linear time maximum induced matching algorithm for trees | 7 | 0.90 | 2000 |
| On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F) | 0 | 0.34 | 1998 |
| RCN algorithms for the uniform generation of combinatorial structures | 2 | 0.41 | 1996 |
