From post

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.

, , , , и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 283-297. Springer, (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.

 

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

Kernelizing Temporal Exploration Problems., , , и . IPEC, том 285 из LIPIcs, стр. 1:1-1:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)PACE Solver Description: Zygosity., , , , , и . IPEC, том 285 из LIPIcs, стр. 39:1-39:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Width Notions for Ordering-Related Problems., , , и . FSTTCS, том 182 из LIPIcs, стр. 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Diversity in Kemeny Rank Aggregation: A Parameterized Approach., , , , и . IJCAI, стр. 10-16. ijcai.org, (2021)Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs., , , , и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 283-297. Springer, (2023)On the Complexity of Intersection Non-emptiness for Star-Free Language Classes., , , , , , и . FSTTCS, том 213 из LIPIcs, стр. 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Cluster Editing with Overlapping Communities., , , , и . IPEC, том 285 из LIPIcs, стр. 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Three Is Enough for Steiner Trees., и . SEA, том 190 из LIPIcs, стр. 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Order Reconfiguration Under Width Constraints., , , и . MFCS, том 202 из LIPIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Synchronization and Diversity of Solutions., , , и . AAAI, стр. 11516-11524. AAAI Press, (2023)