Daniel Neuen

collaborators

9 papers

cs.CV2026

Reconstructing Historical Manuscripts through MSI: The Potential of Contrast in Assessing Image Quality and Legibility

Anna Breger

Digital restoration of historical manuscript images aims to improve readability while preserving the authenticity of cultural heritage documents. However, evaluating quality of res…

math.CO2026

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs

Daniel Neuen, Tim Seppelt

LovÃ¡sz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number o…

cs.DS2026

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

BarÄ±Å Can Esmer, Ariel Kulik, DÃ¡niel Marx +2

We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J. ACM 2019], by establishing a connection between parameterized approximation and expon…

cs.CC2025

Counting Small Induced Subgraphs: Hardness via Fourier Analysis

Radu Curticapean, Daniel Neuen

For a fixed graph property $I^¦$ and integer $k \geq 1$ , consider the problem of counting the induced $k$ -vertex subgraphs satisfying $I^¦$ in an input graph $G$ . This problem can be…

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 $(I^¦)$ for fixed graph properties $I^¦$ : Given a graph $G$ and an integer $k$ , this problem asks to count the number of induced $k$ -v…