Tantau, Till

1. Where First-Order and Monadic Second-Order Logic Coincide
   2012/04/27 by Elberfeld, Michael, Grohe, Martin, Tantau, Till · 1 citation
   #Computational Complexity (cs.CC) #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
2. Fast Parallel Fixed-Parameter Algorithms via Color Coding
   2015/09/23 by Bannach, Max, Stockhusen, Christoph, Tantau, Till · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.1.3 #FOS: Computer and information sciences
3. Computing Hitting Set Kernels By AC⁰-Circuits
   2018/01/02 by Bannach, Max, Tantau, Till · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2
4. Computing Kernels in Parallel: Lower and Upper Bounds
   2018/07/10 by Bannach, Max, Tantau, Till · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
5. On the Descriptive Complexity of Vertex Deletion Problems
   2024/06/26 by Bannach, Max, Chudigiewitsch, Florian, Tantau, Till · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)