M. S. Ramanujan

CoRR, 2023

Finding a Highly Connected Steiner Subgraph and its Applications.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels.

[BibT_eX]

[DOI]

Akanksha Agrawal

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

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.

[BibT_eX]

[DOI]

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

Identifying and Eliminating Majority Illusion in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set.

[BibT_eX]

[DOI]

CoRR, 2022

On the Complexity of Majority Illusion in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2022

On the Lossy Kernelization for Connected Treedepth Deletion Set.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

An Exact Algorithm for Knot-Free Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Distance from Triviality 2.0: Hybrid Parameterizations.

[BibT_eX]

[DOI]

Akanksha Agrawal

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

Backdoor Sets on Nowhere Dense SAT.

[BibT_eX]

[DOI]

Fahad Panolan

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Equilibrium Computation For Knockout Tournaments Played By Groups.

[BibT_eX]

[DOI]

Grzegorz Lisowski

Paolo Turrini

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

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

[BibT_eX]

[DOI]

CoRR, 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

FPT-approximation for FPT Problems.

[BibT_eX]

[DOI]

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

On Approximate Compressions for Connected Minor-Hitting Sets.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

A Hotelling-Downs Framework for Party Nominees.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Alternative parameterizations of Metric Dimension.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Faster Graph bipartization.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

A characterization of König-Egerváry graphs with extendable vertex covers.

[BibT_eX]

[DOI]

Venkatesh Raman

Inf. Process. Lett., 2020

On the Approximate Compressibility of Connected Vertex Cover.

[BibT_eX]

[DOI]

Algorithmica, 2020

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.

[BibT_eX]

[DOI]

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

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

On the Parameterized Complexity of Clique Elimination Distance.

[BibT_eX]

[DOI]

Akanksha Agrawal

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

On the Complexity of Recovering Incidence Matrices.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.

[BibT_eX]

[DOI]

Danny Hermelin

J. Comput. Syst. Sci., 2019

On the Constrained Least-cost Tour Problem.

[BibT_eX]

[DOI]

Patrick O'Hara

Theodoros Damoulas

CoRR, 2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On Succinct Encodings for the Tournament Fixing Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An Approximate Kernel for Connected Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Manu Basavaraju

Kristine Vitting Klinkby

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Reducing CMSO Model Checking to Highly Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On the Optimality of Pseudo-polynomial Algorithms for Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Hitting Selected (Odd) Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Metric Dimension of Bounded Tree-length Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Half-integral Erdös-Pósa Property for Non-null Cycles.

[BibT_eX]

[DOI]

CoRR, 2017

On finding highly connected spanning subgraphs.

[BibT_eX]

[DOI]

CoRR, 2017

Lossy kernelization.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Combining Treewidth and Backdoors for CSP.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Backdoor Treewidth for SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Lossy Kernels for Hitting Subgraphs.

[BibT_eX]

[DOI]

Danny Hermelin

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Towards a Polynomial Kernel for Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On Structural Parameterizations of the Edge Disjoint Paths Problem.

[BibT_eX]

[DOI]

Sebastian Ordyniak

Ramanujan Sridharan

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Saving Critical Nodes with Firefighters is FPT.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 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

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Path-Contractions, Edge Deletions and Connectivity Preservation.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Going Beyond Primal Treewidth for (M)ILP.

[BibT_eX]

[DOI]

Sebastian Ordyniak

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

LP Based Parameterized Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Strong Backdoors for Linear Temporal Logic.

[BibT_eX]

[DOI]

CoRR, 2016

A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

CoRR, 2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.

[BibT_eX]

[DOI]

CoRR, 2016

A Faster Parameterized Algorithm for Group Feedback Edge Set.

[BibT_eX]

[DOI]

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

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On the Complexity Landscape of Connected f-Factor Problems.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A New Perspective on FO Model Checking of Dense Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Parameterized Algorithm for Mixed-Cut.

[BibT_eX]

[DOI]

Ashutosh Rai

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Backdoors for Linear Temporal Logic.

[BibT_eX]

[DOI]

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

Strong Parameterized Deletion: Bipartite Graphs.

[BibT_eX]

[DOI]

Ashutosh Rai

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

Backdoors to Tractable Valued CSP.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.

[BibT_eX]

[DOI]

Fahad Panolan

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Reconfiguration on Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Solving <i>d-</i>SAT via Backdoors to Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Metric Dimension of Bounded Width Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

FO Model Checking on Posets of Bounded Width.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Faster Parameterized Algorithms Using Linear Programming.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Parameterized Approximations via d-Skew-Symmetric Multicut.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Algorithms to Preserve Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Vertex Exponential Algorithms for Connected f-Factors.

[BibT_eX]

[DOI]

Geevarghese Philip

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

On the Kernelization Complexity of String Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Backdoors to q-Horn.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Faster Exact Algorithms for Some Terminal Set Problems.

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Partially Polynomial Kernels for Set Cover and Test Cover.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Parameterized Algorithms for Even Cycle Transversal.

[BibT_eX]

[DOI]

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

Faster Parameterized Algorithms for Deletion to Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

LP can be a cure for Parameterized Problems.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Parameterized Tractability of Multiway Cut with Parity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Paths, Flowers and Vertex Cover.

[BibT_eX]

[DOI]

Venkatesh Raman