Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kuhnert, Sebastian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the isomorphism problem for decision trees and decision lists
V. Arvind
,
Johannes Köbler
,
Sebastian Kuhnert
,
Gaurav Rattan
,
Yadu Vasudev
Theoretical Computer Science
590
, 2015, pp. 38-54
Helly circular-arc graph isomorphism is in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Oleg Verbitsky
Lecture Notes in Computer Science
8087
, 2013, pp. 631-642
The isomorphism problem for
k
-trees is complete for logspace
V. Arvind
,
Bireswar Das
,
Johannes Köbler
,
Sebastian Kuhnert
Information and Computation
217
, 2012, pp. 1-11
Approximate graph isomorphism
Vikraman Arvind
,
Johannes Köbler
,
Sebastian Kuhnert
,
Yadu Vasudev
Lecture Notes in Computer Science
7464
, 2012, pp. 100-111
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Oleg Verbitsky
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 387-399
Interval graph representation with given interval and intersection lengths
Johannes Köbler
,
Sebastian Kuhnert
,
Osamu Watanabe
Lecture Notes in Computer Science
7676
, 2012, pp. 517-526
Interval graphs: Canonical representations in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Bastian Laubner
,
Oleg Verbitsky
SIAM Journal on Computing
40
(5), 2011, pp. 1292-1315
Interval graphs: Canonical representation in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Bastian Laubner
,
Oleg Verbitsky
Lecture Notes in Computer Science
6198
, 2010, pp. 384-395
The isomorphism problem for
k
-trees is complete for logspace
Johannes Köbler
,
Sebastian Kuhnert
Lecture Notes in Computer Science
5734
, 2009, pp. 537-548