( en | de | ru )

 

Disambiguation of "Panolan, Fahad"

Author of the publication

copydeleteadd this publication to your clipboard
Fréchet Distance Between a Line and Avatar Point Set.

, , , and . Algorithmica, 80 (9): 2616-2636 (2018)

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. You can also use the button next to the name to display some publications already assigned to the person.

Tarag Fahad

Fahad Ali

Fahad Anwar

Fahad Koujah

Fahad Azab

 

Other publications of authors with the same name

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