Graph separators: a parameterized view-Reference-Cited by-同舟云学术

Graph separators: a parameterized view

Published:2003-12 Issue:4 Volume:67 Page:808-832
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Alber Jochen,Fernau Henning,Niedermeier Rolf

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference36 articles.

1. J. Alber, H.L. Bodlaender, H. Fernau, R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems, in: Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory SWAT’00, Lecture Notes in Computer Science, Vol. 1851, Springer, Berlin, 2000, pp. 97–110, long version to appear in Algorithmica.

2. J. Alber, H. Fan, M.R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, U. Stege, Refined search tree techniques for the planar dominating set problem, in: Proceedings of the 26th International Symposium Mathematical Foundations of Computer Science MFCS’01, Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, pp. 111–122.

3. J. Alber, M.R. Fellows, R. Niedermeier, Efficient data reduction for dominating set: a linear problem kernel for the planar case, Manuscript, April 2002.

4. J. Alber, H. Fernau, R. Niedermeier, Graph separators: a parameterized view, Technical Report WSI-2001-8, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, September 2001.

5. J. Alber, H. Fernau, R. Niedermeier, Parameterized complexity: exponential speed-up for planar graph problems, Technical Report TR01-023, ECCC Reports, Trier, March 2001, Extended abstract in Proceedings of the 28th International Colloquium on Automata, Languages and Programming ICALP’01, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 261–272.

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

1. True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs;ACM Transactions on Algorithms;2024-07-03

2. Edge Clique Partition of K 4-Free and Planar Graphs;Lecture Notes in Computer Science;2011

3. Planar k-Path in Subexponential Time and Polynomial Space;Graph-Theoretic Concepts in Computer Science;2011

4. Engineering planar separator algorithms;ACM Journal of Experimental Algorithmics;2009-12

5. A linear-time algorithm to find a separator in a graph excluding a minor;ACM Transactions on Algorithms;2009-10