Parameterized complexity of graph isomorphism testing

Daniel Neuen

misc2026

Citation key: Neuen2026GI
Year: 2026
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Daniel Neuen, “Parameterized complexity of graph isomorphism testing,” Computer Science Review 61 (2026), Article 100918, DOI: 10.1016/j.cosrev.2026.100918.

Catalog connections

Conjectures citing this source

TCS-011Graph Isomorphism in Polynomial TimeTheoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Daniel Neuen
doi: 10.1016/j.cosrev.2026.100918
note: Daniel Neuen, “Parameterized complexity of graph isomorphism testing,” Computer Science Review 61 (2026), Article 100918, DOI: 10.1016/j.cosrev.2026.100918.
title: Parameterized complexity of graph isomorphism testing
year: 2026