Daniel Neuen

activity

20212026

most citedIsomorphism Testing Parameterized by Genus and Beyond

4 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.CC2025

Treedepth Inapproximability and Exponential ETH Lower Bound

Édouard Bonnet, Daniel Neuen, Marek Sokołowski

Treedepth is a central parameter to algorithmic graph theory. The current state-of-the-art in computing and approximating treedepth consists of a $2^{O (k^{2})} n$ -time exact algorith…

cs.CC2025

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial

Radu Curticapean, Simon Döring, Daniel Neuen

We consider the parameterized problem $#$ IndSub $(Φ)$ for fixed graph properties $Φ$ : Given a graph $G$ and an integer $k$ , this problem asks to count the number of induced $k$ -ver…