Felix Reidl

From MaRDI portal
Person:340579

Available identifiers

zbMath Open reidl.felixMaRDI QIDQ340579

List of research outcomes





PublicationDate of PublicationType
When you come at the king you best not miss2024-09-12Paper
https://portal.mardi4nfdi.de/entity/Q60896552023-11-13Paper
A color-avoiding approach to subgraph counting in bounded expansion classes2023-08-17Paper
When you come at the kings you best not miss2022-09-24Paper
Harmless sets in sparse classes2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50924022022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50027762021-07-28Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness2021-04-21Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness2020-12-16Paper
k-Distinct In- and Out-Branchings in Digraphs2020-05-27Paper
Path-Contractions, Edge Deletions and Connectivity Preservation2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51112962020-05-26Paper
Width, depth, and space: tradeoffs between branching and dynamic programming2020-01-21Paper
Alternative parameterizations of \textsc{Metric Dimension}2020-01-16Paper
Evaluation of an MSO-Solver2019-09-12Paper
A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly2019-09-12Paper
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs2019-08-07Paper
Longest paths in 2-edge-connected cubic graphs2019-03-06Paper
Path-contractions, edge deletions and connectivity preservation2019-01-25Paper
Characterising bounded expansion by neighbourhood complexity2018-11-15Paper
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions2018-10-30Paper
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials2018-05-08Paper
\(k\)-distinct in- and out-branchings in digraphs2018-05-08Paper
Fast biclustering by dual parameterization2017-09-29Paper
Kernelization using structural parameters on sparse graph classes2016-11-14Paper
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs2016-01-08Paper
Finite Integer Index of Pathwidth and Treewidth2015-09-15Paper
Practical algorithms for MSO model-checking on tree-decomposable graphs2014-11-24Paper
A Faster Parameterized Algorithm for Treedepth2014-07-01Paper
Kernelization Using Structural Parameters on Sparse Graph Classes2013-09-17Paper
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions2013-08-06Paper

Research outcomes over time

This page was built for person: Felix Reidl