From post

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.

, , и . FSTTCS, том 24 из LIPIcs, стр. 237-248. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)

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.

 

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

On the Parameterized Complexity of Edge-Linked Paths., , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 286-298. Springer, (2019)Parameterized Low-Rank Binary Matrix Approximation., , и . ICALP, том 107 из LIPIcs, стр. 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Editing to Connected f-Degree Graph., , , и . STACS, том 47 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , и . Algorithmica, 83 (2): 753-774 (2021)A Framework for Approximation Schemes on Disk Graphs., , , , и . SODA, стр. 2228-2241. SIAM, (2023)Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)., , , , и . SODA, стр. 2005-2031. SIAM, (2022)2-Approximating Feedback Vertex Set in Tournaments., , , , , и . SODA, стр. 1010-1018. SIAM, (2020)Parameterized Computational Geometry via Decomposition Theorems., , и . WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 15-27. Springer, (2019)On MAX-SAT with Cardinality Constraint., и . WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 118-133. Springer, (2024)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , и . ISAAC, том 64 из LIPIcs, стр. 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)