Author Info
Name
Affiliation
Papers
SEBASTIAN KUHNERT
Institut für Informatik, Humboldt-Universität zu Berlin, Germany
17
Collaborators
Citations 
PageRank 
14
36
6.52
Referers 
Referees 
References 
61
277
275
Search Limit
100277
Title
Citations
PageRank
Year
A Space-Efficient Separator Algorithm For Planar Graphs00.342019
Circular-arc hypergraphs: Rigidity via Connectedness.00.342017
Parameterized Complexity of Small Weight Automorphisms.00.342017
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable.00.342017
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.00.342016
Solving Linear Equations Parameterized by Hamming Weight.00.342014
On the isomorphism problem for Helly circular-arc graphs.10.352014
Helly Circular-Arc Graph Isomorphism Is in Logspace.60.492013
On the isomorphism problem for decision trees and decision lists00.342013
Approximate graph isomorphism50.432012
Around and Beyond the Isomorphism Problem for Interval Graphs.00.342012
Interval Graph Representation with Given Interval and Intersection Lengths.20.382012
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace.30.402012
The isomorphism problem for k-trees is complete for logspace50.422012
Interval graphs: canonical representation in logspace70.492010
The Isomorphism Problem for k-Trees Is Complete for Logspace50.422009
Efficient Edge-Finding on Unary Resources with Optional Activities20.432007