Aug 16, 2021 · A Correction to this paper has been published: https://doi.org/10.1007/s00224-021-10057-6.
May 23, 2020 · We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks.
May 29, 2020 · We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks.
Missing: Correction | Show results with:Correction
A Correction to this paper has been published: https://doi.org/10.1007/s00224-021-10057-6.
PDF | A Correction to this paper has been published: https://doi.org/10.1007/s00224-021-10057-6 | Find, read and cite all the research you need on ...
We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks ...
Abstract In this paper, we study the parameterized complexity of the induced matching problem in hamiltonian bipartite graphs and the inapproximability of the ...
2023. Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. M Bentert, R Haag, C Hofer, T Koana, A Nichterlein. Theory of Computing ...
This work analyzes the minimum tollbooth problem in atomic network ... Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity.
Apr 25, 2024 · Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65(7): 1141-1142 (2021); 2020. [j1]. view.