W. Henry Suters

According to our database, W. Henry Suters authored at least 4 papers between 2004 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Crown Structures for Vertex Cover Kernelization.

Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters

Theory Comput. Syst., 2007

2005

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem.

W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Fast, effective vertex cover kernelization: a tale of two algorithms.

Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters

Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005

2004

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.

Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004