Kernels: Annotated, proper and induced

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 264-275

  Abu Khzam, Faisal N ^a   Fernau, Henning ^b  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LOGIC DESIGN; MATHEMATICAL MODELS;

FIXED PARAMETER ALGORITHMS; KERNELIZATION ALGORITHMS;

DATABASE SYSTEMS;

EID: 33750261270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_24     Document Type: Conference Paper

References (18)

1. F. Abu-Khzam and M. Langston. A direct algorithm for the parameterized face cover problem. In International Workshop on Parameterized and Exact Computation IWPEC 2004, volume 3162 of LNCS, pages 213-222. Springer, 2004.
2. J. Alber, B. Dorn, and R. Niedermeier. A general data reduction scheme for domination in graphs. In Software Seminar SOFSEM, volume 3831 of LNCS, pages 137-147. Springer, 2006.
3. J. Chen, H. Fernau, I. A. Kanj, and Ge Xia. Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In Symposium on Theoretical Aspects of Computer Science STAGS 2005, volume 3404 of LNCS, pages 269-280. Springer, 2005.
4. F. Dehne, M. Fellows, H. Fernau, E. Prieto, and F. Rosamond. NONBLOCKER: parameterized algorithmics for MINIMUM DOMINATING SET. In Software Seminar SOFSEM, volume 3831 of LNCS, pages 237-245. Springer, 2006.
5. I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162:439-485, 2005.
6. M. Dom, J. Guo, F. Hüffner, R. Niedermeier, and A. Truß. Fixed-parameter tractability results for feedback set problems in tournaments In Conference on Algorithms and Complexity CIAC, volume 3998 of LNCS, pages 320-331. Springer, 2006.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
8. R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, pages 49-99. 1999.
9. V. Dujmović, H. Fernau, and M. Kaufmann. Fixed parameter algorithms for one-sided crossing minimization revisited. In Graph Drawing, 11th International Symposium GD 2003, volume 2912 of LNCS, pages 332-344. Springer, 2004.
10. H. Fernau. A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity ECCC, 2004.
11. H. Fernau. Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschrift, Universität Tübingen, Germany, 2005.
12. H. Fernau. Parameterized algorithmics for linear arrangement problems. In CTW 2005: Workshop on Graphs and Combinatorial Optimization, pages 27-31. University of Cologne, Germany, 2005. Long version submitted.
13. H. Fernau. Two-layer planarization: improving on parameterized algorithmics. Journal of Graph Algorithms and Applications, 9:205-238, 2005.
14. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39:321-347, 2004.
15. G. Gutin, A. Rafiey, S. Szeider, and A. Yeo. The linear arrangement problem parameterized above guaranteed value. In Conference on Algorithms and Complexity CIAC, volume 3998 of LNCS, pages 356-367. Springer, 2006.
16. R. Niedermeier and P. Rossmanith. An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms, 1:89-102, 2003.
17. R. Niedermeier and P. Rossmanith. On efficient fixed parameter algorithms for weighted vertex cover. Journal of Algorithms, 47:63-77, 2003.
18. M. Serna and D. M. Thilikos. Parameterized complexity for graph layout problems. EATCS Bulletin, 86:41-65, 2005.