News and Updates

2021

• 2 papers in SODA 2021
  • FPT Approximation for FPT Problems
  • Strong Connectivity Augmentation is FPT
• Talk at Study group in Graph Theory, Topology and Algorithms, University of Birmingham Feb 09
  • Title: An Optimal Approximation Algorithm for Feedback Vertex Set in Tournaments.

2020

• 7 papers in 2020
  • STOC 2020: An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
  • ITCS 2020: Fault Tolerant Subgraphs with Applications in Kernelization
  • SODA 2020: 2-Approximating Feedback Vertex Set in Tournament
  • … see Publications for more details
• Program committee member for IPEC 2020

2019

• 2 papers in SODA 2019

  • Interval Vertex Deletion Admits a Polynomial Kernel
  • Popular Matching in the Roommates Setting is NP-hard

• Invited Talk at Workshop on Kernelization WORKER 2019 Jun 03-07

  • Title: Polynomial kernels for Chordal and Interval Vertex Deletion
  • with Marcin Pilipczuk .

2018

• One paper in SODA 2018

  • Parameterized Algorithms for Survivable Network Design with Uniform Demands

• Talk at the Operations Research + Parameterized Complexity Workshop Sep 17-18

  • Title: NP-hardness of Popular Matchings in General graphs

• Talk at the China Norway FPT Workshop Aug 09-10

  • Title: Popular Matching in Roommates Setting is NP-hard

2017

• One paper in SODA 2017
  • Feedback Vertex Set inspired kernel for Chordal Vertex Deletion