Kernels: Annotated, Proper and Induced

@inproceedings{AbuKhzam2006KernelsAP,
  title={Kernels: Annotated, Proper and Induced},
  author={F. Abu-Khzam and H. Fernau},
  booktitle={IWPEC},
  year={2006}
}
  • F. Abu-Khzam, H. Fernau
  • Published in IWPEC 2006
  • Mathematics, Computer Science
  • The notion of a problem kernel plays a central role in the design of fixed-parameter algorithms. The FPT literature is rich in kernelization algorithms that exhibit fundamentally different approaches. We highlight these differences and discuss several generalizations and restrictions of the standard notion. 
    38 Citations
    A kernelization algorithm for d-Hitting Set
    • F. Abu-Khzam
    • Mathematics, Computer Science
    • J. Comput. Syst. Sci.
    • 2010
    • 128
    • PDF
    Meta-kernelization with Structural Parameters
    Extremal Kernelization: A Commemorative Paper
    • 1
    Meta-kernelization with structural parameters
    • 15
    • PDF
    Editing graphs to satisfy degree constraints: A parameterized approach
    • 58
    • Highly Influenced
    • PDF
    The Parameterized Complexity of Regular Subgraph Problems and Generalizations
    • 23
    • PDF

    References

    SHOWING 1-10 OF 20 REFERENCES
    Parameterized algorithmics for linear arrangement problems
    • H. Fernau
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 2008
    • 20
    Parameterized Complexity
    • 3,245
    A General Data Reduction Scheme for Domination in Graphs
    • 18
    • PDF
    On the hardness of approximating minimum vertex cover
    • 576
    • PDF
    Fixed Parameter Algorithms for one-sided crossing minimization Revisited
    • 13
    • PDF
    Fixed parameter algorithms for one-sided crossing minimization revisited
    • 28
    • PDF
    NONBLOCKER: Parameterized Algorithmics for minimum dominating set
    • 45
    • PDF
    Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
    • 66
    • PDF
    An efficient fixed-parameter algorithm for 3-Hitting Set
    • 154