( en | de | ru )

 

Disambiguation of "Agrawal, Akanksha"

Author of the publication

copydeleteadd this publication to your clipboard
Connecting the Dots (with Minimum Crossings).

, , , , and . SoCG, volume 129 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. You can also use the button next to the name to display some publications already assigned to the person.

Deepashri Agrawal

Akanksha Nagpal

Mukesh Agrawal

Mudit Agrawal

Hemant Agrawal

 

Other publications of authors with the same name

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)., , , , and . Dagstuhl Reports, 12 (11): 109-123 (November 2022)Kernelization of Cycle Packing with Relaxed Disjointness Constraints., , , , and . SIAM J. Discret. Math., 32 (3): 1619-1643 (2018)Recognizing well-dominated graphs is coNP-complete., , , , and . CoRR, (2022)Parameterized Complexity of Minimum Membership Dominating Set., , , , and . CoRR, (2021)A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion., , , and . CoRR, (2015)Computing Square Colorings on Bounded-Treewidth and Planar Graphs., , , and . CoRR, (2022)On the Parameterized Complexity of Clique Elimination Distance., and . IPEC, volume 180 of LIPIcs, page 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Quadratic Vertex Kernel for Split Vertex Deletion., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 1-12. Springer, (2019)Parameterized Complexity of Minimum Membership Dominating Set., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 288-299. Springer, (2022)Interval Vertex Deletion Admits a Polynomial Kernel., , , and . SODA, page 1711-1730. SIAM, (2019)