Sebastian Kuhnert

According to our database, Sebastian Kuhnert authored at least 21 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

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

2021

Parameterized Complexity of Small Weight Automorphisms and Isomorphisms.

Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán

Algorithmica, 2021

2019

A Space-Efficient Separator Algorithm for Planar Graphs.

Ryo Ashida, Sebastian Kuhnert, Osamu Watanabe

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

2017

Circular-arc hypergraphs: Rigidity via connectedness.

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

Discret. Appl. Math., 2017

Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable.

Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Space efficient algorithms for graph isomorphism and representation.

Sebastian Kuhnert

PhD thesis, 2016

Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace.

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

J. Discrete Algorithms, 2016

On the isomorphism problem for Helly circular-arc graphs.

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

Inf. Comput., 2016

Parameterized Complexity of Small Weight Automorphisms.

Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán

Electron. Colloquium Comput. Complex., 2016

2015

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

2014

Solving Linear Equations Parameterized by Hamming Weight.

Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán

Electron. Colloquium Comput. Complex., 2014

2013

Helly Circular-Arc Graph Isomorphism is in Logspace.

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

Electron. Colloquium Comput. Complex., 2013

2012

The isomorphism problem for k-trees is complete for logspace.

Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert

Inf. Comput., 2012

Interval graph representation with given interval and intersection lengths.

Sebastian Kuhnert, Johannes Köbler, Osamu Watanabe

Electron. Colloquium Comput. Complex., 2012

Approximate Graph Isomorphism.

Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev

Electron. Colloquium Comput. Complex., 2012

Around and Beyond the Isomorphism Problem for Interval Graphs.

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

Bull. EATCS, 2012

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

CoRR, 2012

2011

Interval Graphs: Canonical Representations in Logspace.

Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky

SIAM J. Comput., 2011

2010

Interval Graphs: Canonical Representation in Logspace.

Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky

Electron. Colloquium Comput. Complex., 2010

2009

The Isomorphism Problem for k-Trees is Complete for Logspace.

Johannes Köbler, Sebastian Kuhnert

Electron. Colloquium Comput. Complex., 2009

2007

Efficient Edge-Finding on Unary Resources with Optional Activities.

Sebastian Kuhnert

Proceedings of the Applications of Declarative Programming and Knowledge Management, 2007