Sebastian Kuhnert

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