Parameterized complexity of reconfiguration of atoms

DOI10.1007/978-3-030-96731-4_22OpenAlexW3186338466MaRDI QIDQ2154105

Naomi Nishimura, Amer E. Mouawad, Alexandre Cooper, Stephanie Maaz

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2107.12267

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of reconfiguration problems
• Reconfiguration of list edge-colorings in a graph
• Dominating sets reconfiguration under token sliding
• Recoloring graphs of treewidth 2
• Introduction to reconfiguration
• Connectedness of the graph of vertex-colourings
• Parametrized complexity theory.
• The complexity of change
• Color-coding
• The Complexity of Independent Set Reconfiguration on Bipartite Graphs
• Parameterized Algorithms
• The steiner problem in graphs
• Reconfigurations in Graphs and Grids

This page was built for publication: Parameterized complexity of reconfiguration of atoms