Author of the publication

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

, , , , , , , , , , , and . DNA, volume 276 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). J. Inf. Process., (2020)Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines., , , , , , and . SAND, volume 257 of LIPIcs, page 5:1-5:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games., and . FUN, volume 100 of LIPIcs, page 14:1-14:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Construction, enumeration, and optimization of perfect phylogenies on multi-state data., , and . ICCABS, page 1-6. IEEE Computer Society, (2015)This Game Is Not Going To Analyze Itself., , , , , , , and . CoRR, (2023)Complexity of Reconfiguration in Surface Chemical Reaction Networks., , , , , , , , , and 2 other author(s). DNA, volume 276 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Complexity of Solo Chess with Unlimited Moves., , , , , and . CoRR, (2023)Characterizing the Decidability of Finite State Automata Team Games with Communication., and . GandALF, volume 370 of EPTCS, page 213-228. (2022)