| 2008 |
|---|
| 63 | EE | Hanno Lefmann:
No lGrid-Points in Spaces of Small Dimension.
AAIM 2008: 259-270 |
| 62 | EE | Hanno Lefmann:
Distributions of Points in d Dimensions and Large k -Point Simplices.
Discrete & Computational Geometry 40(3): 401-413 (2008) |
| 61 | EE | Hanno Lefmann:
Distributions of points in the unit square and large k-gons.
Eur. J. Comb. 29(4): 946-965 (2008) |
| 60 | EE | Hanno Lefmann:
Point sets in the unit square and large areas of convex hulls of subsets of points.
J. Comb. Optim. 16(2): 182-195 (2008) |
| 2007 |
|---|
| 59 | EE | Hanno Lefmann:
Convex Hulls of Point-Sets and Non-uniform Hypergraphs.
AAIM 2007: 285-295 |
| 58 | EE | Hanno Lefmann:
Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points.
COCOA 2007: 230-241 |
| 57 | EE | Hanno Lefmann:
Generalizations of Heilbronn's Triangle Problem.
Electronic Notes in Discrete Mathematics 29: 553-557 (2007) |
| 2006 |
|---|
| 56 | EE | Hanno Lefmann:
Distributions of Points and Large Convex Hulls of k Points.
AAIM 2006: 173-184 |
| 55 | EE | Hanno Lefmann:
Large triangles in the d-dimensional unit cube.
Theor. Comput. Sci. 363(1): 85-98 (2006) |
| 2005 |
|---|
| 54 | EE | Hanno Lefmann:
Distributions of Points in d Dimensions and Large k-Point Simplices.
COCOON 2005: 514-523 |
| 53 | EE | Hanno Lefmann:
Distributions of points in the unit-square and large k-gons.
SODA 2005: 241-250 |
| 52 | EE | Hanno Lefmann:
Sparse Parity-Check Matrices over ${GF(q)}$.
Combinatorics, Probability & Computing 14(1-2): 147-169 (2005) |
| 2004 |
|---|
| 51 | EE | Hanno Lefmann:
Large Triangles in the d-Dimensional Unit-Cube.
COCOON 2004: 43-52 |
| 50 | EE | Hanno Lefmann:
Distributions of Points and Large Quadrangles.
ISAAC 2004: 657-668 |
| 2003 |
|---|
| 49 | EE | Hanno Lefmann:
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract).
COCOON 2003: 112-121 |
| 48 | EE | Hanno Lefmann:
On Heilbronn's Problem in Higher Dimension.
Combinatorica 23(4): 669-680 (2003) |
| 2002 |
|---|
| 47 | EE | Hanno Lefmann,
Niels Schmitt:
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.
LATIN 2002: 165-180 |
| 46 | EE | Hanno Lefmann,
Niels Schmitt:
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions.
SIAM J. Comput. 31(6): 1926-1947 (2002) |
| 2000 |
|---|
| 45 | EE | Hanno Lefmann:
On Heilbronn's problem in higher dimension.
SODA 2000: 60-64 |
| 44 | EE | Heiko Harborth,
Hanno Lefmann:
Coloring arcs of convex sets.
Discrete Mathematics 220(1-3): 107-117 (2000) |
| 43 | | Claudia Bertram-Kretzberg,
Hanno Lefmann:
MODp-tests, almost independence and small probability spaces.
Random Struct. Algorithms 16(4): 293-313 (2000) |
| 42 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
An Algorithm for Heilbronn's Problem.
SIAM J. Comput. 30(2): 383-390 (2000) |
| 1999 |
|---|
| 41 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
Sparse 0-1-Matrices And Forbidden Hypergraphs
Combinatorics, Probability & Computing 8(5): (1999) |
| 40 | | Claudia Bertram-Kretzberg,
Hanno Lefmann:
The Algorithmic Aspects of Uncrowded Hypergraphs.
SIAM J. Comput. 29(1): 201-230 (1999) |
| 1998 |
|---|
| 39 | EE | Thomas Hofmeister,
Hanno Lefmann:
Approximating Maximum Independent Sets in Uniform Hypergraphs.
MFCS 1998: 562-570 |
| 38 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract).
SODA 1998: 181-187 |
| 37 | | Thomas Hofmeister,
Hanno Lefmann:
On k-Partite Subgraphs.
Ars Comb. 50: (1998) |
| 1997 |
|---|
| 36 | | Claudia Bertram-Kretzberg,
Thomas Hofmeister,
Hanno Lefmann:
An Algorithm for Heilbronn's Problem.
COCOON 1997: 23-31 |
| 35 | | Claudia Bertram-Kretzberg,
Hanno Lefmann:
The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract).
SODA 1997: 296-304 |
| 34 | | Claudia Bertram-Kretzberg,
Hanno Lefmann:
MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract).
STACS 1997: 141-152 |
| 33 | | Hanno Lefmann,
Pavel Pudlák,
Petr Savický:
On Sparse Parity Check Matrices.
Des. Codes Cryptography 12(2): 107-130 (1997) |
| 32 | | Hanno Lefmann,
Petr Savický:
Some typical properties of large AND/OR Boolean formulas.
Random Struct. Algorithms 10(3): 337-351 (1997) |
| 31 | EE | Paul Fischer,
Klaus-Uwe Höffgen,
Hanno Lefmann:
PAC-Learning from General Examples.
Theor. Comput. Sci. 172(1-2): 43-65 (1997) |
| 1996 |
|---|
| 30 | | Hanno Lefmann,
Pavel Pudlák,
Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract).
COCOON 1996: 41-49 |
| 29 | | Thomas Hofmeister,
Hanno Lefmann:
A Combinatorial Design Approach to MAXCUT.
STACS 1996: 441-452 |
| 28 | EE | Arie Bialostocki,
Hanno Lefmann,
Terry Meerdink:
On the degree of regularity of some equations.
Discrete Mathematics 150(1-3): 49-60 (1996) |
| 27 | EE | Neil Hindman,
Hanno Lefmann:
Canonical partition relations for (m, p, c)-systems.
Discrete Mathematics 162(1-3): 151-174 (1996) |
| 26 | EE | Thomas Hofmeister,
Hanno Lefmann:
Independent Sets in Graphs with Triangles.
Inf. Process. Lett. 58(5): 207-210 (1996) |
| 25 | EE | Hanno Lefmann,
Vojtech Rödl,
Beata Wysocka:
Multicolored Subsets in Colored Hypergraphs.
J. Comb. Theory, Ser. A 74(2): 209-248 (1996) |
| 24 | | Thomas Hofmeister,
Hanno Lefmann:
A combinatorial design approach to MAXCUT.
Random Struct. Algorithms 9(1-2): 163-175 (1996) |
| 1995 |
|---|
| 23 | | Thomas Hofmeister,
Hanno Lefmann:
Derandomization for Sparse Approximations and Independent Sets.
MFCS 1995: 201-210 |
| 22 | | Hanno Lefmann,
Petr Savický:
Some Typical Properties of Large AND/OR Boolean Formulas.
MFCS 1995: 237-246 |
| 21 | | Hanno Lefmann,
Vojtech Rödl:
On Erdös-Rado Numbers.
Combinatorica 15(1): 85-104 (1995) |
| 20 | | Walter A. Deuber,
Neil Hindman,
Imre Leader,
Hanno Lefmann:
Infinite Partition Regular Matrices.
Combinatorica 15(3): 333-355 (1995) |
| 19 | | Hanno Lefmann,
Torsten Thiele:
Point Sets with Distinct Distances.
Combinatorica 15(3): 379-408 (1995) |
| 18 | EE | Dwight Duffus,
Hanno Lefmann,
Vojtech Rödl:
Shift graphs and lower bounds on Ramsey numbers rk(l; r).
Discrete Mathematics 137(1-3): 177-187 (1995) |
| 17 | EE | Arie Bialostocki,
Paul Erdös,
Hanno Lefmann:
Monochromatic and zero-sum sets of nondecreasing diameter.
Discrete Mathematics 137(1-3): 19-34 (1995) |
| 16 | | Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl:
On Uncrowded Hypergraphs.
Random Struct. Algorithms 6(2/3): 209-212 (1995) |
| 15 | | Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl:
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.
SIAM J. Comput. 24(3): 598-620 (1995) |
| 1994 |
|---|
| 14 | | Noga Alon,
Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl,
Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms 16(1): 80-109 (1994) |
| 13 | | Vitaly Bergelson,
Walter A. Deuber,
Neil Hindman,
Hanno Lefmann:
Rado's Theorem for Commutative Rings.
J. Comb. Theory, Ser. A 66(1): 68-92 (1994) |
| 1993 |
|---|
| 12 | | Paul Fischer,
Klaus-Uwe Höffgen,
Hanno Lefmann,
Tomasz Luczak:
Approximations with Axis-Aligned Rectangles (Extended Abstract).
FCT 1993: 244-255 |
| 11 | | Hanno Lefmann,
Kevin T. Phelps,
Vojtech Rödl:
Rigid Linear Binary Codes.
J. Comb. Theory, Ser. A 63(1): 110-128 (1993) |
| 10 | | Neil Hindman,
Hanno Lefmann:
Partition Regularity of (M, P, C)-Systems.
J. Comb. Theory, Ser. A 64(1): 1-9 (1993) |
| 9 | EE | Hanno Lefmann,
Vojtech Rödl:
On Canonical Ramsey Numbers for Complete Graphs versus Paths.
J. Comb. Theory, Ser. B 58(1): 1-13 (1993) |
| 1992 |
|---|
| 8 | | Noga Alon,
Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl,
Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
FOCS 1992: 473-481 |
| 1991 |
|---|
| 7 | EE | Hanno Lefmann:
Non t-intersecting families of linear spaces over GF(q).
Discrete Mathematics 89(2): 173-183 (1991) |
| 6 | EE | Hanno Lefmann:
On partition regular systems of equations.
J. Comb. Theory, Ser. A 58(1): 35-53 (1991) |
| 1989 |
|---|
| 5 | | Hanno Lefmann:
An extremal problem for Graham-Rotschild parameter words.
Combinatorica 9(2): 153-160 (1989) |
| 4 | EE | Hanno Lefmann:
A note on monoton waves.
J. Comb. Theory, Ser. A 50(2): 316-318 (1989) |
| 3 | | Hanno Lefmann,
Bernd Voigt:
Partitions of Aomega.
SIAM J. Discrete Math. 2(4): 524-529 (1989) |
| 1986 |
|---|
| 2 | EE | Hanno Lefmann:
A canonical version for partition regular systems of linear equations.
J. Comb. Theory, Ser. A 41(1): 95-104 (1986) |
| 1984 |
|---|
| 1 | EE | Hanno Lefmann,
Bernd Voigt:
A remark on infinite arithmetic progressions.
Discrete Mathematics 52(2-3): 285-286 (1984) |
