| 2021 | LAGOS | Maximum number of r-edge-colorings such that all copies of K | Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt |
| 2008 | AAIM | No lGrid-Points in Spaces of Small Dimension. | Hanno Lefmann |
| 2007 | AAIM | Convex Hulls of Point-Sets and Non-uniform Hypergraphs. | Hanno Lefmann |
| 2007 | COCOA | Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points. | Hanno Lefmann |
| 2006 | AAIM | Distributions of Points and Large Convex Hulls of | Hanno Lefmann |
| 2005 | COCOON | Distributions of Points in | Hanno Lefmann |
| 2005 | SODA | Distributions of points in the unit-square and large | Hanno Lefmann |
| 2004 | COCOON | Large Triangles in the d-Dimensional Unit-Cube. | Hanno Lefmann |
| 2004 | ISAAC | Distributions of Points and Large Quadrangles. | Hanno Lefmann |
| 2003 | COCOON | Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). | Hanno Lefmann |
| 2002 | LATIN | A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. | Hanno Lefmann, Niels Schmitt |
| 2000 | SODA | On Heilbronn's problem in higher dimension. | Hanno Lefmann |
| 1998 | MFCS | Approximating Maximum Independent Sets in Uniform Hypergraphs. | Thomas Hofmeister, Hanno Lefmann |
| 1998 | SODA | Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract). | Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann |
| 1997 | COCOON | An Algorithm for Heilbronn's Problem. | Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann |
| 1997 | SODA | The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract). | Claudia Bertram-Kretzberg, Hanno Lefmann |
| 1997 | STACS | MOD | Claudia Bertram-Kretzberg, Hanno Lefmann |
| 1996 | COCOON | On Sparse Parity Chack Matrices (Extended Abstract). | Hanno Lefmann, Pavel Pudlk, Petr Savick |
| 1996 | STACS | A Combinatorial Design Approach to MAXCUT. | Thomas Hofmeister, Hanno Lefmann |
| 1995 | MFCS | Derandomization for Sparse Approximations and Independent Sets. | Thomas Hofmeister, Hanno Lefmann |
| 1995 | MFCS | Some Typical Properties of Large AND/OR Boolean Formulas. | Hanno Lefmann, Petr Savick |
| 1993 | FCT | Approximations with Axis-Aligned Rectangles (Extended Abstract). | Paul Fischer, Klaus-Uwe Hffgen, Hanno Lefmann, Tomasz Luczak |
| 1992 | FOCS | The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) | Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rdl, Raphael Yuster |