Efficient Edge-Finding on Unary Resources with Optional Activities. - Sebastian Kuhnert (INAP/WLP, 2007)

The Isomorphism Problem for k-Trees is Complete for Logspace. - Johannes Köbler; Sebastian Kuhnert (Electron. Colloquium Comput. Complex., 2009)

Interval Graphs: Canonical Representation in Logspace. - Johannes Köbler; Sebastian Kuhnert; Bastian Laubner; Oleg Verbitsky 001 (Electron. Colloquium Comput. Complex., 2010)

Interval Graphs: Canonical Representations in Logspace. - Johannes Köbler; Sebastian Kuhnert; Bastian Laubner; Oleg Verbitsky 001 (SIAM J. Comput., 2011)

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space - Johannes Köbler; Sebastian Kuhnert; Oleg Verbitsky 001 (CoRR, 2012)

Around and Beyond the Isomorphism Problem for Interval Graphs. - Johannes Köbler; Sebastian Kuhnert; Oleg Verbitsky 001 (Bull. EATCS, 2012)

Approximate Graph Isomorphism. - Vikraman Arvind; Sebastian Kuhnert; Johannes Köbler; Yadu Vasudev (Electron. Colloquium Comput. Complex., 2012)

Interval graph representation with given interval and intersection lengths. - Sebastian Kuhnert; Johannes Köbler; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2012)

The isomorphism problem for k-trees is complete for logspace. - Vikraman Arvind; Bireswar Das; Johannes Köbler; Sebastian Kuhnert (Inf. Comput., 2012)

Helly Circular-Arc Graph Isomorphism is in Logspace. - Johannes Köbler; Sebastian Kuhnert; Oleg Verbitsky 001 (Electron. Colloquium Comput. Complex., 2013)

Solving Linear Equations Parameterized by Hamming Weight. - Vikraman Arvind; Sebastian Kuhnert; Johannes Köbler; Jacobo Torán (Electron. Colloquium Comput. Complex., 2014)

On the isomorphism problem for decision trees and decision lists. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan; Yadu Vasudev (Theor. Comput. Sci., 2015)

Parameterized Complexity of Small Weight Automorphisms. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (Electron. Colloquium Comput. Complex., 2016)

On the isomorphism problem for Helly circular-arc graphs. - Johannes Köbler; Sebastian Kuhnert; Oleg Verbitsky 001 (Inf. Comput., 2016)

Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace. - Johannes Köbler; Sebastian Kuhnert; Oleg Verbitsky 001 (J. Discrete Algorithms, 2016)

Space efficient algorithms for graph isomorphism and representation. - Sebastian Kuhnert (2016)

Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (IPEC, 2017)

Circular-arc hypergraphs: Rigidity via connectedness. - Johannes Köbler; Sebastian Kuhnert; Oleg Verbitsky 001 (Discret. Appl. Math., 2017)

A Space-Efficient Separator Algorithm for Planar Graphs. - Ryo Ashida; Sebastian Kuhnert; Osamu Watanabe 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (Algorithmica, 2021)

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan (ACM Trans. Comput. Theory, 2022)