Parameterized complexity of small weight automorphisms and isomorphisms
type: Item
instance of: scholarly article
title: Parameterized complexity of small weight automorphisms and isomorphisms
author: Vikraman Arvind
author: Johannes Köbler
author: Sebastian Kuhnert
author: Jacobo Torán
published in: Algorithmica
publication date: 2022-01-18T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7458812
zbMATH Keywords: parameterized complexity
zbMATH Keywords: graph automorphism
zbMATH Keywords: graph isomorphism
MaRDI profile type: Publication
full work available at URL: s00453-021-00867-y
OpenAlex ID: W3193710893
cites work: Parameterized Complexity of Small Weight Automorphisms.
cites work: Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
cites work: The intractability of computing the minimum distance of a code
cites work: Hardness of approximating the minimum distance of a linear code
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Solving linear equations parameterized by Hamming weight
cites work: Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
cites work: Parameterized Intractability of Even Set and Shortest Vector Problem
cites work: Isomorphism of (mis)Labeled Graphs
cites work: Q4882944
cites work: Q3020034
cites work: Parametrized complexity theory.
cites work: Color-coding
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: A note on the graph isomorphism counting problem
cites work: Q4273947
cites work: Q5617749
DOI: 10.1007/S00453-021-00867-Y
description: scientific article; zbMATH DE number 7458812