Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Finding a Minimum Path Cover of a DAG is a fundamental algorithmic problem, with applications in various fields, including Bioinformatics. While a classical solution leads to a quadratic-time ...

A new algorithm performs Fourier transforms using a minimal number of samples. The fast Fourier transform, one of the most important algorithms of the 20th century, revolutionized signal processing.