3 papers
cs.DS2026
Designing Caterpillars for Graphs: Approximation and Hardness
Leon Kullmann, Phuoc Lucky Trinh, Leon Kellerhals +3
The classical Minimum Linear Arrangement (MLA) problem has been studied extensively. It is known to be NP-hard and it admits an -approximation [Feige an…
math.NT2025
Counting rational points on smooth hypersurfaces with high degree
Matteo Verzobio
Let be a smooth projective hypersurface defined over . We provide new bounds for rational points of bounded height on . In particular, we show that if is a s…
math.NT2024
Counting integer points on affine surfaces with a side condition
Tim Browning, Matteo Verzobio
We extend work of Heath-Brown and Salberger, based on the determinant method, to provide a uniform upper bound for the number of integral points of bounded height on an affine surf…