default search action
Sebastian Kuhnert
Person information
- affiliation: Humboldt University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Vikraman Arvind
, Frank Fuhlbrück
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. ACM Trans. Comput. Theory 14(2): 9:1-9:26 (2022) - 2021
- [j11]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. Algorithmica 83(12): 3567-3601 (2021)
2010 – 2019
- 2019
- [j10]Ryo Ashida, Sebastian Kuhnert, Osamu Watanabe:
A Space-Efficient Separator Algorithm for Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1007-1016 (2019) - 2017
- [j9]Johannes Köbler
Circular-arc hypergraphs: Rigidity via connectedness. Discret. Appl. Math. 217: 220-228 (2017) - [c12]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. IPEC 2017: 2:1-2:13 - [c11]Vikraman Arvind, Johannes Köbler
Parameterized Complexity of Small Weight Automorphisms. STACS 2017: 7:1-7:13 - [i12]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. CoRR abs/1709.10063 (2017) - 2016
- [b1]Sebastian Kuhnert:
Space efficient algorithms for graph isomorphism and representation. Humboldt University of Berlin, 2016 - [j8]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
Solving Linear Equations Parameterized by Hamming Weight. Algorithmica 75(2): 322-338 (2016) - [j7]Johannes Köbler, Sebastian Kuhnert
On the isomorphism problem for Helly circular-arc graphs. Inf. Comput. 247: 266-277 (2016) - [j6]Johannes Köbler, Sebastian Kuhnert
Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace. J. Discrete Algorithms 38-41: 38-49 (2016) - [c10]Vikraman Arvind, Frank Fuhlbrück
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. MFCS 2016: 13:1-13:14 - [i11]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. CoRR abs/1606.04383 (2016) - [i10]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Parameterized Complexity of Small Weight Automorphisms. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j5]Johannes Köbler, Sebastian Kuhnert
Interval graph representation with given interval and intersection lengths. J. Discrete Algorithms 34: 108-117 (2015) - [j4]Vikraman Arvind, Johannes Köbler
On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. 590: 38-54 (2015) - 2014
- [c9]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
Solving Linear Equations Parameterized by Hamming Weight. IPEC 2014: 39-50 - [i9]Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
On the Isomorphism Problem for Helly Circular-Arc Graphs. CoRR abs/1402.4642 (2014) - [i8]Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán:
Solving Linear Equations Parameterized by Hamming Weight. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c8]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
On the Isomorphism Problem for Decision Trees and Decision Lists. FCT 2013: 16-27 - [c7]Johannes Köbler, Sebastian Kuhnert
Helly Circular-Arc Graph Isomorphism Is in Logspace. MFCS 2013: 631-642 - [i7]Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Circular-arc hypergraphs: Rigidity via Connectedness. CoRR abs/1312.1172 (2013) - [i6]Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Helly Circular-Arc Graph Isomorphism is in Logspace. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j3]Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Around and Beyond the Isomorphism Problem for Interval Graphs. Bull. EATCS 107: 43-71 (2012) - [j2]Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert
The isomorphism problem for k-trees is complete for logspace. Inf. Comput. 217: 1-11 (2012) - [c6]Johannes Köbler, Sebastian Kuhnert
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. FSTTCS 2012: 387-399 - [c5]Johannes Köbler, Sebastian Kuhnert
Interval Graph Representation with Given Interval and Intersection Lengths. ISAAC 2012: 517-526 - [c4]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
Approximate Graph Isomorphism. MFCS 2012: 100-111 - [i5]Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space. CoRR abs/1202.4406 (2012) - [i4]Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev:
Approximate Graph Isomorphism. Electron. Colloquium Comput. Complex. TR12 (2012) - [i3]Sebastian Kuhnert, Johannes Köbler, Osamu Watanabe:
Interval graph representation with given interval and intersection lengths. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j1]Johannes Köbler, Sebastian Kuhnert
Interval Graphs: Canonical Representations in Logspace. SIAM J. Comput. 40(5): 1292-1315 (2011) - 2010
- [c3]Johannes Köbler, Sebastian Kuhnert
Interval Graphs: Canonical Representation in Logspace. ICALP (1) 2010: 384-395 - [i2]Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky:
Interval Graphs: Canonical Representation in Logspace. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c2]Johannes Köbler, Sebastian Kuhnert
The Isomorphism Problem for k-Trees Is Complete for Logspace. MFCS 2009: 537-548 - [i1]Johannes Köbler, Sebastian Kuhnert:
The Isomorphism Problem for k-Trees is Complete for Logspace. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [c1]Sebastian Kuhnert
Efficient Edge-Finding on Unary Resources with Optional Activities. INAP/WLP 2007: 38-53
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: