Sebastian Kuhnert

ORCID

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 13

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

IPEC

MFCS

Humboldt University of Berlin (PHD)

Education History

Humboldt University of Berlin

PHD

Publications

Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. ACM Trans. Comput. Theory 14 (2) (2022)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. Algorithmica 83 (12) (2021)
Ryo Ashida, Sebastian Kuhnert, Osamu Watanabe
A Space-Efficient Separator Algorithm for Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. IPEC (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. CoRR (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms. STACS (2017)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Circular-arc hypergraphs: Rigidity via connectedness. Discret. Appl. Math. 217 (2017)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace. J. Discrete Algorithms (2016)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms. Electron. Colloquium Comput. Complex. 23 (2016)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
On the isomorphism problem for Helly circular-arc graphs. Inf. Comput. 247 (2016)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. MFCS (2016)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. Algorithmica 75 (2) (2016)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. CoRR (2016)
Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe
Interval graph representation with given interval and intersection lengths. J. Discrete Algorithms 34 (2015)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. 590 (2015)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
On the Isomorphism Problem for Helly Circular-Arc Graphs. CoRR (2014)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. IPEC (2014)
Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. Electron. Colloquium Comput. Complex. 21 (2014)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Circular-arc hypergraphs: Rigidity via Connectedness. CoRR (2013)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Helly Circular-Arc Graph Isomorphism Is in Logspace. MFCS (2013)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
On the Isomorphism Problem for Decision Trees and Decision Lists. FCT (2013)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Helly Circular-Arc Graph Isomorphism is in Logspace. Electron. Colloquium Comput. Complex. 20 (2013)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev
Approximate Graph Isomorphism. MFCS (2012)
Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev
Approximate Graph Isomorphism. Electron. Colloquium Comput. Complex. 19 (2012)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. FSTTCS (2012)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space CoRR (2012)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert
The isomorphism problem for k-trees is complete for logspace. Inf. Comput. 217 (2012)
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
Around and Beyond the Isomorphism Problem for Interval Graphs. Bull. EATCS 107 (2012)
Sebastian Kuhnert, Johannes Köbler, Osamu Watanabe
Interval graph representation with given interval and intersection lengths. Electron. Colloquium Comput. Complex. 19 (2012)
Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe
Interval Graph Representation with Given Interval and Intersection Lengths. ISAAC (2012)
Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky
Interval Graphs: Canonical Representations in Logspace. SIAM J. Comput. 40 (5) (2011)
Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky
Interval Graphs: Canonical Representation in Logspace. Electron. Colloquium Comput. Complex. 17 (2010)
Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky
Interval Graphs: Canonical Representation in Logspace. ICALP (1) (2010)
Johannes Köbler, Sebastian Kuhnert
The Isomorphism Problem for k-Trees Is Complete for Logspace. MFCS (2009)
Johannes Köbler, Sebastian Kuhnert
The Isomorphism Problem for k-Trees is Complete for Logspace. Electron. Colloquium Comput. Complex. 16 (2009)
Sebastian Kuhnert
Efficient Edge-Finding on Unary Resources with Optional Activities. INAP/WLP (2007)

Sebastian Kuhnert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sebastian Kuhnert