User profiles for F. Reidl

Felix Reidl

Senior Lecturer, Birkbeck University
Verified email at dcs.bbk.ac.uk
Cited by 793

Linear kernels and single-exponential algorithms via protrusion decompositions

EJ Kim, A Langer, C Paul, F Reidl… - ACM Transactions on …, 2015 - dl.acm.org
… Given an n-vertex graph G and a non-negative integer k, Planar-F-Deletion asks whether …
F. As our second application, we present the first single-exponential algorithm to solve Planar-F

Practical algorithms for MSO model-checking on tree-decomposable graphs

A Langer, F Reidl, P Rossmanith, S Sikdar - Computer Science Review, 2014 - Elsevier
In this survey, we review practical algorithms for graph-theoretic problems that are expressible
in monadic second-order logic. Monadic second-order (MSO) logic allows quantifications …

A faster parameterized algorithm for treedepth

F Reidl, P Rossmanith, FS Villaamil… - … Colloquium on Automata …, 2014 - Springer
… ,X ,h ),X ⊆ X such that F generalizes F topologically as witnessed by the mapping f : V (F )
→ V (F). We say that h is compatible with h under f if for every node z ∈ F with children C in F

[HTML][HTML] Kernelization using structural parameters on sparse graph classes

…, P Hliněnŭ, J Obdržálek, S Ordyniak, F Reidl… - Journal of Computer and …, 2017 - Elsevier
… If G is a graph class of bounded expansion with expansion function f, we say that G has
expansion bounded by f. An important relation we make use of later is: ∇ d ( G ) = ∇ 0 ( G ▿ d ) , …

Kernelization and sparseness: the case of dominating set

…, M Pilipczuk, M Pilipczuk, F Reidl… - arXiv preprint arXiv …, 2014 - arxiv.org
… to be bounded by f(k) · nc for some computable function f and … is bounded by f(k) for some
computable function f, called the … function f : N → R such that for all r we have that ∇r(G) ⩽ f(r). …

[HTML][HTML] Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity

CT Brown, D Moritz, MP O'Brien, F Reidl, T Reiter… - Genome biology, 2020 - Springer
Genomes computationally inferred from large metagenomic data sets are often incomplete
and may be missing functionally important content and strain variation. We introduce an …

[HTML][HTML] Characterising bounded expansion by neighbourhood complexity

F Reidl, FS Villaamil, K Stavropoulos - European Journal of Combinatorics, 2019 - Elsevier
… Thus for a set S of signatures and a function f : S → A for an arbitrary set A , we employ the
notation ( f ( σ ) ) σ ∈ S to obtain sequences over elements of A derived from that ordering. For …

Zig-zag numberlink is NP-complete

…, ML Demaine, MP O'Brien, F Reidl… - Journal of Information …, 2015 - jstage.jst.go.jp
When can t terminal pairs in an m× n grid be connected by t vertex-disjoint paths that cover
all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can …

[HTML][HTML] Influenza at the animal–human interface: a review of the literature for virological evidence of human infection with swine or avian influenza viruses other than …

GS Freidl, A Meijer, E de Bruin, M de Nardi… - …, 2014 - eurosurveillance.org
Factors that trigger human infection with animal influenza virus progressing into a pandemic
are poorly understood. Within a project developing an evidence-based risk assessment …

[HTML][HTML] Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

ED Demaine, F Reidl, P Rossmanith… - Journal of Computer and …, 2019 - Elsevier
f thresh , f deg is usually straightforward, the real challenge lies in proving that functions f
, f H … at most a f H ( r ) -fraction of the vertices of G have their (topological) grad bounded by …