Felix Reidl

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6089655	2023-11-13	Paper
A color-avoiding approach to subgraph counting in bounded expansion classes	2023-08-17	Paper
When you come at the kings you best not miss	2022-09-24	Paper
Harmless sets in sparse classes	2022-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q5092402	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5002776	2021-07-28	Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness	2021-04-21	Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness	2020-12-16	Paper
k-Distinct In- and Out-Branchings in Digraphs	2020-05-27	Paper
Path-Contractions, Edge Deletions and Connectivity Preservation	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111296	2020-05-26	Paper
Width, depth, and space: tradeoffs between branching and dynamic programming	2020-01-21	Paper
Alternative parameterizations of \textsc{Metric Dimension}	2020-01-16	Paper
A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly	2019-09-12	Paper
Evaluation of an MSO-Solver	2019-09-12	Paper
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs	2019-08-07	Paper
Longest paths in 2-edge-connected cubic graphs	2019-03-06	Paper
Path-contractions, edge deletions and connectivity preservation	2019-01-25	Paper
Characterising bounded expansion by neighbourhood complexity	2018-11-15	Paper
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions	2018-10-30	Paper
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials	2018-05-08	Paper
\(k\)-distinct in- and out-branchings in digraphs	2018-05-08	Paper
Fast biclustering by dual parameterization	2017-09-29	Paper
Kernelization using structural parameters on sparse graph classes	2016-11-14	Paper
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs	2016-01-08	Paper
Finite Integer Index of Pathwidth and Treewidth	2015-09-15	Paper
Practical algorithms for MSO model-checking on tree-decomposable graphs	2014-11-24	Paper
A Faster Parameterized Algorithm for Treedepth	2014-07-01	Paper
Kernelization Using Structural Parameters on Sparse Graph Classes	2013-09-17	Paper
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions	2013-08-06	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Felix Reidl