F. Reidl

Most-cited papers

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
Eun Jung Kim, Alexander Langer, C. Paul, F. Reidl +3 more
2012International Colloquium on Automata, Languages and Programming140 citations Open access
Semantic Scholar
Kernelization Using Structural Parameters on Sparse Graph Classes
Jakub Gajarský, Petr Hliněný, J. Obdržálek, S. Ordyniak +4 more
2013Embedded Systems and Applications107 citations Open access
Semantic Scholar
A Faster Parameterized Algorithm for Treedepth
F. Reidl, P. Rossmanith, Fernando Sánchez Villaamil, S. Sikdar
2014International Colloquium on Automata, Languages and Programming71 citations
Semantic Scholar
Kernelization and Sparseness: the case of Dominating Set
P. G. Drange, Markus S. Dregi, F. Fomin, S. Kreutzer +8 more
2014Symposium on Theoretical Aspects of Computer Science64 citations
Semantic Scholar
Algorithms and Models for the Web Graph
Matthew Farrell, T. Goodrich, Nathan Lemons, F. Reidl +2 more
2014Lecture Notes in Computer Science55 citations Open access
Semantic Scholar
Characterising Bounded Expansion by Neighbourhood Complexity
F. Reidl, Fernando Sánchez Villaamil, K. Stavropoulos
2016European journal of combinatorics (Print)53 citations Open access
Semantic Scholar
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs
E. Demaine, F. Reidl, P. Rossmanith, Fernando Sánchez Villaamil +2 more
2014Journal of computer and system sciences (Print)41 citations Open access
Semantic Scholar
Practical algorithms for MSO model-checking on tree-decomposable graphs
Alexander Langer, F. Reidl, P. Rossmanith, S. Sikdar
2014Computer Science Review38 citations Open access
Semantic Scholar
Evaluation of an MSO-Solver
Alexander Langer, F. Reidl, P. Rossmanith, S. Sikdar
2012Workshop on Algorithm Engineering and Experimentation35 citations Open access
Semantic Scholar
Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity
C. T. Brown, Dominik Moritz, Michael P. O'Brien, F. Reidl +2 more
2020Genome Biology34 citations Open access
Semantic Scholar
Zig-Zag Numberlink is NP-Complete
Aaron B. Adcock, E. Demaine, M. Demaine, Michael P. O'Brien +3 more
2014Journal of Information Processing31 citations Open access
Semantic Scholar
Objective Specifications of Terrestrial Laserscanners – A Contribution of the Geodetic Laboratory at the Technische Universität München
T. Wunderlich, Peter Wasmeier, J. Ohlmann-Lauber, T. Schäfer +1 more
201325 citations
Semantic Scholar
A practical fpt algorithm for Flow Decomposition and transcript assembly
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, F. Reidl +3 more
2017Workshop on Algorithm Engineering and Experimentation22 citations
Semantic Scholar
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms
E. Demaine, F. Reidl, P. Rossmanith, Fernando Sánchez Villaamil +2 more
2014arXiv.org20 citations
Semantic Scholar
Structural sparseness and complex networks
F. Reidl, Peter Rossmanith, Jaroslav Nesetril
201616 citations
Semantic Scholar
Fast Biclustering by Dual Parameterization
P. G. Drange, F. Reidl, Fernando Sánchez Villaamil, S. Sikdar
2015International Symposium on Parameterized and Exact Computation16 citations
Semantic Scholar
Overlapping Communities in Social Networks
Jannik Dreier, Philipp Kuinke, R. Przybylski, F. Reidl +2 more
2014arXiv.org14 citations
Semantic Scholar
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
Wojciech Nadara, M. Pilipczuk, R. Rabinovich, F. Reidl +1 more
2018The Sea12 citations Open access
Semantic Scholar
Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity
C. T. Brown, Dominik Moritz, Michael P. O'Brien, F. Reidl +2 more
2018bioRxiv12 citations Open access
Semantic Scholar
Alternative parameterizations of Metric Dimension
G. Gutin, M. Ramanujan, F. Reidl, Magnus Wahlström
2018Theoretical Computer Science11 citations Open access
Semantic Scholar
A general kernelization technique for domination and independence problems in sparse classes
Carl Einarson, F. Reidl
2020International Symposium on Parameterized and Exact Computation10 citations
Semantic Scholar
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
G. Gutin, F. Reidl, Magnus Wahlström, M. Zehavi
2017Journal of computer and system sciences (Print)10 citations Open access
Semantic Scholar
$k$-Distinct In- and Out-Branchings in Digraphs
G. Gutin, F. Reidl, Magnus Wahlström
2016International Colloquium on Automata, Languages and Programming8 citations Open access
Semantic Scholar
Width, depth and space
Li-Hsuan Chen, F. Reidl, P. Rossmanith, Fernando Sánchez Villaamil
2016Algorithms8 citations Open access
Semantic Scholar
Hierarchical Clustering for Real-Time Stream Data with Noise
P. Kranen, F. Reidl, Fernando Sánchez Villaamil, T. Seidl
2011International Conference on Statistical and Scientific Database Management8 citations
Semantic Scholar
Air-Indexing on Error Prone Communication Channels
Emmanuel Müller, P. Kranen, Michael Nett, F. Reidl +1 more
2010International Conference on Database Systems for Advanced Applications7 citations
Semantic Scholar
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
F. Reidl, Blair D. Sullivan
2020Algorithmica6 citations Open access
Semantic Scholar
Path-Contractions, Edge Deletions and Connectivity Preservation
G. Gutin, M. Ramanujan, F. Reidl, Magnus Wahlström
2017Embedded Systems and Applications6 citations Open access
Semantic Scholar
Linear Kernels on Graphs Excluding Topological Minors
Alexander Langer, F. Reidl, P. Rossmanith, S. Sikdar
2012arXiv.org6 citations
Semantic Scholar
Parameterized Algorithms for Zero Extension and Metric Labelling Problems
F. Reidl, Magnus Wahlström
2018International Colloquium on Automata, Languages and Programming5 citations
Semantic Scholar
Results on H-Freeness Testing in Graphs of Bounded r-Admissibility
Christine Awofeso, P. Greaves, Oded Lachish, F. Reidl
2025Symposium on Theoretical Aspects of Computer Science4 citations
Semantic Scholar
Being Even Slightly Shallow Makes Life Hard
I. Muzi, Michael P. O'Brien, F. Reidl, Blair D. Sullivan
2017International Symposium on Mathematical Foundations of Computer Science4 citations
Semantic Scholar
Investigation of Failure Processes in the Human Femur using Signal-Based Acoustic Emission Techniques
F. Stark, F. Malm, E. G. García, P. Föhr +3 more
20124 citations
Semantic Scholar
Experimental Evaluation of an Independent Set Algorithm
F. Reidl
20104 citations
Semantic Scholar
A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
Christine Awofeso, P. Greaves, Oded Lachish, Amit Levi +1 more
2025arXiv.org3 citations
Semantic Scholar
Testing C_k-Freeness in Bounded Admissibility Graphs
Christine Awofeso, P. Greaves, Oded Lachish, Amit Levi +1 more
2025International Colloquium on Automata, Languages and Programming3 citations
Semantic Scholar
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
Y. Mizutani, Daniel Coimbra Salomao, A. Crane, Matthias Bentert +4 more
2024arXiv.org3 citations
Semantic Scholar
Meta-analysis of metagenomes via machine learning and assembly graphs reveals strain switches in Crohn’s disease
Taylor E. Reiter, L. Irber, Alicia A. Gingrich, D. Haynes +8 more
2022bioRxiv3 citations Open access
Semantic Scholar
When you come at the kings you best not miss
Oded Lachish, F. Reidl, Chhaya Trehan
2022Foundations of Software Technology and Theoretical Computer Science3 citations Open access
Semantic Scholar
Longitudinal Comparison of Constant Artifacts in Optical Coherence Tomography Angiography in Patients with Posterior Uveitis Compared to Healthy Subjects
D. Pohlmann, Martin Berlin, F. Reidl, S. Künzel +3 more
2022Journal of Clinical Medicine3 citations Open access
Semantic Scholar
Searching for Maximum Out-Degree Vertices in Tournaments
G. Gutin, G. Mertzios, F. Reidl
2018arXiv.org3 citations
Semantic Scholar
Computing complexity measures of degenerate graphs
P. G. Drange, P. Greaves, I. Muzi, F. Reidl
2023International Symposium on Parameterized and Exact Computation2 citations Open access
Semantic Scholar
Finite Integer Index of Pathwidth and Treewidth
Jakub Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl +3 more
2014International Symposium on Parameterized and Exact Computation2 citations
Semantic Scholar
A characterization of one-sided error testable graph properties in bounded degeneracy graphs
Oded Lachish, Amit Levi, Ilan Newman, F. Reidl
2026arXiv.org1 citations
Semantic Scholar
Correlation Clustering with Vertex Splitting
Matthias Bentert, A. Crane, P. G. Drange, F. Reidl +1 more
2024Scandinavian Workshop on Algorithm Theory1 citations
Semantic Scholar
Harmless Sets in Sparse Classes
P. G. Drange, I. Muzi, F. Reidl
2021International Workshop on Combinatorial Algorithms1 citations Open access
Semantic Scholar
Kernelization and hardness of harmless sets in sparse classes
P. G. Drange, I. Muzi, F. Reidl
2021arXiv.org1 citations
Semantic Scholar
Domination above r-independence: does sparseness help?
Carl Einarson, F. Reidl
2019International Symposium on Mathematical Foundations of Computer Science1 citations
Semantic Scholar
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models
Alex J. Chin, T. Goodrich, Michael P. O'Brien, F. Reidl +2 more
2016Industrial Conference on Data Mining1 citations Open access
Semantic Scholar
CONCUSS: Version 2.0
Michael P. O'Brien, C. G. Hobbs, N. Rodrigues, Blair D. Sullivan +3 more
20161 citations
Semantic Scholar