2005Unpublished venueRequires access

SYSTEMATIC KERNELIZATION IN FPT ALGORITHM DESIGN

Elena Prieto, Ciencias Matemáticas

Open publisher page 62 citations

Abstract

I hereby certify that the work embodied in this thesis is the result of original research and has not been submitted for a higher degree to any other University or Institution.

About this research paper

What this paper is about

I hereby certify that the work embodied in this thesis is the result of original research and has not been submitted for a higher degree to any other University or Institution.

Why it matters

OpenAlex reports 62 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

I hereby certify that the work embodied in this thesis is the result of original research and has not been submitted for a higher degree to any other University or Institution.

Key concepts: Kernelization, Parameterized complexity, Reduction (mathematics), Mathematics, Heuristics, Bounded function, Lemma (botany), Function (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
SYSTEMATIC KERNELIZATION IN FPT ALGORITHM DESIGN — Research Paper | ScholarLens