![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Peter Shaw 0001
Person information
- affiliation: Nanjing University of Information Science and Technology, China
- affiliation (former): Massey University, Palmerston North, New Zealand
- affiliation (former): Charles Darwin University, Casuarina, Australia
- affiliation (PhD 2008): University of Newcastle, Callaghan, NSW, Australia
Other persons with the same name
- Peter Shaw — disambiguation page
- Peter Shaw 0002 — Queen's University, School of Electronics, Belfast, UK
- Peter Shaw 0003
(aka: Peter Andrew Shaw) — Lancaster University, Department: Computing and Communications, UK
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c16]Peter Shaw, Joseph R. Barr, Faisal N. Abu-Khzam:
Anomaly Detection via Correlation Clustering. ICSC 2022: 307-313 - [c15]Joseph R. Barr, Toby Dylan Hocking, Garinn Morton, Tyler Thatcher, Peter Shaw:
Classifying Imbalanced Data with AUM Loss. TransAI 2022: 135-141 - [c14]Joseph R. Barr, Peter Shaw, Faisal N. Abu-Khzam, Tyler Thatcher, Toby Dylan Hocking:
Graph Embedding: A Methodological Survey. TransAI 2022: 142-148 - 2021
- [j5]Suting Chen
, Wenhao Fan
, Peter Shaw
, Chuang Zhang, Kui Chen, Yong Huang:
DefogNet: A Single-Image Dehazing Algorithm with Cyclic Structure and Cross-Layer Connections. Complex. 2021: 2352185:1-2352185:13 (2021) - [c13]Faisal N. Abu-Khzam, Joseph R. Barr, Amin Fakhereldine, Peter Shaw:
A Greedy Heuristic for Cluster Editing with Vertex Splitting. AI4I 2021: 38-41 - [i3]Joseph R. Barr, Peter Shaw, Marcus Sobel:
The Variability of Model Specification. CoRR abs/2110.02490 (2021) - [i2]Joseph R. Barr, Peter Shaw, Tyler Thatcher:
Vulnerability Analysis of the Android Kernel. CoRR abs/2112.11214 (2021) - 2020
- [j4]Joseph R. Barr, Peter Shaw, Faisal N. Abu-Khzam, Tyler Thatcher, Sheng Yu:
Vulnerability Rating of Source Code with Token Embedding and Combinatorial Algorithms. Int. J. Semantic Comput. 14(4): 501-516 (2020) - [j3]Jun Lyu, Xianfu Cheng, Peter Shaw:
Terrain Hazard Risk Analysis for Flood Disaster Management in Chaohu Basin, China, Based on Two-Dimensional Cloud. J. Adv. Comput. Intell. Intell. Informatics 24(4): 532-542 (2020)
2010 – 2019
- 2019
- [j2]Jianer Chen, Henning Fernau
, Peter Shaw, Jianxin Wang, Zhibiao Yang:
Kernels for packing and covering problems. Theor. Comput. Sci. 790: 152-166 (2019) - [c12]Joseph R. Barr, Peter Shaw, Faisal N. Abu-Khzam, Jikang Chen:
Combinatorial Text Classification: the Effect of Multi-Parameterized Correlation Clustering. GC 2019: 29-36 - [i1]Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw:
On the Parameterized Cluster Editing with Vertex Splitting Problem. CoRR abs/1901.00156 (2019) - 2018
- [c11]Joseph R. Barr, Peter Shaw
:
AI Application to Data Analysis, Automatic File Processing. AI4I 2018: 100-105 - [c10]Peter Shaw
:
Combinatorial Algorithms in Machine Learning. AI4I 2018: 127-128 - [c9]Faisal N. Abu-Khzam, DoKyung Kim, Matthew Perry
, Kai Wang, Peter Shaw
:
Accelerating Vertex Cover Optimization on a GPU Architecture. CCGrid 2018: 616-625 - [c8]Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw
, Peter Shaw
:
Cluster Editing with Vertex Splitting. ISCO 2018: 1-13 - 2017
- [c7]Faisal N. Abu-Khzam, Shaowei Cai
, Judith Egan, Peter Shaw
, Kai Wang:
Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. TAMC 2017: 59-70 - 2015
- [j1]Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
:
On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607: 426-434 (2015) - 2014
- [c6]Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
:
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. COCOA 2014: 625-636 - 2012
- [c5]Jianer Chen, Henning Fernau
, Peter Shaw
, Jianxin Wang, Zhibiao Yang:
Kernels for Packing and Covering Problems - (Extended Abstract). FAW-AAIM 2012: 199-211
2000 – 2009
- 2007
- [c4]Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321 - 2006
- [c3]Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang:
The Cluster Editing Problem: Implementations and Experiments. IWPEC 2006: 13-24 - 2004
- [c2]Luke Mathieson
, Elena Prieto-Rodriguez, Peter Shaw:
Packing Edge Disjoint Triangles: A Parameterized View. IWPEC 2004: 127-137 - [c1]Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. IWPEC 2004: 271-280
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint