No. Title Author Year
1 Graph Embeddings: Theory meets Practice (Dagstuhl Seminar 22132) Grohe, Martin et al. 2022
2 Graph Similarity Based on Matrix Norms Gervens, Timo et al. 2022
3 Homomorphism Tensors and Linear Equations Grohe, Martin et al. 2022
4 A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk) Grohe, Martin 2021
5 Database Repairing with Soft Functional Dependencies Carmeli, Nofar et al. 2021
6 Logarithmic Weisfeiler-Leman Identifies All Planar Graphs Grohe, Martin et al. 2021
7 Infinite Probabilistic Databases Grohe, Martin et al. 2020
8 Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk) Grohe, Martin 2020
9 A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus Grohe, Martin et al. 2019
10 Symmetry and Similarity (Invited Talk) Grohe, Martin 2019
11 The Complexity of Homomorphism Indistinguishability Böker, Jan et al. 2019
12 An Improved Isomorphism Test for Bounded-Tree-Width Graphs Grohe, Martin et al. 2018
13 Graph Similarity and Approximate Isomorphism Grohe, Martin et al. 2018
14 Lovász Meets Weisfeiler and Leman Dell, Holger et al. 2018
15 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) Grohe, Martin et al. 2018
16 Quasi-4-Connected Components Grohe, Martin 2016
17 Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) Biere, Armin et al. 2015
18 Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk) Grohe, Martin 2014
19 Characterisations of Nowhere Dense Graphs (Invited Talk) Grohe, Martin et al. 2013
20 Pebble Games and Linear Equations Grohe, Martin et al. 2012
21 Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) Grohe, Martin et al. 2011
22 L-Recursion and a new Logic for Logarithmic Space Grohe, Martin et al. 2011
23 09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability Bulatov, Andrei A. et al. 2010
24 09441 Executive Summary -- The Constraint Satisfaction Problem: Complexity and Approximability Bulatov, Andrei A. et al. 2010
25 A Complexity Dichotomy for Partition Functions with Mixed Signs Goldberg, Leslie Ann et al. 2009
26 Enumerating Homomorphisms Bulatov, Andrei A. et al. 2009
27 05301 Abstracts Collection -- Exact Algorithms and Fixed-Parameter Tractability Downey, Rod et al. 2006
28 05301 Summary -- Exact Algorithms and Fixed-Parameter Tractability Downey, Rod et al. 2006
29 Constraint Satisfaction with Succinctly Specified Relations Chen, Hubie et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 29


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI