| 1999 | COCOON | On Routing in Circulant Graphs. | Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski |
| 1999 | COCOON | GCD of Many Integers. | Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas |
| 1999 | MFCS | The Complexity of the Extended GCD Problem. | George Havas, Jean-Pierre Seifert |
| 1998 | ICDCS | Improved Lightpath (Wavelength) Routing in Large WDM Networks. | Weifa Liang, George Havas, Xiaojun Shen |
| 1997 | EuroPar | NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. | Weifa Liang, George Havas |
| 1997 | ISSAC | On the Worst-case Complexity of Integer Gaussian Elimination. | Xin Gui Fang, George Havas |
| 1997 | PDPTA | An Efficient Method for Constructing a Distributed Depth-First Search Tree. | S. A. M. Makki, George Havas |
| 1995 | ISAAC | A Hard Problem That is Almost Always Easy. | George Havas, Bohdan S. Majewski |
| 1995 | ISSAC | A Solution to the Extended GCD Problem. | Bohdan S. Majewski, George Havas |
| 1994 | ICPP | Distributed Algorithms for Constructing a Depth-First-Search Tree. | S. A. M. Makki, George Havas |
| 1994 | ISAAC | A New Problem in String Searching. | George Havas, Jin Xian Lian |
| 1993 | WG | Graphs, Hypergraphs and Hashing. | George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech |
| 1991 | ISSAC | Coset Enumeration Strategies. | George Havas |
| 1976 | ISSAC | Collection. | George Havas, Tim Nicholson |