| 2005 | RECOMB | The String Barcoding Problem is NP-Hard. | Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi |
| 2002 | RECOMB | Structural alignment of large-size proteins via lagrangian relaxation. | Alberto Caprara, Giuseppe Lancia |
| 2002 | WABI | Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. | Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia |
| 2001 | ESA | SNPs Problems, Complexity, and Algorithms. | Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz |
| 2001 | RECOMB | 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. | Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail |
| 2000 | SODA | Fast practical solution of sorting by reversals. | Alberto Caprara, Giuseppe Lancia, See-Kiong Ng |
| 2000 | SODA | Algorithmic strategies in combinatorial chemistry. | Deborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz |
| 1999 | CPM | GESTALT: Genomic Steiner Alignments. | Giuseppe Lancia, R. Ravi |
| 1998 | SODA | A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. | Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang |
| 1997 | CPM | Banishing Bias from Consensus Sequences. | Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi |