FPT Algorithms for Domination in Biclique-Free Graphs

2012/01/01 by Jan Arne Telle, Yngve Villanger · 6 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Graph Labeling and Dimension Problems #Mathematics

paper · doi:10.1007/978-3-642-33090-2_69

published in Lecture Notes in Computer Science, 802-812 (Springer Berlin Heidelberg)

crossref issued 2012/01/01 · crossref published 2012/01/01 · crossref published-print 2012/01/01 · openalex publication_date 2012/01/01 · crossref created 2012/08/28 · crossref deposited 2021/05/04 · openalex created_date 2025/10/10 · crossref indexed 2026/06/07 · openalex updated_date 2026/08/04

Citations

• Invitation to Fixed-Parameter Algorithms
• Parameterized Complexity Theory
• Approximation algorithms for combinatorial problems
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs

Cited by

• The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
• Dense graph [wikipedia]
• Dominating set [wikipedia]