default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter J. Dickinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j4]Stefan Fankhauser, Kaspar Riesen
, Horst Bunke, Peter J. Dickinson:
Suboptimal Graph Isomorphism using bipartite Matching. Int. J. Pattern Recognit. Artif. Intell. 26(6) (2012)
2000 – 2009
- 2009
- [c8]Kaspar Riesen, Stefan Fankhauser, Horst Bunke, Peter J. Dickinson:
Efficient Suboptimal Graph Isomorphism. GbRPR 2009: 124-133 - 2008
- [c7]Alexandra Brügger, Horst Bunke, Peter J. Dickinson, Kaspar Riesen:
Generalized Graph Matching for Data Mining and Information Retrieval. ICDM 2008: 298-312 - [p2]Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Michel Neuhaus, Marc Stettler:
Matching of Hypergraphs - Algorithms, Applications, and Experiments. Applied Pattern Recognition 2008: 131-154 - 2007
- [p1]Horst Bunke, Peter J. Dickinson, Andreas Humm, Christophe Irniger, Miro Kraetzl:
Graph Sequence Visualisation and its Application to Computer Network Monitoring and Abnormal Event Detection. Applied Graph Theory in Computer Vision and Pattern Recognition 2007: 227-245 - 2006
- [j3]Horst Bunke, Peter J. Dickinson, Christophe Irniger, Miro Kraetzl:
Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning. Pattern Recognit. 39(4): 573-586 (2006) - [c6]Horst Bunke, Peter J. Dickinson, Andreas Humm, Christophe Irniger, Miro Kraetzl:
Computer Network Monitoring and Abnormal Event Detection Using Graph Matching and Multidimensional Scaling. ICDM 2006: 576-590 - 2005
- [c5]Horst Bunke, Peter J. Dickinson, Miro Kraetzl:
Recovery of Missing Information in Graph Sequences. GbRPR 2005: 312-321 - [c4]Horst Bunke, Peter J. Dickinson, Miro Kraetzl:
Comparison of Two Different Prediction Schemes for the Analysis of Time Series of Graphs. IbPRIA (2) 2005: 99-106 - [c3]Horst Bunke, Peter J. Dickinson, Miro Kraetzl:
Theoretical and Algorithmic Framework for Hypergraph Matching. ICIAP 2005: 463-470 - [c2]Horst Bunke, Peter J. Dickinson, Christophe Irniger, Miro Kraetzl:
Analysis of Time Series of Graphs: Prediction of Node Presence by Means of Decision Tree Learning. MLDM 2005: 366-375 - 2004
- [j2]Peter J. Dickinson, Miro Kraetzl, Horst Bunke, Michel Neuhaus, Arek Dadej:
Similarity Measures For Hierarchical Representations Of Graphs With Unique Node Labels. Int. J. Pattern Recognit. Artif. Intell. 18(3): 425-442 (2004) - [j1]Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl:
Matching graphs with unique node labels. Pattern Anal. Appl. 7(3): 243-254 (2004) - 2003
- [c1]Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl:
On Graphs with Unique Node Labels. GbRPR 2003: 13-23
Coauthor Index
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-04-24 22:58 CEST 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:
