Home
Akanksha Agrawal's picture

Akanksha Agrawal

PhD Candidate
  • E-mailAkanksha.Agrawal@uib.no
  • Visitor Address
    Department of Informatics, University of Bergen
    Thørmohlens gate 55
    5020 Bergen
    Room 
    304P1
  • Postal Address
    Postboks 7803
    5020 Bergen
Journal articles
  • Agrawal, Akanksha; Gupta, Sushmita; Saurabh, Saket; Sharma, Roohani. 2017. Improved algorithms and combinatorial bounds for independent Feedback Vertex Set. Leibniz International Proceedings in Informatics. 63: 1-14. doi: 10.4230/LIPIcs.IPEC.2016.2
  • Agrawal, Akanksha; Kolay, Sudeshna; Lokshtanov, Daniel; Saurabh, Saket. 2016. A faster FPT algorithm and a smaller kernel for block graph vertex deletion. Lecture Notes in Computer Science. 9644: 1-13. doi: 10.1007/978-3-662-49529-2_1
  • Agrawal, Akanksha; Lokshtanov, Daniel; Abdo Mouawad, Amer; Saurabh, Saket. 2016. SIMULTANEOUS Feedback Vertex set: A parameterized perspective. Leibniz International Proceedings in Informatics. 47: 7:1-7:15. doi: 10.4230/LIPIcs.STACS.2016.7
  • Agrawal, Akanksha; Lokshtanov, Daniel; Majumdar, Diptapriyo; Abdo Mouawad, Amer; Saurabh, Saket. 2016. Kernelization of cycle packing with relaxed disjointness constraints. Leibniz International Proceedings in Informatics. 55:26: 1-14. doi: 10.4230/LIPIcs.ICALP.2016.26
  • Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2016. Simultaneous feedback edge set: A parameterized perspective. Leibniz International Proceedings in Informatics. 64: 5.1-5.13. doi: 10.4230/LIPIcs.ISAAC.2016.5
  • Agrawal, Akanksha; Saurabh, Saket. 2016. Kernels for deletion to classes of acyclic digraphs. Leibniz International Proceedings in Informatics. 64: 6.1-6.12. doi: 10.4230/LIPIcs.ISAAC.2016.6

More information in national current research information system (CRIStin)

  • Akanksha Agrawal, Sushmita Gupta, Saket Saurabh and Roohani Sharma. Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC 2016.
  • Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh and Roohani Sharma. Kernelizing Buttons and Scissors. CCCG 2016: 279-286.
  • Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad and Saket Saurabh. Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14.
  • Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad and Saket Saurabh. Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS 2016: 7:1-7:15.
  • Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov and Saket Saurabh. A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN 2016: 1-13.
  • Akanksha Agrawal, Sathish Govindarajan and Neeldhara Misra. Vertex Cover Gets Faster and Harder on Low Degree Graphs. COCOON 2014: 179-190.