Akanksha Agrawal

Kristine V. K. Knudsen

Daniel Lokshtanov

Discret. Comput. Geom., March, 2024

Recognizing well-dominated graphs is coNP-complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., January, 2024

Odd Cycle Transversal on P5-free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2024

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion.

[BibT_eX]

[DOI]

Vijayaragunathan Ramamoorthi

Satyabrata Jana

Abhishek Sahu

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Parameterized Complexity of Minimum Membership Dominating Set.

[BibT_eX]

[DOI]

Algorithmica, November, 2023

Parameterized complexity of perfectly matched sets.

[BibT_eX]

[DOI]

Sutanay Bhattacharjee

Satyabrata Jana

Abhishek Sahu

Theor. Comput. Sci., May, 2023

Polynomial Kernel for Interval Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2023

Erdős-Pósa property of obstructions to interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2023

Clustering what Matters: Optimal Approximation for Clustering with Outliers.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

Computing Square Colorings on Bounded-Treewidth and Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Brief Announcement: Local Problems in the SUPPORTED Model.

[BibT_eX]

[DOI]

John Augustine

David Peleg

Srikkanth Ramachandran

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Local Recurrent Problems in the SUPPORTED Model.

[BibT_eX]

[DOI]

John Augustine

David Peleg

Srikkanth Ramachandran

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels.

[BibT_eX]

[DOI]

M. S. Ramanujan

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).

[BibT_eX]

[DOI]

Dagstuhl Reports, November, 2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Fine-grained complexity of rainbow coloring and its variants.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Recurrent Problems in the LOCAL model.

[BibT_eX]

[DOI]

John Augustine

David Peleg

Srikkanth Ramachandran

CoRR, 2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

[BibT_eX]

[DOI]

Algorithmica, 2022

Parameter Analysis for Guarding Terrains.

[BibT_eX]

[DOI]

Sudeshna Kolay

Algorithmica, 2022

Parameterized Complexity of Maximum Edge Colorable Subgraph.

[BibT_eX]

[DOI]

Algorithmica, 2022

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Distance from Triviality 2.0: Hybrid Parameterizations.

[BibT_eX]

[DOI]

M. S. Ramanujan

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

On Finding Short Reconfiguration Sequences Between Independent Sets.

[BibT_eX]

[DOI]

Soumita Hait

Amer E. Mouawad

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Paths to trees and cacti.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Elimination Distance to Topological-minor-free Graphs is FPT.

[BibT_eX]

[DOI]

CoRR, 2021

Simultaneous Feedback Edge Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

Algorithmica, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH.

[BibT_eX]

[DOI]

Ravi Kiran Allumalla

Varun Teja Dhanekula

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

A Polynomial Kernel for Deletion to Ptolemaic Graphs.

[BibT_eX]

[DOI]

Aditya Anand

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Quadratic vertex kernel for split vertex deletion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Parameterized complexity of happy coloring problems.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

N. R. Aravind

Theor. Comput. Sci., 2020

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Path Contraction Faster than 2n.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.

[BibT_eX]

[DOI]

Algorithmica, 2020

On the Parameterized Complexity of Clique Elimination Distance.

[BibT_eX]

[DOI]

M. S. Ramanujan

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Parameterized Analysis of Art Gallery and Terrain Guarding.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2020

2019

Split Contraction: The Untold Story.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

On the Parameterized Complexity of Contraction to Generalization of Trees.

[BibT_eX]

[DOI]

Prafullkumar Tale

Theory Comput. Syst., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Interval Vertex Deletion Admits a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.

[BibT_eX]

[DOI]

Sudeshna Kolay

Jayakrishnan Madathil

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Connecting the Dots (with Minimum Crossings).

[BibT_eX]

[DOI]

Grzegorz Guspiel

Jayakrishnan Madathil

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Simultaneous Feedback Vertex Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Parameterised Algorithms for Deletion to Classes of DAGs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Kernels for deletion to classes of acyclic digraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Exploring the Kernelization Borders for Hitting Cycles.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Hitting and Covering Partially.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

Daniel Lokshtanov

Amer E. Mouawad

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

On the Parameterized Complexity of Happy Vertex Coloring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

On the Parameterized Complexity of Simultaneous Deletion Problems.

[BibT_eX]

[DOI]

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

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

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Kernelizing Buttons and Scissors.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2014

Vertex Cover Gets Faster and Harder on Low Degree Graphs.

[BibT_eX]

[DOI]