No. |
Title |
Author |
Year |
---|

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

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

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

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

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

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

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

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

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

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