( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity Landscape of Connected f-Factor Problems.

, , , , и . Algorithmica, 81 (6): 2606-2632 (2019)

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

 

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

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs., , , , и . SIAM J. Discret. Math., 36 (2): 911-921 (2022)On Structural Parameterizations of the Edge Disjoint Paths Problem., , и . Algorithmica, 83 (6): 1605-1637 (2021)On the Approximate Compressibility of Connected Vertex Cover., , и . Algorithmica, 82 (10): 2902-2926 (2020)On the Complexity of Majority Illusion in Social Networks., , , и . CoRR, (2022)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)On the Kernelization Complexity of String Problems., , , , и . COCOON, том 8591 из Lecture Notes in Computer Science, стр. 141-153. Springer, (2014)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)