Max Ward

Orcid: 0000-0001-9114-7339

Affiliations:
  • University of Western Australia, Perth
  • University of Adelaide, Australia
  • Harvard University, Cambridge, MA, USA


According to our database1, Max Ward authored at least 14 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding (<i>s</i>,<i>d</i>)-hypernetworks in F-hypergraphs is NP-hard.
Inf. Process. Lett., February, 2024

Practical Anytime Algorithms for Judicious Partitioning of Active Directory Attack Graphs.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
Training Spiking Neural Networks Using Lessons From Deep Learning.
Proc. IEEE, September, 2023

RNA design via structure-aware multifrontier ensemble optimization.
Bioinform., 2023

A Scalable Double Oracle Algorithm for Hardening Large Active Directory Systems.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
A faster algorithm for maximum independent set on interval filament graphs.
J. Graph Algorithms Appl., 2022

Finding (s, d)-Hypernetworks in F-Hypergraphs is NP-Hard.
CoRR, 2022

Deep learning models for RNA secondary structure prediction (probably) do not generalize across families.
Bioinform., 2022

Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2019
Determining parameters for non-linear models of multi-loop free energy change.
Bioinform., 2019

2018
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs.
J. Graph Algorithms Appl., 2018

Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition.
Inf. Sci., 2018

2017
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints.
J. Graph Algorithms Appl., 2017


  Loading...