Folgen
Sebastian Kuhnert
Sebastian Kuhnert
formerly Humboldt-Universität zu Berlin
Bestätigte E-Mail-Adresse bei sebastian-kuhnert.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Approximate graph isomorphism
V Arvind, J Köbler, S Kuhnert, Y Vasudev
MFCS 2012, 100-111, 2012
382012
Interval graphs: Canonical representations in logspace
J Köbler, S Kuhnert, B Laubner, O Verbitsky
SIAM Journal on Computing 40 (5), 1292-1315, 2011
382011
The isomorphism problem for k-trees is complete for logspace
V Arvind, B Das, J Köbler, S Kuhnert
Information and Computation 217, 1-11, 2012
24*2012
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
J Köbler, S Kuhnert, O Verbitsky
Journal of Discrete Algorithms 38, 38-49, 2016
23*2016
Interval graph representation with given interval and intersection lengths
J Köbler, S Kuhnert, O Watanabe
ISAAC 2012, 517-526, 2012
182012
Helly circular-arc graph isomorphism is in logspace
J Köbler, S Kuhnert, O Verbitsky
International Symposium on Mathematical Foundations of Computer Science, 631-642, 2013
172013
Interval graphs: Canonical representation in logspace
J Köbler, S Kuhnert, B Laubner, O Verbitsky
International Colloquium on Automata, Languages, and Programming, 384-395, 2010
142010
Solving linear equations parameterized by Hamming weight
V Arvind, J Köbler, S Kuhnert, J Torán
International Symposium on Parameterized and Exact Computation, 39-50, 2014
82014
Efficient edge-finding on unary resources with optional activities
S Kuhnert
INAP/WLP 2007, 38-53, 2009
72009
On the isomorphism problem for decision trees and decision lists
V Arvind, J Köbler, S Kuhnert, G Rattan, Y Vasudev
Theoretical Computer Science 590, 38-54, 2015
62015
On the isomorphism problem for Helly circular-arc graphs
J Köbler, S Kuhnert, O Verbitsky
Information and Computation 247, 266-277, 2016
52016
Circular-arc hypergraphs: Rigidity via Connectedness
J Köbler, S Kuhnert, O Verbitsky
arXiv preprint arXiv:1312.1172, 2013
4*2013
Around and beyond the isomorphism problem for interval graphs
J Köbler, S Kuhnert, O Verbitsky
Bulletin of the EATCS 107, 43-71, 2012
42012
A Space-Efficient Separator Algorithm for Planar Graphs
R ASHIDA, S KUHNERT, O WATANABE
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2019
22019
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
V Arvind, J Köbler, S Kuhnert, J Torán
arXiv preprint arXiv:1709.10063, 2017
22017
Parameterized Complexity of Small Weight Automorphisms
V Arvind, J Köbler, S Kuhnert, J Torán
STACS 2017, 7:1-7:13, 2017
22017
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
V Arvind, F Fuhlbrück, J Köbler, S Kuhnert, G Rattan
arXiv preprint arXiv:1606.04383, 2016
22016
Space efficient algorithms for graph isomorphism and representation
S Kuhnert
Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2016
2016
Effiziente Suchraumeinschränkung zur constraintbasierten Planung optionaler Aktivitäten auf exklusiven Ressourcen
S Kuhnert
Technische Universität Berlin, 2007
2007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–19