From post

On Finding Short Reconfiguration Sequences Between Independent Sets.

, , и . ISAAC, том 248 из LIPIcs, стр. 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

 

Другие публикации лиц с тем же именем

Parameterized complexity of reconfiguration of atoms., , , и . CoRR, (2021)Token Sliding on Graphs of Girth Five., , , , и . Algorithmica, 86 (2): 638-655 (февраля 2024)On Girth and the Parameterized Complexity of Token Sliding and Token Jumping., , , , и . Algorithmica, 83 (9): 2914-2951 (2021)Vertex Cover Reconfiguration and Beyond., , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 452-463. Springer, (2014)Reconfiguration of Dominating Sets., , и . COCOON, том 8591 из Lecture Notes in Computer Science, стр. 405-416. Springer, (2014)Vertex Cover Reconfiguration and Beyond., , , и . Algorithms, 11 (2): 20 (2018)Packing Cycles Faster Than Erdos-Posa., , , и . SIAM J. Discret. Math., 33 (3): 1194-1215 (2019)Lossy Kernels for Connected Dominating Set on Sparse Graphs., , , , и . SIAM J. Discret. Math., 33 (3): 1743-1771 (2019)On scalable parallel recursive backtracking., , , и . J. Parallel Distributed Comput., (2015)Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach., , и . CLUSTER, стр. 518. IEEE Computer Society, (2015)