( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

, , , , и . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)

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.

M S Perzanowski

M S Khan

M S Jenny

Rahul M S

Osman M s rl

 

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

Faster Exact Algorithms for Some Terminal Set Problems., , , , , и . IPEC, том 8246 из Lecture Notes in Computer Science, стр. 150-162. Springer, (2013)Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS., , , , и . ICALP, том 107 из LIPIcs, стр. 110:1-110:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS., , , , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 523-537. Springer, (2019)On the Kernelization Complexity of String Problems., , , , и . COCOON, том 8591 из Lecture Notes in Computer Science, стр. 141-153. Springer, (2014)Linear Time Parameterized Algorithms for Subset Feedback Vertex Set., , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 935-946. Springer, (2015)Partially Polynomial Kernels for Set Cover and Test Cover., , , и . SIAM J. Discret. Math., 30 (3): 1401-1423 (2016)Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts., и . ACM Trans. Algorithms, 13 (4): 46:1-46:25 (2017)Faster Parameterized Algorithms using Linear Programming, , , , и . CoRR, (2012)A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set., , и . CoRR, (2016)Fine-grained complexity of integer programming: The case of bounded branch-width and rank., , , и . CoRR, (2016)