( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

, , , и . J. ACM, 63 (4): 29:1-29:60 (2016)

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.

Tarag Fahad

Fahad Ali

Fahad Anwar

Fahad Koujah

Fahad Azab

 

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

On the parameterized complexity of b-chromatic number., , и . J. Comput. Syst. Sci., (2017)Fréchet Distance Between a Line and Avatar Point Set., , , и . Algorithmica, 80 (9): 2616-2636 (2018)A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments., , , , , и . CoRR, (2018)Editing to Connected f-Degree Graph., , , и . STACS, том 47 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized Low-Rank Binary Matrix Approximation., , и . ICALP, том 107 из LIPIcs, стр. 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Lossy Kernels for Connected Dominating Set on Sparse Graphs., , , , и . SIAM J. Discret. Math., 33 (3): 1743-1771 (2019)Lossy Kernelization., , , и . CoRR, (2016)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , и . J. ACM, 63 (4): 29:1-29:60 (2016)Representative Families of Product Families., , , и . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)On the Parameterized Complexity of Edge-Linked Paths., , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 286-298. Springer, (2019)