nonblocker: Parameterized Algorithmics for minimum dominating set-Reference-Cited by-同舟云学术

nonblocker: Parameterized Algorithmics for minimum dominating set

Published:2006 Issue: Volume: Page:237-245
ISSN:0302-9743
Container-title:SOFSEM 2006: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Dehne Frank,Fellows Michael,Fernau Henning,Prieto Elena,Rosamond Frances

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11611257_21.pdf

Reference20 articles.

1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs. Algorithmica 33, 461–493 (2002)

2. Ausiello, G., Creczenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation; Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)

3. Blank, M.: An Estimate of the External Stability Number of a Graph without Suspended Vertices (in Russian). Prikl. Math. i Programmirovanie Vyp 10, 3–11 (1973)

4. Lecture Notes in Computer Science;J. Chen,2005

5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. To Close Is Easier Than To Open: Dual Parameterization To k-Median;Approximation and Online Algorithms;2021

2. On the Complexity of the Upper r-Tolerant Edge Cover Problem;Topics in Theoretical Computer Science;2020

3. Profit Parameterizations of Dominating Set;Algorithmic Aspects in Information and Management;2019

4. Weighted Upper Edge Cover: Complexity and Approximability;WALCOM: Algorithms and Computation;2018-12-21

5. Extremal Kernelization: A Commemorative Paper;Lecture Notes in Computer Science;2018