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 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201) |
Grohe, Martin et al. |
2022 |

5 |
A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk) |
Grohe, Martin |
2021 |

6 |
Database Repairing with Soft Functional Dependencies |
Carmeli, Nofar et al. |
2021 |

7 |
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs |
Grohe, Martin et al. |
2021 |

8 |
Infinite Probabilistic Databases |
Grohe, Martin et al. |
2020 |

9 |
Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk) |
Grohe, Martin |
2020 |

10 |
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus |
Grohe, Martin et al. |
2019 |

11 |
Symmetry and Similarity (Invited Talk) |
Grohe, Martin |
2019 |

12 |
The Complexity of Homomorphism Indistinguishability |
Böker, Jan et al. |
2019 |

13 |
An Improved Isomorphism Test for Bounded-Tree-Width Graphs |
Grohe, Martin et al. |
2018 |

14 |
Graph Similarity and Approximate Isomorphism |
Grohe, Martin et al. |
2018 |

15 |
Lovász Meets Weisfeiler and Leman |
Dell, Holger et al. |
2018 |

16 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) |
Grohe, Martin et al. |
2018 |

17 |
Quasi-4-Connected Components |
Grohe, Martin |
2016 |

18 |
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) |
Biere, Armin et al. |
2015 |

19 |
Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk) |
Grohe, Martin |
2014 |

20 |
Characterisations of Nowhere Dense Graphs (Invited Talk) |
Grohe, Martin et al. |
2013 |

21 |
Pebble Games and Linear Equations |
Grohe, Martin et al. |
2012 |

22 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) |
Grohe, Martin et al. |
2011 |

23 |
L-Recursion and a new Logic for Logarithmic Space |
Grohe, Martin et al. |
2011 |

24 |
09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability |
Bulatov, Andrei A. et al. |
2010 |

25 |
09441 Executive Summary -- The Constraint Satisfaction Problem: Complexity and Approximability |
Bulatov, Andrei A. et al. |
2010 |

26 |
A Complexity Dichotomy for Partition Functions with Mixed Signs |
Goldberg, Leslie Ann et al. |
2009 |

27 |
Enumerating Homomorphisms |
Bulatov, Andrei A. et al. |
2009 |

28 |
05301 Abstracts Collection -- Exact Algorithms and Fixed-Parameter Tractability |
Downey, Rod et al. |
2006 |

29 |
05301 Summary -- Exact Algorithms and Fixed-Parameter Tractability |
Downey, Rod et al. |
2006 |

30 |
Constraint Satisfaction with Succinctly Specified Relations |
Chen, Hubie et al. |
2006 |