Subject area for

Faculty Member
 PROF Tony Wirth Faculty Member

Authored Research Books

Book Chapters Other

Conference Papers Refereed
 A BreadthFirst Representation for Tree Matching in Large Scale ForestBased Translation
 A New Algorithm for the Euclidean kBottleneck Steiner Problem
 A New Development to Aid Interpretation of Hierarchical Cluster Analysis of Repertory Grid Data
 A Simple Bayesian Algorithm for Feature Ranking in High Dimensional Regression Problems
 A metalearning prediction model of algorithm performance for continuous optimization problems
 A polynomial time approximation scheme for kconsensus clustering
 An approximation arising in maxplus based optimal stopping
 An efficient adversarial learning strategy for constructing robust classification boundaries
 Approximating message lengths of hierarchical bayesian models using posterior sampling
 Automatic Abstraction for Congruences
 Comparison of scalable fuzzy clustering methods
 Computational Complexity for Uniform Orientation Steiner Tree Problems
 Cooperative repair of wireless broadcasts
 Demand Response Architectures and Load Management Algorithms for EnergyEfficient Power Grids: A Survey
 Efficient Parallel Algorithms for kCenter Clustering
 Efficient Wireless Scheduling with Limited Channel Feedback and Performance Guarantees
 Energy Adaptive Sensor Scheduling for Noisy Sensor Measurements
 Energy Efficient Time Synchronization in WSN for Critical Infrastructure Monitoring
 Financial application as a software service on cloud
 Frequency Domain MultiModulus Blind Equalization for Coherent 16 QAM PolarizationMultiplexed System
 Genetic Algorithmbased Approach for Bayesian Damage Identification Using Spectral Density Analysis in Beamlike Structures
 Gossipbased asynchronous and robust aggregation protocolA pessimistic approach
 Impacts of Asynchrony on EpidemicStyle Aggregation Protocols
 Incidence Geometries and the Pass Complexity of SemiStreaming Set Cover
 Location Selection for Utility Maximization with Capacity Constraints
 Logistic Regression with the Nonnegative Garrote
 Memoizing a Monadic Mixin DSL
 NonAsymptotic Confidence Regions for the LeastSquares Estimate
 On a Shubert AlgorithmBased Global Extremum Seeking Scheme
 On approximating target set selection
 On compressing weighted timeevolving graphs
 On placement of passive stationary relay points in delay tolerant networking
 On the Computation of Reachability, Stabilisability and OutputNulling Subspaces Using the Rosenbrock System Matrix
 Online Learning in Bayesian Spiking Neurons
 Parallelizing Constraint Solvers for Hard RCPSP Instances
 Particle Markov Chain Monte Carlo for Bayesian Multitarget Tracking
 Practical adaptive search trees with performance bounds
 Precedenceconstrained min sum set cover
 Ranking Locations for Facility Selection based on Potential Influences
 Ranking Tournaments: Local Search and a New Algorithm
 Resolving RIPS measurement ambiguity in maximum likelihood estimation
 Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
 Robust lasso regression with studentt residuals
 ScoreTree: A decentralised framework for credibility management of usergenerated content
 Set cover algorithms for very large datasets
 Signperturbed sums (SPS): A method for constructing exact finitesample confidence regions for general linear systems
 Simplifying the bacteria foraging optimization algorithm
 Smart scheduling and feedback allocation over nonstationary wireless channels
 Solving Difference Constraints over Modular Arithmetic
 The ConicSegmentation Support Vector Machine  a Target Space Method for Multiclass Classification
 Topk Most Incremental Location Selection with Capacity Constraint
 Trends in Suffx Sorting: A Survey of Low Memory Algorithms
 Verifiable postal voting

Conference Papers Unrefereed

Contract

Grant
 2Mar robotics
 A NOVEL MULTIOBJECTIVE OPTIMISATION FRAMEWORK FOR SUSTAINABLE CITIES
 Algorithms and computation in fourdimensional topology
 Approximate structures for efficient processing of data streams
 DYNAMIC OPTIMISATION OF TRANSPORTATION NETWORKS
 Data retrieval from massive information structures
 Efficient Synchronisation of Large Repositories
 Efficient and Effective Algorithms for Searching Strings in Secondary Storage
 Efficient storage and access to text count data An application to unlimited order language modelling
 Nextgeneration techniques for analyzing massive data sets
 Optimisation and analysis of dynamic transportation problems
 Quantification of whole brain structural connectivity and fibre densities.
 STRESSTESTING ALGORITHMS: GENERATING NEW TEST INSTANCES TO ELICIT INSIGHTS
 The Interplay Between Structures and Algorithms in Combinatorial Optimization
 The Tutte polynomial of a graph: Correlations, approximations and applications
 The geometry and complexity of computer programs

Journal Articles Refereed
 A Geometric Approach to Sample Compression
 A highly optimized algorithm for continuous intersection join queries over moving objects
 A highly optimized algorithm for continuous intersection join queries over moving objects
 A two phased service oriented Broker for replica selection in data grids
 Computational Complexity and Human DecisionMaking
 Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #Pcomplete
 Efficient registration of optical and infrared images via modified Sobel edging for plant canopy temperature estimation
 Energy efficient sensor scheduling with a mobile sink node for the target tracking application
 Faster print on demand for Prêt à Voter
 Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis
 Hamiltonicity of 3Arc Graphs
 How Humans Solve Complex Problems: The Case of the Knapsack Problem
 Improved and extended locating functionality on compressed suffix arrays
 Incremental satisfiability and implication for UTVPI constraints
 Iterative Dictionary Construction for Compression of Large DNA Data Sets
 Linear and cyclic distancethree labellings of trees
 Minimalist counting in sensor networks (Noise helps)
 Multiple Imputation in a Longitudinal Cohort Study: A Case Study of Sensitivity to Imputation Methods
 Optimized succinct data structures for massive data
 Query Strategies for Evading ConvexInducing Classifiers
 RealTime Discriminative Background Subtraction
 Sensor Scheduling for Target Tracking by Suboptimal Algorithms
 Specification of generalized linear mixed models for family data using Markov Chain Monte Carlo methods
 The counting complexity of a simple scheduling problem

Other Refereed Contribution To Refereed Journals

Research Book Chapters