No. Title Author Year
1 A Characterization of Individualization-Refinement Trees Anders, Markus et al. 2021
2 Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time Lichter, Moritz et al. 2021
3 Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case Anders, Markus et al. 2021
4 Parallel Computation of Combinatorial Symmetries Anders, Markus et al. 2021
5 Resolution with Symmetry Rule Applied to Linear Equations Schweitzer, Pascal et al. 2021
6 Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms Anders, Markus et al. 2021
7 An Improved Isomorphism Test for Bounded-Tree-Width Graphs Grohe, Martin et al. 2018
8 Space-Efficient Algorithms for Longest Increasing Subsequence Kiyomi, Masashi et al. 2018
9 A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry Schweitzer, Pascal 2017
10 Benchmark Graphs for Practical Graph Isomorphism Neuen, Daniel et al. 2017
11 Canonizing Graphs of Bounded Tree Width in Logspace Elberfeld, Michael et al. 2016
12 The Graph Isomorphism Problem (Dagstuhl Seminar 15511) Babai, László et al. 2016
13 Towards an Isomorphism Dichotomy for Hereditary Graph Classes Schweitzer, Pascal 2015
Current Page :
Number of result pages: 1
Number of documents: 13


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