Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems
The challenge of transforming polynomialtime algorithms to really efficient ones.
André Nichterlein
Advertisement
Author Archives
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved