Martin Furer

Martin Furer is a Professor of Computer Science and Engineering at the Eberly College of Science, Pennsylvania State University. His work focuses on algorithm design, graph theory, and computational complexity, particularly involving treewidth and polynomial time methods.

• Research spans algebraic and combinatorial approaches, including NSF-funded projects on efficient algorithms.
• Key contributions to Reed’s treewidth approximation, symmetric matrix diagonalization, and fast combinatorial problem-solving techniques.
• Active collaborations with researchers like Carlos Hoppen and Vilmar Trevisan in theoretical computer science.