Fahad Panolan

Hannane Yaghoubizade

Proceedings of the WALCOM: Algorithms and Computation, 2024

Decremental Sensitivity Oracles for Covering and Packing Minors.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

[BibT_eX]

[DOI]

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

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Parameterized Algorithms for Minimum Sum Vertex Cover.

[BibT_eX]

[DOI]

Shubhada Aute

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

On the optimality of pseudo-polynomial algorithms for integer programming.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.

[BibT_eX]

[DOI]

Susobhan Bandopadhyay

Suman Banerjee

Diptapriyo Majumdar

CoRR, 2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Socially Fair Matching: Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Framework for Approximation Schemes on Disk Graphs.

[BibT_eX]

[DOI]

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

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage.

[BibT_eX]

[DOI]

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

2022

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Target Set Selection Parameterized by Vertex Cover and More.

[BibT_eX]

[DOI]

Suman Banerjee

Rogers Mathew

Theory Comput. Syst., 2022

Boolean and Fp-Matrix Factorization: From Theory to Practice.

[BibT_eX]

[DOI]

CoRR, 2022

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.

[BibT_eX]

[DOI]

Algorithmica, 2022

Structural Parameterizations with Modulator Oblivion.

[BibT_eX]

[DOI]

Algorithmica, 2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

[BibT_eX]

[DOI]

Algorithmica, 2022

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 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

List Homomorphism: Beyond the Known Boundaries.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2022

Backdoor Sets on Nowhere Dense SAT.

[BibT_eX]

[DOI]

Daniel Lokshtanov

M. S. Ramanujan

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

Partial Vertex Cover on Graphs of Bounded Degeneracy.

[BibT_eX]

[DOI]

Hannane Yaghoubizade

Proceedings of the Computer Science - Theory and Applications, 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2022

Parameterized Complexity of List Coloring and Max Coloring.

[BibT_eX]

[DOI]

Bardiya Aryanfard

Mohsen Alambardar Meybodi

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Multiplicative Parameterization Above a Guarantee.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

2-Approximating Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 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

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

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

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Fixed-Parameter and Approximation Algorithms for PCA with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Linear representation of transversal matroids and gammoids parameterized by rank.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the parameterized complexity of [1, j]-domination problems.

[BibT_eX]

[DOI]

Fedor V. Fomin

Amer E. Mouawad

Theor. Comput. Sci., 2020

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Approximation Schemes for Low-rank Binary Matrix Approximation Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Going Far from Degeneracy.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Subexponential algorithm for d-cluster edge deletion: Exception or rule?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Parameterized low-rank binary matrix approximation.

[BibT_eX]

[DOI]

Fedor V. Fomin

Petr A. Golovach

Data Min. Knowl. Discov., 2020

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

CoRR, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.

[BibT_eX]

[DOI]

Algorithmica, 2020

Hitting topological minors is FPT.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Quick Separation in Chordal and Split Graphs.

[BibT_eX]

[DOI]

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

Improved FPT Algorithms for Deletion to Forest-Like Structures.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Parameterization Above a Multiplicative Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.

[BibT_eX]

[DOI]

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

Low-Rank Binary Matrix Approximation in Column-Sum Norm.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Communication Complexity and Graph Families.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Harmonious coloring: Parameterized algorithms and upper bounds.

[BibT_eX]

[DOI]

Ragukumar Pandurangan

Venkatesh Raman

Prafullkumar Tale

Theor. Comput. Sci., 2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Editing to Connected F-Degree Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.

[BibT_eX]

[DOI]

CoRR, 2019

Parameterized Algorithms for List K-Cycle.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Stability in barter exchange markets.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2019

Parameterized Computational Geometry via Decomposition Theorems.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Complexity of the Steiner Network Problem with Respect to the Number of Terminals.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.

[BibT_eX]

[DOI]

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

Refined Complexity of PCA with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Decomposition of Map Graphs with Applications.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

On the Parameterized Complexity of Edge-Linked Paths.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

On the Complexity of Mixed Dominating Set.

[BibT_eX]

[DOI]

Jayakrishnan Madathil

Abhishek Sahu

Mohsen Alambardar Meybodi

Proceedings of the Computer Science - Theory and Applications, 2019

2018

On the kernelization complexity of string problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Deterministic Truncation of Linear Matroids.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Reconfiguration on sparse graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Finding even subgraphs even faster.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Long directed (s, t)-path: FPT algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

CoRR, 2018

Fréchet Distance Between a Line and Avatar Point Set.

[BibT_eX]

[DOI]

Algorithmica, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

On the Parameterized Complexity of [1, j]-Domination Problems.

[BibT_eX]

[DOI]

Fedor V. Fomin

Amer E. Mouawad

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

2017

Representative Families of Product Families.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

On the parameterized complexity of b-chromatic number.

[BibT_eX]

[DOI]

Geevarghese Philip

J. Comput. Syst. Sci., 2017

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Quick but Odd Growth of Cacti.

[BibT_eX]

[DOI]

Algorithmica, 2017

Mixed Dominating Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

Pallavi Jain

Jayakrishnan Madathil

Abhishek Sahu

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

Lossy kernelization.

[BibT_eX]

[DOI]

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

Communication Complexity of Pairs of Graph Families with Applications.

[BibT_eX]

[DOI]

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

2016

Matroids in Parameterized Complexity and Exact Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

[BibT_eX]

[DOI]

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

Parameterized Algorithms for List K-Cycle.

[BibT_eX]

[DOI]

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

2015

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Parameterized Algorithms for Deletion to (r, l)-graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Faster Parameterized Algorithms for Deletion to Split Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

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

[BibT_eX]

[DOI]

M. S. Ramanujan

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

B-Chromatic Number: Beyond NP-Hardness.

[BibT_eX]

[DOI]

Geevarghese Philip

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Parameterized Algorithms for Deletion to (r, ell)-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Representative Sets of Product Families.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.

[BibT_eX]

[DOI]

Prachi Goyal

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

2012

On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles.

[BibT_eX]

[DOI]