From post

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.

 

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

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas., , , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 985-996. Springer, (2015)Packing Cycles Faster Than Erdos-Posa., , , и . ICALP, том 80 из LIPIcs, стр. 71:1-71:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Simultaneous Feedback Vertex Set: A Parameterized Perspective., , , и . STACS, том 47 из LIPIcs, стр. 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles., , , , и . SOFSEM, том 14519 из Lecture Notes in Computer Science, стр. 183-197. Springer, (2024)Bisection of Bounded Treewidth Graphs by Convolutions., , и . ESA, том 144 из LIPIcs, стр. 42:1-42:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On finding short reconfiguration sequences between independent sets., , и . J. Comput. Syst. Sci., (2025)Combinatorial and Algorithmic Aspects of Monadic Stability., , , , и . ISAAC, том 248 из LIPIcs, стр. 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Solution Discovery via Reconfiguration for Problems in P., , , , , , и . ICALP, том 297 из LIPIcs, стр. 76:1-76:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Reconfiguration on Sparse Graphs., , , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 506-517. Springer, (2015)The complexity of independent set reconfiguration on bipartite graphs., и . SODA, стр. 185-195. SIAM, (2018)