( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges.

, , , и . MFCS, том 272 из LIPIcs, стр. 46:1-46:8. 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.

Tomohiro Shibata

Penporn Koanantakool

Tomohiro Genka

Tomohiro Hayashi

 

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

Binary Matrix Completion Under Diameter Constraints., , и . STACS, том 187 из LIPIcs, стр. 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Determinantal Sieving., , и . SODA, стр. 377-423. SIAM, (2024)Parameterized Algorithms for Colored Clustering., , , и . AAAI, стр. 4400-4408. AAAI Press, (2023)The Complexity of Finding Fair Many-to-One Matchings., и . ACM Trans. Algorithms, 20 (2): 17 (апреля 2024)FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges., , , и . MFCS, том 272 из LIPIcs, стр. 46:1-46:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Parameterized Complexity of Geodetic Set., и . IPEC, том 180 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication., , и . CoRR, (2024)Parameterized Algorithms for Matrix Completion with Radius Constraints., , и . CPM, том 161 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees., , и . IPEC, том 249 из LIPIcs, стр. 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing., , , и . IPEC, том 214 из LIPIcs, стр. 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)