Image de couverture de livre

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goyal, Dishant, Jacob, Ashwin, Kumar, Kaushtubh, Majumdar, Diptapriyo, Raman, Venkatesh
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Structural Parameterization of Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

On the Structural Parameterizations of 2-Club with Triangle Constraints
par: Jacob, Ashwin, et autres
Publié: (2025)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
par: Jacob, Ashwin, et autres
Publié: (2026)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
par: Jacob, Ashwin, et autres
Publié: (2024)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2026)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

Parameterized Algorithms for Editing to Uniform Cluster Graph
par: Gaikwad, Ajinkya, et autres
Publié: (2024)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
par: Kumar, Mithilesh, et autres
Publié: (2024)

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

Parameterized dynamic data structure for Split Completion
par: Majewski, Konrad, et autres
Publié: (2024)

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
par: Adar, Tomer, et autres
Publié: (2026)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Parameterized Algorithms for Computing Pareto Sets
par: Könen, Joshua, et autres
Publié: (2025)

Parameterized Complexity of Efficient Sortation
par: Ganian, Robert, et autres
Publié: (2024)

Parameterized Complexity of Simultaneous Planarity
par: Fink, Simon D., et autres
Publié: (2023)

Clustering What Matters in Constrained Settings
par: Jaiswal, Ragesh, et autres
Publié: (2023)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

Local Search for Clustering in Almost-linear Time
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
par: Gadekar, Ameet
Publié: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Exact Optimization for Minimum Dominating Sets
par: Zhu, Enqiang, et autres
Publié: (2025)

(Independent) Roman Domination Parameterized by Distance to Cluster
par: Ashok, Pradeesha, et autres
Publié: (2024)

Distances in Planar Graphs are Almost for Free!
par: Mozes, Shay, et autres
Publié: (2026)

Parameterized algorithms for $k$-Inversion
par: Antony, Dhanyamol, et autres
Publié: (2026)

Clustered Planarity Variants for Level Graphs
par: Fink, Simon D., et autres
Publié: (2024)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
par: Bhore, Sujoy, et autres
Publié: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
par: Ganian, Robert, et autres
Publié: (2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths
par: Funayama, Ryo, et autres
Publié: (2024)

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
par: Saito, Rin, et autres
Publié: (2025)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
par: Bhattacharya, Sayan, et autres
Publié: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
par: Xiong, Ziliang, et autres
Publié: (2024)

Dominating Set with Quotas: Balancing Coverage and Constraints
par: Chatterjee, Sobyasachi, et autres
Publié: (2026)

Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
par: Shen, Fangjian, et autres
Publié: (2025)