default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNils M. Kriege
Nils Morten Kriege
Person information
- affiliation: University of Vienna, Austria
- affiliation (former): Technical University of Dortmund, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2015
[b1]Nils Morten Kriege:
Comparing graphs. Dortmund University, Germany, 2015
Journal Articles
- 2023
- [j13]Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, Karsten M. Borgwardt:
Weisfeiler and Leman go Machine Learning: The Story so far. J. Mach. Learn. Res. 24: 333:1-333:59 (2023) - 2022
- [j12]Franka Bause, Erich Schubert
, Nils M. Kriege:
EmbAssi: embedding assignment costs for similarity search in large graph databases. Data Min. Knowl. Discov. 36(5): 1728-1755 (2022) - 2021
- [j11]Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling:
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs. Theor. Comput. Sci. 852: 172-184 (2021) - 2020
- [j10]Nils M. Kriege, Fredrik D. Johansson, Christopher Morris:
A survey on graph kernels. Appl. Netw. Sci. 5(1): 6 (2020) - [j9]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Classifying Dissemination Processes in Temporal Graphs. Big Data 8(5): 363-378 (2020) - [j8]Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. J. Graph Algorithms Appl. 24(3): 155-170 (2020) - 2019
- [j7]Pierre-Louis Giscard, Nils M. Kriege, Richard C. Wilson:
A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. Algorithmica 81(7): 2716-2737 (2019) - [j6]Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel:
A unifying view of explicit and implicit feature maps of graph kernels. Data Min. Knowl. Discov. 33(6): 1505-1547 (2019) - 2018
- [j5]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On maximum common subgraph problems in series-parallel graphs. Eur. J. Comb. 68: 79-95 (2018) - [j4]Nils M. Kriege, Andre Droschinsky, Petra Mutzel:
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. J. Graph Algorithms Appl. 22(4): 607-616 (2018) - 2017
- [j3]Till Schäfer, Nils M. Kriege, Lina Humbeck, Karsten Klein, Oliver Koch, Petra Mutzel:
Scaffold Hunter: a comprehensive visual analytics framework for drug discovery. J. Cheminformatics 9(1): 28:1-28:18 (2017) - 2014
- [j2]Karsten Klein, Oliver Koch, Nils M. Kriege, Petra Mutzel, Till Schäfer:
Scaffold hunter: visual analysis of biological activity data. J. Cheminformatics 6(S-1): 33 (2014) - [j1]Nils M. Kriege, Petra Mutzel, Till Schäfer:
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics. J. Graph Algorithms Appl. 18(4): 577-602 (2014)
Conference and Workshop Papers
- 2024
- [c37]Lorenz Kummer, Samir Moustafa, Sebastian Schrittwieser, Wilfried N. Gansterer, Nils M. Kriege:
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent. KDD 2024: 1428-1439 - [c36]Franka Bause, Christian Permann, Nils M. Kriege:
Approximating the Graph Edit Distance with Compact Neighborhood Representations. ECML/PKDD (5) 2024: 300-318 - [c35]Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege:
On the Two Sides of Redundancy in Graph Neural Networks. ECML/PKDD (6) 2024: 371-388 - 2023
- [c34]Lutz Oettershagen, Nils M. Kriege, Petra Mutzel:
A Higher-Order Temporal H-Index for Evolving Networks. KDD 2023: 1770-1782 - [c33]Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel:
A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks. SDM 2023: 19-27 - 2022
- [c32]Franka Bause, Nils Morten Kriege:
Gradual Weisfeiler-Leman: Slow and Steady Wins the Race. LoG 2022: 20 - [c31]Nils M. Kriege:
Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited. NeurIPS 2022 - [c30]Lutz Oettershagen, Petra Mutzel, Nils M. Kriege:
Temporal Walk Centrality: Ranking Nodes in Evolving Networks. WWW 2022: 1640-1650 - 2021
- [c29]Christopher Morris, Matthias Fey, Nils M. Kriege:
The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs. IJCAI 2021: 4543-4550 - [c28]Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege:
Metric Indexing for Graph Similarity Search. SISAP 2021: 323-336 - 2020
- [c27]Matthias Fey, Jan Eric Lenssen, Christopher Morris, Jonathan Masci, Nils M. Kriege:
Deep Graph Matching Consensus. ICLR 2020 - [c26]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Temporal Graph Kernels for Classifying Dissemination Processes. SDM 2020: 496-504 - 2019
- [c25]Nils M. Kriege:
Deep Weisfeiler-Lehman assignment kernels via multiple kernel learning. ESANN 2019 - [c24]Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson:
Computing Optimal Assignments in Linear Time for Approximate Graph Matching. ICDM 2019: 349-358 - [c23]Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils M. Kriege, Sven Rahmann:
Protein Complex Similarity Based on Weisfeiler-Lehman Labeling. SISAP 2019: 308-322 - 2018
- [c22]Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler:
A Property Testing Framework for the Theoretical Expressivity of Graph Kernels. IJCAI 2018: 2348-2354 - [c21]Christine Dahn, Nils M. Kriege, Petra Mutzel:
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. IWOCA 2018: 141-152 - [c20]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Largest Weight Common Subtree Embeddings with Distance Penalties. MFCS 2018: 54:1-54:15 - [c19]Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert:
Recognizing Cuneiform Signs Using Graph Based Methods. COST@SDM 2018: 31-44 - 2017
- [c18]Nils M. Kriege, Christopher Morris:
Recent Advances in Kernel-Based Graph Classification. ECML/PKDD (3) 2017: 388-392 - [c17]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. SOFSEM 2017: 309-321 - 2016
- [c16]Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel:
Faster Kernels for Graphs with Continuous Attributes via Hashing. ICDM 2016: 1095-1100 - [c15]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. MFCS 2016: 33:1-33:14 - [c14]Nils M. Kriege, Pierre-Louis Giscard, Richard C. Wilson:
On Valid Optimal Assignment Kernels and Applications to Graph Classification. NIPS 2016: 1615-1623 - 2014
- [c13]Nils M. Kriege, Marion Neumann, Kristian Kersting, Petra Mutzel:
Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels. ICDM 2014: 881-886 - [c12]Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel:
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. ISAAC 2014: 81-93 - [c11]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. IWOCA 2014: 200-212 - [c10]Nils M. Kriege, Petra Mutzel:
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. MFCS (2) 2014: 505-516 - [c9]Nils M. Kriege, Petra Mutzel, Till Schäfer:
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search. WALCOM 2014: 90-101 - 2013
- [c8]Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel:
MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP 2013: 515-524 - [c7]Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel:
The Landscape Metaphor for Visualization of Molecular Similarities. VISIGRAPP (Selected Papers) 2013: 85-100 - 2012
- [c6]Marianna D'Addario, Nils M. Kriege, Sven Rahmann:
Designing q-Unique DNA Sequences with Integer Linear Programs and Euler Tours in De Bruijn Graphs. GCB 2012: 82-92 - [c5]Karsten Klein, Nils M. Kriege, Petra Mutzel:
Scaffold Hunter - Visual Analysis of Chemical Compound Databases. GRAPP/IVAPP 2012: 626-635 - [c4]Nils M. Kriege, Petra Mutzel:
Subgraph Matching Kernels for Attributed Graphs. ICML 2012 - [c3]Karsten Klein, Nils M. Kriege, Petra Mutzel:
Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space. VISIGRAPP (Selected Papers) 2012: 176-192 - 2011
- [c2]Karsten Klein, Nils M. Kriege, Petra Mutzel:
CT-index: Fingerprint-based graph indexing combining cycles and trees. ICDE 2011: 1115-1126 - 2009
- [c1]Karsten Klein, Nils M. Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel:
Scaffold Hunter - Interactive Exploration of Chemical Space. GD 2009: 426-427
Parts in Books or Collections
- 2022
- [p3]Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils M. Kriege, Sven Rahmann:
Protein Complex Similarity. Mach. Learn. under Resour. Constraints Vol. 3 (3) 2022: 85-102 - [p2]Nils M. Kriege, Christopher Morris:
The Weisfeiler-Leman Method for Machine Learning with Graphs. Mach. Learn. under Resour. Constraints Vol. 1 (1) 2022: 116-128 - [p1]Andre Droschinsky, Lina Humbeck, Oliver Koch, Nils M. Kriege, Petra Mutzel, Till Schäfer:
Graph-Based Methods for Rational Drug Design. Algorithms for Big Data 2022: 76-96
Editorship
- 2021
- [e1]Nora Reyes, Richard Connor, Nils M. Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen:
Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings. Lecture Notes in Computer Science 13058, Springer 2021, ISBN 978-3-030-89656-0 [contents]
Reference Works
- 2019
- [r1]Oliver Koch, Nils M. Kriege, Lina Humbeck:
Chemical Similarity and Substructure Searches. Encyclopedia of Bioinformatics and Computational Biology (2) 2019: 640-649
Informal and Other Publications
- 2023
- [i32]Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash:
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. CoRR abs/2302.00458 (2023) - [i31]Lutz Oettershagen, Nils M. Kriege, Petra Mutzel:
A Higher-Order Temporal H-Index for Evolving Networks. CoRR abs/2305.16001 (2023) - [i30]Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege:
Non-Redundant Graph Neural Networks with Improved Expressiveness. CoRR abs/2310.04190 (2023) - [i29]Lorenz Kummer, Samir Moustafa, Nils M. Kriege, Wilfried N. Gansterer:
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent. CoRR abs/2311.01205 (2023) - [i28]Franka Bause, Christian Permann, Nils M. Kriege:
Approximating the Graph Edit Distance with Compact Neighborhood Representations. CoRR abs/2312.04123 (2023) - 2022
- [i27]Lutz Oettershagen, Petra Mutzel, Nils M. Kriege:
Temporal Walk Centrality: Ranking Nodes in Evolving Networks. CoRR abs/2202.03706 (2022) - [i26]Nils M. Kriege:
Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited. CoRR abs/2205.10914 (2022) - [i25]Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel:
A Temporal Graphlet Kernel for Classifying Dissemination in Evolving Networks. CoRR abs/2209.07332 (2022) - [i24]Franka Bause, Nils M. Kriege:
Gradual Weisfeiler-Leman: Slow and Steady Wins the Race. CoRR abs/2209.09048 (2022) - 2021
- [i23]Christopher Morris, Matthias Fey, Nils M. Kriege:
The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs. CoRR abs/2105.05911 (2021) - [i22]Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege:
Metric Indexing for Graph Similarity Search. CoRR abs/2110.01283 (2021) - [i21]Franka Bause, Erich Schubert, Nils M. Kriege:
EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases. CoRR abs/2111.07761 (2021) - [i20]Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, Karsten M. Borgwardt:
Weisfeiler and Leman go Machine Learning: The Story so far. CoRR abs/2112.09992 (2021) - 2020
- [i19]Matthias Fey, Jan Eric Lenssen, Christopher Morris, Jonathan Masci, Nils M. Kriege:
Deep Graph Matching Consensus. CoRR abs/2001.09621 (2020) - [i18]Christopher Morris, Nils M. Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, Marion Neumann:
TUDataset: A collection of benchmark datasets for learning with graphs. CoRR abs/2007.08663 (2020) - 2019
- [i17]Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson:
Computing Optimal Assignments in Linear Time for Graph Matching. CoRR abs/1901.10356 (2019) - [i16]Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. CoRR abs/1903.06061 (2019) - [i15]Nils M. Kriege, Fredrik D. Johansson, Christopher Morris:
A Survey on Graph Kernels. CoRR abs/1903.11835 (2019) - [i14]Nils M. Kriege:
Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning. CoRR abs/1908.06661 (2019) - [i13]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Temporal Graph Kernels for Classifying Dissemination Processes. CoRR abs/1911.05496 (2019) - 2018
- [i12]Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert:
Recognizing Cuneiform Signs Using Graph Based Methods. CoRR abs/1802.05908 (2018) - [i11]Christine Dahn, Nils M. Kriege, Petra Mutzel:
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. CoRR abs/1803.10983 (2018) - [i10]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Largest Weight Common Subtree Embeddings with Distance Penalties. CoRR abs/1805.00821 (2018) - [i9]Nils M. Kriege, Andre Droschinsky, Petra Mutzel:
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. CoRR abs/1805.10754 (2018) - [i8]Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling:
Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs. CoRR abs/1812.03074 (2018) - 2017
- [i7]Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel:
A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels. CoRR abs/1703.00676 (2017) - [i6]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. CoRR abs/1708.02772 (2017) - 2016
- [i5]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. CoRR abs/1602.07210 (2016) - [i4]Nils M. Kriege, Pierre-Louis Giscard, Richard C. Wilson:
On Valid Optimal Assignment Kernels and Applications to Graph Classification. CoRR abs/1606.01141 (2016) - [i3]Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel:
Faster Kernels for Graphs with Continuous Attributes via Hashing. CoRR abs/1610.00064 (2016) - [i2]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. CoRR abs/1610.08739 (2016) - [i1]Pierre-Louis Giscard, Nils M. Kriege, Richard C. Wilson:
A general purpose algorithm for counting simple cycles and simple paths of any length. CoRR abs/1612.05531 (2016)
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-09-14 02:06 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:
