Author of the publication

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

, , , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 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. 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

Approximation Algorithms for BalancedCC Multiwinner Rules., , , and . AAMAS, page 494-502. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Parameterized Algorithms for Module Map Problems., and . ISCO, volume 10856 of Lecture Notes in Computer Science, page 376-388. Springer, (2018)Exact Algorithms for Group Closeness Centrality., , , and . ACDA, page 1-12. SIAM, (2023)Enumerating connected induced subgraphs: Improved delay and experimental comparison., and . Discret. Appl. Math., (2021)On Critical Node Problems with Vulnerable Vertices., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 494-508. Springer, (2022)On Computing Optimal Tree Ensembles., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 17364-17374. PMLR, (2023)Computing Dense and Sparse Subgraphs of Weakly Closed Graphs., , and . ISAAC, volume 181 of LIPIcs, page 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Essentially Tight Kernels For (Weakly) Closed Graphs., , and . ISAAC, volume 212 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exploiting c-Closure in Kernelization Algorithms for Graph Problems., , and . ESA, volume 173 of LIPIcs, page 65:1-65:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs., , , and . Theory Comput. Syst., 66 (5): 1019-1045 (2022)