Personal information

Verified email domains

Parameterized Algorithms, Graph Algorithms

Activities

Employment (3)

Indian Institute of Technology Madras: Chennai, Tamil Nadu, IN

2020-10 to present | Assistant Professor (Computer Science and Engineering)
Employment
Source: Self-asserted source
Akanksha Agrawal

Ben-Gurion University of the Negev: Beer-Sheva, Southern, IL

2019-03 to 2020-09 | Postdoc (Department of Computer Science)
Employment
Source: Self-asserted source
Akanksha Agrawal

Hungarian Academy of Sciences: Budapest, HU

2018-05 to 2019-02 | Postdoc (Institute for Computer Science and Control)
Employment
Source: Self-asserted source
Akanksha Agrawal

Education and qualifications (2)

University of Bergen: Bergen, Bergen, NO

2015-01 to 2017-11 | Ph.D. (Informatics)
Education
Source: Self-asserted source
Akanksha Agrawal

Indian Institute of Science: Bangalore, Karnataka, IN

2012 to 2014 | M.Sc.(Engg.) (Computer Science and Automation)
Education
Source: Self-asserted source
Akanksha Agrawal

Professional activities (1)

Indian Institute of Technology Madras: Chennai, IN

Class of 1991 Award (Computer Science and Engineering)
Distinction
Source: Self-asserted source
Akanksha Agrawal

Works (41)

Connecting the Dots (with Minimum Crossings)

35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA
2019 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding

CoRR
2019 | Journal article
URI:

http://arxiv.org/abs/1905.01822

Source: Self-asserted source
Akanksha Agrawal

Interval Vertex Deletion Admits a Polynomial Kernel

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019
2019 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Parameterized Complexity of Conflict-Free Matchings and Paths

44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany
2019 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Path Contraction Faster Than 2\(^\mboxn\)

46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece
2019 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Quadratic Vertex Kernel for Split Vertex Deletion

Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings
2019 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Split Contraction: The Untold Story

TOCT
2019 | Journal article
Source: Self-asserted source
Akanksha Agrawal

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK
2018 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Erdös-Pósa Property of Obstructions to Interval Graphs

35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France
2018 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Exploring the Kernelization Borders for Hitting Cycles

13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland
2018 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Hitting and Covering Partially

Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings
2018 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Kernelization of Cycle Packing with Relaxed Disjointness Constraints

SIAM J. Discrete Math.
2018 | Journal article
Source: Self-asserted source
Akanksha Agrawal

Kernels for deletion to classes of acyclic digraphs

J. Comput. Syst. Sci.
2018 | Journal article
Source: Self-asserted source
Akanksha Agrawal

Parameterised Algorithms for Deletion to Classes of DAGs

Theory Comput. Syst.
2018 | Journal article
Source: Self-asserted source
Akanksha Agrawal

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA
2018 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Simultaneous Feedback Vertex Set: A Parameterized Perspective

TOCT
2018 | Journal article
Source: Self-asserted source
Akanksha Agrawal

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

ACM Transactions on Algorithms
2018-12-08 | Journal article
Part of ISSN: 1549-6325
Source: Self-asserted source
Akanksha Agrawal
grade
Preferred source (of 2)‎

Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard

Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements

Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

CoRR
2017 | Journal article
URI:

http://arxiv.org/abs/1707.04917

Source: Self-asserted source
Akanksha Agrawal

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Fine-Grained Complexity of Rainbow Coloring and its Variants

42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

On the Parameterized Complexity of Contraction to Generalization of Trees

CoRR
2017 | Journal article
URI:

http://arxiv.org/abs/1708.00622

Source: Self-asserted source
Akanksha Agrawal

On the Parameterized Complexity of Contraction to Generalization of Trees

12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

On the Parameterized Complexity of Happy Vertex Coloring

Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

On the Parameterized Complexity of Simultaneous Deletion Problems

37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Paths to Trees and Cacti

Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems

CoRR
2017 | Journal article
URI:

http://arxiv.org/abs/1707.04908

Source: Self-asserted source
Akanksha Agrawal

Split Contraction: The Untold Story

34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany
2017 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion

LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set

11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Kernelization of Cycle Packing with Relaxed Disjointness Constraints

43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Kernelizing Buttons and Scissors

Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Kernels for Deletion to Classes of Acyclic Digraphs

27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Simultaneous Feedback Edge Set: A Parameterized Perspective

CoRR
2016 | Journal article
URI:

http://arxiv.org/abs/1611.07701

Source: Self-asserted source
Akanksha Agrawal

Simultaneous Feedback Edge Set: A Parameterized Perspective

27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Simultaneous Feedback Vertex Set: A Parameterized Perspective

33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France
2016 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion

CoRR
2015 | Journal article
URI:

http://arxiv.org/abs/1510.08154

Source: Self-asserted source
Akanksha Agrawal

Simultaneous Feedback Vertex Set: A Parameterized Perspective

CoRR
2015 | Journal article
URI:

http://arxiv.org/abs/1510.01557

Source: Self-asserted source
Akanksha Agrawal

Vertex Cover Gets Faster and Harder on Low Degree Graphs

CoRR
2014 | Journal article
URI:

http://arxiv.org/abs/1404.5566

Source: Self-asserted source
Akanksha Agrawal

Vertex Cover Gets Faster and Harder on Low Degree Graphs

Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings
2014 | Conference paper
Source: Self-asserted source
Akanksha Agrawal

Peer review (2 reviews for 2 publications/grants)

Review activity for Algorithmica. (1)
Review activity for Theory of computing systems. (1)