Daniel Neuen

SIAM J. Discret. Math., March, 2024

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees.

[BibT_eX]

[DOI]

Sandra Kiefer

CoRR, 2024

Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

A Faster Isomorphism Test for Graphs of Small Degree.

[BibT_eX]

[DOI]

SIAM J. Comput., December, 2023

Isomorphism Testing for Graphs Excluding Small Minors.

[BibT_eX]

[DOI]

Daniel Wiebking

SIAM J. Comput., February, 2023

Canonisation and Definability for Graphs of Bounded Rank Width.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., January, 2023

Isomorphism for Tournaments of Small Twin Width.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Computing Square Colorings on Bounded-Treewidth and Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

The Iteration Number of the Weisfeiler-Leman Algorithm.

[BibT_eX]

[DOI]

Moritz Lichter

LICS, 2023

Approximate Monotone Local Search for Weighted Problems.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Hypergraph Isomorphism for Groups with Restricted Composition Factors.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs.

[BibT_eX]

[DOI]

Sandra Kiefer

SIAM J. Discret. Math., 2022

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results.

[BibT_eX]

[DOI]

CoRR, 2022

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Study of Weisfeiler-Leman Colorings on Planar Graphs.

[BibT_eX]

[DOI]

Sandra Kiefer

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Isomorphism, canonization, and definability for graphs of bounded rank width.

[BibT_eX]

[DOI]

Commun. ACM, 2021

Recent advances on the graph isomorphism problem.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2021

2020

An Improved Isomorphism Test for Bounded-tree-width Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

2018

Towards faster isomorphism tests for bounded-degree graphs.

[BibT_eX]

[DOI]

CoRR, 2018

An exponential lower bound for individualization-refinement algorithms for graph isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Benchmark Graphs for Practical Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Graph Isomorphism for Unit Square Graphs.

[BibT_eX]

[DOI]