default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax Ward 0001
Person information
- affiliation: University of Western Australia, Perth
- affiliation: University of Adelaide, Australia
- affiliation: Harvard University, Cambridge, MA, USA
2020 – today
- 2024
[j9]Reynaldo Gil Pons, Max Ward
, Loïc Miller:
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard. Inf. Process. Lett. 184: 106433 (2024)- [c5]Yumeng Zhang, Max Ward, Hung Nguyen:
Practical Anytime Algorithms for Judicious Partitioning of Active Directory Attack Graphs. IJCAI 2024: 7074-7081 - [c4]Eric Parsonage, Max Ward, Hung X. Nguyen:
Higher-Order Graph Models in Network Security. RNDM 2024: 1-8 - 2023
- [j8]Tianshuo Zhou, Ning Dai, Sizhen Li, Max Ward, David H. Mathews, Liang Huang:
RNA design via structure-aware multifrontier ensemble optimization. Bioinform. 39(Supplement-1): 563-571 (2023) - [j7]Jason K. Eshraghian, Max Ward, Emre O. Neftci, Xinxin Wang, Gregor Lenz, Girish Dwivedi, Mohammed Bennamoun, Doo Seok Jeong, Wei D. Lu:
Training Spiking Neural Networks Using Lessons From Deep Learning. Proc. IEEE 111(9): 1016-1054 (2023) - [c3]Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen:
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. AAAI 2023: 5649-5656 - [c2]Yumeng Zhang, Max Ward, Mingyu Guo, Hung Nguyen:
A Scalable Double Oracle Algorithm for Hardening Large Active Directory Systems. AsiaCCS 2023: 993-1003 - 2022
- [j6]Marcell Szikszai, Michael J. Wise, Amitava Datta, Max Ward, David H. Mathews:
Deep learning models for RNA secondary structure prediction (probably) do not generalize across families. Bioinform. 38(16): 3892-3899 (2022) - [j5]Darcy Best, Max Ward:
A faster algorithm for maximum independent set on interval filament graphs. J. Graph Algorithms Appl. 26(1): 199-205 (2022) - [c1]Diksha Goel, Max Hector Ward-Graham, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo:
Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation. GECCO 2022: 1191-1199 - [i5]Reynaldo Gil Pons, Max Ward, Loïc Miller:
Finding (s, d)-Hypernetworks in F-Hypergraphs is NP-Hard. CoRR abs/2201.04799 (2022) - [i4]Diksha Goel, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo:
Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation. CoRR abs/2204.03397 (2022) - [i3]Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen:
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. CoRR abs/2212.04326 (2022) - 2021
- [i2]Jason Kamran Eshraghian, Max Ward, Emre Neftci, Xinxin Wang, Gregor Lenz, Girish Dwivedi, Mohammed Bennamoun, Doo Seok Jeong, Wei D. Lu:
Training Spiking Neural Networks Using Lessons From Deep Learning. CoRR abs/2109.12894 (2021) - [i1]Darcy Best, Max Ward:
A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs. CoRR abs/2110.04933 (2021)
2010 – 2019
- 2019
- [j4]Max Ward, Hongying Sun, Amitava Datta, Michael J. Wise, David H. Mathews:
Determining parameters for non-linear models of multi-loop free energy change. Bioinform. 35(21): 4298-4306 (2019) - 2018
- [j3]Andrew Gozzard, Max Ward, Amitava Datta:
Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition. Inf. Sci. 422: 282-289 (2018) - [j2]Max Ward, Andrew Gozzard, Michael J. Wise, Amitava Datta:
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs. J. Graph Algorithms Appl. 22(2): 389-396 (2018) - 2017
- [j1]Max Ward, Andrew Gozzard, Amitava Datta:
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints. J. Graph Algorithms Appl. 21(4): 547-554 (2017)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
翻译：