default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiro Kraetzl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[c14]Andrew Coyle, Miro Kraetzl, Olaf Maennel
, Matthew Roughan:
On the predictive power of shortest-path weight inference. Internet Measurement Conference 2008: 305-310- [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
- [c13]Jon Arnold, Nigel G. Bean, Miro Kraetzl, Matthew Roughan, Matthew Sorell:
Topology Reconstruction and Characterisation of Wireless Ad Hoc Networks. ICC 2007: 3546-3553 - [c12]Jon Arnold, Nigel G. Bean, Miro Kraetzl, Matthew Roughan:
Node Localisation in Wireless Ad Hoc Networks. ICON 2007: 1-6 - [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
- [j13]Matthew E. Gaston, Miro Kraetzl, Walter D. Wallis:
Using graph diameter for change detection in dynamic networks. Australas. J Comb. 35: 299-312 (2006) - [j12]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) - [c11]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 - [c10]Violet R. Syrotiuk, Kahkasah Shaukat, Young Jin Kwon, Miro Kraetzl, Jon Arnold:
Application of a network dynamics analysis tool to mobile ad hoc networks. MSWiM 2006: 36-43 - 2005
- [j11]Kin-Ping Hui, Nigel G. Bean, Miro Kraetzl, Dirk P. Kroese:
The Cross-Entropy Method for Network Reliability Estimation. Ann. Oper. Res. 134(1): 101-118 (2005) - [c9]Horst Bunke, Peter J. Dickinson, Miro Kraetzl:
Recovery of Missing Information in Graph Sequences. GbRPR 2005: 312-321 - [c8]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 - [c7]Horst Bunke, Peter J. Dickinson, Miro Kraetzl:
Theoretical and Algorithmic Framework for Hypergraph Matching. ICIAP 2005: 463-470 - [c6]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
- [j10]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) - [j9]Michael Johnson, Albert Y. Zomaya, Miro Kraetzl:
Modeling external network behavior by using internal measurements. J. Parallel Distributed Comput. 64(12): 1345-1359 (2004) - [j8]Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl:
Matching graphs with unique node labels. Pattern Anal. Appl. 7(3): 243-254 (2004) - 2003
- [c5]Kin-Ping Hui, Nigel G. Bean, Miro Kraetzl, Dirk P. Kroese:
Network reliability estimation using the tree cut and merge algorithm with importance sampling. DRCN 2003: 254-262 - [c4]Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl:
On Graphs with Unique Node Labels. GbRPR 2003: 13-23 - 2002
- [j7]Peter Shoubridge, Miro Kraetzl, Walter D. Wallis, Horst Bunke:
Detection of Abnormal Change in a Time Series of Graphs. J. Interconnect. Networks 3(1-2): 85-101 (2002) - 2001
- [j6]Walter D. Wallis, Peter Shoubridge, Miro Kraetzl, D. Ray:
Graph distances using graph union. Pattern Recognit. Lett. 22(6/7): 701-704 (2001)
1990 – 1999
- 1998
- [j5]Miltos D. Grammatikakis, Eric Fleury, Miro Kraetzl:
Continuous Routing in Packet Switches. Int. J. Found. Comput. Sci. 9(2): 121-138 (1998) - 1996
- [j4]Yoichi Higashiyama, Miro Kraetzl, Lou Caccetta:
Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system. Australas. J Comb. 14: 31-36 (1996) - [c3]Eric Fleury, Miltos D. Grammatikakis, Miro Kraetzl:
Performance of STC104 vs. Telegraphos. Parcella 1996: 29-37 - 1995
- [c2]Miltos D. Grammatikakis, Miro Kraetzl:
Simulations of Crossbar Switches for Parallel Systems. EUROSIM 1995: 535-540 - [c1]Miltos D. Grammatikakis, Miro Kraetzl:
Probabilistic Models of Network Routers. PARCO 1995: 613-616 - 1993
- [j3]Miro Kraetzl, Charles J. Colbourn:
Threshold Channel Graphs. Comb. Probab. Comput. 2: 337-349 (1993) - [j2]Charles J. Colbourn, John S. Devitt, Daryl D. Harms, Miro Kraetzl:
Assessing Reliability of Multistage Interconnection Networks. IEEE Trans. Computers 42(10): 1207-1221 (1993) - [j1]Miro Kraetzl, Charles J. Colbourn:
Transformations on channel graphs. IEEE Trans. Commun. 41(5): 664-666 (1993)
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 2025-01-20 22:59 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:
