Köbler, Johannes

1. On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
   2018/11/09 by V. Arvind, Frank Fuhlbrück, Arvind, V. +5 · 3 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Topological and Geometric Data Analysis
2. Graph Isomorphism, Color Refinement, and Compactness
   2015/02/04 by Arvind, V., Köbler, Johannes, Rattan, Gaurav +1 · 2 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
3. The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
   2016/06/14 by Arvind, V., Fuhlbrück, Frank, Köbler, Johannes +2 · 1 citation
   #Computational Complexity (cs.CC) #F.2.0 #FOS: Computer and information sciences
4. Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
   2017/09/28 by V. Arvind, Arvind, V., Johannes Köbler +5 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Computational Complexity (cs.CC) #F.1.3 #F.2 #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory
5. Identifiability of Graphs with Small Color Classes by the\n Weisfeiler-Leman Algorithm
   2019/07/05 by Frank Fuhlbrück, Fuhlbrück, Frank, Johannes Köbler +3 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory