Parameterized algorithms for locating-dominating sets

Type: Article

Publication Date: 2021-01-01

Citations: 2

DOI: https://doi.org/10.1016/j.procs.2021.11.012

Locations

  • Procedia Computer Science - View
  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ Parameterized algorithms for locating-dominating sets. 2020 Márcia R. Cappelle
Guilherme C. M. Gomes
Vinícius Fernandes dos Santos
+ Parameterized algorithms for locating-dominating sets 2020 Márcia R. Cappelle
Guilherme C. M. Gomes
Vinícius F. dos Santos
+ Bandwidth Parameterized by Cluster Vertex Deletion Number 2023 Tatsuya Gima
Eun Jung Kim
Noleen Köhler
Nikolaos Melissinos
Manolis Vasilakis
+ Parameterized Approximation Algorithms for some Location Problems in Graphs 2017 Arne Leitert
Feodor F. Dragan
+ Parameterized Approximation Algorithms for some Location Problems in Graphs 2017 Arne Leitert
Feodor F. Dragan
+ PDF Chat Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs 2024 Dishant Goyal
Ashwin Jacob
Kaushtubh Kumar
Diptapriyo Majumdar
Venkatesh Raman
+ PDF Chat Parameterized Algorithms for Colored Clustering 2023 Leon Kellerhals
Tomohiro Koana
Pascal Kunz
Rolf Niedermeier
+ PDF Chat Structural Parameterization of Locating-Dominating Set and Test Cover 2024 Dipayan Chakraborty
Florent Foucaud
Diptapriyo Majumdar
Prafullkumar Tale
+ PDF Chat Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover 2024 Dipayan Chakraborty
Florent Foucaud
Diptapriyo Majumdar
Prafullkumar Tale
+ PDF Chat On Structural Parameterizations for the 2-Club Problem 2013 Sepp Hartung
Christian Komusiewicz
André Nichterlein
+ On Kernelization for Edge Dominating Set under Structural Parameters 2019 Eva-Maria C. Hols
Stefan Kratsch
+ FPT and kernelization algorithms for the k-in-a-tree problem 2020 Guilherme C. M. Gomes
Vinícius F. dos Santos
Murilo V. G. da Silva
Jayme L. Szwarcfiter
+ FPT and kernelization algorithms for the k-in-a-tree problem. 2020 Guilherme C. M. Gomes
Vinícius Fernandes dos Santos
Murilo V. G. da Silva
Jayme L. Szwarcfiter
+ Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings 2018 Haris Angelidakis
+ Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings 2018 Haris Angelidakis
+ On structural parameterizations of the selective coloring problem 2020 Guilherme C. M. Gomes
Vinícius F. dos Santos
+ Preprocessing complexity for some graph problems parameterized by structural parameters 2023 Manuel Lafond
Weidong Luo
+ Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters 2023 Manuel Lafond
Weidong Luo
+ Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems 2010 Gregory Gutin
Mark Jones
Anders Yeo
+ On structural parameterizations of the selective coloring problem 2021 Guilherme C. M. Gomes
Vinícius Fernandes dos Santos