Hanno Lefmann

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 26

Top Venues

SIAM J. Discret. Math.

Discret. Math.

Electron. Notes Discret. Math.

Eur. J. Comb.

Publications

Maria Axenovich, Hanno Lefmann
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations. SIAM J. Discret. Math. 38 (1) (2024)
Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt
Edge-colorings avoiding patterns in a triangle. Discret. Math. 347 (4) (2024)
Fabrício Siqueira Benevides, Carlos Hoppen, Hanno Lefmann, Knut Odermann
. Random Struct. Algorithms 62 (3) (2023)
Josefran de Oliveira Bastos, Carlos Hoppen, Hanno Lefmann, Andy Oertel, Dionatan Ricardo Schmidt
Graphs with many edge-colorings such that complete graphs are rainbow. Discret. Appl. Math. 333 (2023)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Rainbow Erdös-Rothschild Problem for the Fano Plane. SIAM J. Discret. Math. 35 (3) (2021)
Carlos Hoppen, Hanno Lefmann, Denilson Nolibos
An extension of the rainbow Erdős-Rothschild problem. Discret. Math. 344 (8) (2021)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph. J. Graph Theory 98 (1) (2021)
Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt
are rainbow. LAGOS (2021)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. SIAM J. Discret. Math. 35 (2) (2021)
Sang June Lee, Hanno Lefmann
On the independence number of non-uniform uncrowded hypergraphs. Discret. Math. 343 (9) (2020)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29 (4) (2020)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Stability Results for Two Classes of Hypergraphs. SIAM J. Discret. Math. 33 (4) (2019)
Carlos Hoppen, Hanno Lefmann
Remarks on an Edge-coloring Problem. LAGOS (2019)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
On the query complexity of estimating the distance to hereditary graph properties. CoRR (2019)
Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches
Edge-colorings avoiding rainbow stars. J. Graph Theory 87 (4) (2018)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Stability of extremal hypergraphs with applications to an edge-coloring problem. Electron. Notes Discret. Math. 61 (2017)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
On graphs with a large number of edge-colorings avoiding a rainbow triangle. Eur. J. Comb. 66 (2017)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. 61 (2017)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
A Rainbow Erdös-Rothschild Problem. SIAM J. Discret. Math. 31 (4) (2017)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating parameters associated with monotone properties. CoRR (2017)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
A coloring problem for intersecting vector spaces. Discret. Math. 339 (12) (2016)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM (2016)
Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches
Edge-colorings avoiding fixed rainbow stars. Electron. Notes Discret. Math. 50 (2015)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
A rainbow Erdős-Rothschild problem. Electron. Notes Discret. Math. 49 (2015)
Carlos Hoppen, Hanno Lefmann
Edge-colorings avoiding a fixed matching with a prescribed color pattern. Eur. J. Comb. 47 (2015)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. 338 (2) (2015)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. 35 (2014)
David S. Gunderson, Neil Hindman, Hanno Lefmann
Some Partition Theorems for Infinite and Finite Matrices. Integers 14 (2014)
David S. Gunderson, Hanno Lefmann
Graphs on Affine and Linear Spaces and Deuber Sets. Electron. J. Comb. 20 (2) (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory (2013)
Hanno Lefmann, Yury Person
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. J. Graph Theory 73 (1) (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Hypergraphs with many Kneser colorings. Eur. J. Comb. 33 (5) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21 (1-2) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electron. Notes Discret. Math. 38 (2011)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34 (2009)
Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18 (5) (2009)
Hanno Lefmann
Generalizations of Heilbronn's triangle problem. Eur. J. Comb. 30 (7) (2009)
Hanno Lefmann
Point sets in the unit square and large areas of convex hulls of subsets of points. J. Comb. Optim. 16 (2) (2008)
Hanno Lefmann
No lGrid-Points in Spaces of Small Dimension. AAIM (2008)
Hanno Lefmann
-Point Simplices. Discret. Comput. Geom. 40 (3) (2008)
Hanno Lefmann
Distributions of points in the unit square and large k-gons. Eur. J. Comb. 29 (4) (2008)
Hanno Lefmann
Convex Hulls of Point-Sets and Non-uniform Hypergraphs. AAIM (2007)
Hanno Lefmann
Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points. COCOA (2007)
Hanno Lefmann
Generalizations of Heilbronn's Triangle Problem. Electron. Notes Discret. Math. 29 (2007)
Hanno Lefmann
-dimensional unit cube. Theor. Comput. Sci. 363 (1) (2006)
Hanno Lefmann
Points. AAIM (2006)
Hanno Lefmann
-gons. SODA (2005)
Hanno Lefmann
-Point Simplices. COCOON (2005)
Hanno Lefmann
Sparse Parity-Check Matrices over ${GF(q)}$. Comb. Probab. Comput. 14 (1-2) (2005)
Hanno Lefmann
Distributions of Points and Large Quadrangles. ISAAC (2004)
Hanno Lefmann
Large Triangles in the d-Dimensional Unit-Cube. COCOON (2004)
Hanno Lefmann
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). COCOON (2003)
Hanno Lefmann
On Heilbronn's Problem in Higher Dimension. Comb. 23 (4) (2003)
Hanno Lefmann, Niels Schmitt
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. LATIN (2002)
Hanno Lefmann, Niels Schmitt
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions. SIAM J. Comput. 31 (6) (2002)
Heiko Harborth, Hanno Lefmann
Coloring arcs of convex sets. Discret. Math. 220 (1-3) (2000)
Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
An Algorithm for Heilbronn's Problem. SIAM J. Comput. 30 (2) (2000)
Hanno Lefmann
On Heilbronn's problem in higher dimension. SODA (2000)
Claudia Bertram-Kretzberg, Hanno Lefmann
-tests, almost independence and small probability spaces. Random Struct. Algorithms 16 (4) (2000)
Claudia Bertram-Kretzberg, Hanno Lefmann
The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM J. Comput. 29 (1) (1999)
Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
Sparse 0-1-Matrices And Forbidden Hypergraphs. Comb. Probab. Comput. 8 (5) (1999)
Thomas Hofmeister, Hanno Lefmann
On k-Partite Subgraphs. Ars Comb. 50 (1998)
Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract). SODA (1998)
Thomas Hofmeister, Hanno Lefmann
Approximating Maximum Independent Sets in Uniform Hypergraphs. MFCS (1998)
Claudia Bertram-Kretzberg, Hanno Lefmann
The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract). SODA (1997)
Claudia Bertram-Kretzberg, Hanno Lefmann
-tests, Almost Independence and Small Probability Spaces (Extended Abstract). STACS (1997)
Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann
PAC-Learning from General Examples. Theor. Comput. Sci. 172 (1-2) (1997)
Hanno Lefmann, Petr Savický
Some typical properties of large AND/OR Boolean formulas. Random Struct. Algorithms 10 (3) (1997)
Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
An Algorithm for Heilbronn's Problem. COCOON (1997)
Hanno Lefmann, Pavel Pudlák, Petr Savický
On Sparse Parity Check Matrices. Des. Codes Cryptogr. 12 (2) (1997)
Hanno Lefmann, Vojtech Rödl, Beata Wysocka
Multicolored Subsets in Colored Hypergraphs. J. Comb. Theory, Ser. A 74 (2) (1996)
Thomas Hofmeister, Hanno Lefmann
Independent Sets in Graphs with Triangles. Inf. Process. Lett. 58 (5) (1996)
Claudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka
Proper Bounded Edge-Colorings. DMTCS (1996)
Thomas Hofmeister, Hanno Lefmann
A Combinatorial Design Approach to MAXCUT. STACS (1996)
Thomas Hofmeister, Hanno Lefmann
A combinatorial design approach to MAXCUT. Random Struct. Algorithms 9 (1-2) (1996)
Hanno Lefmann, Pavel Pudlák, Petr Savický
On Sparse Parity Chack Matrices (Extended Abstract). COCOON (1996)
Arie Bialostocki, Hanno Lefmann, Terry Meerdink
On the degree of regularity of some equations. Discret. Math. 150 (1-3) (1996)
Neil Hindman, Hanno Lefmann
Canonical partition relations for (m, p, c)-systems. Discret. Math. 162 (1-3) (1996)
Hanno Lefmann, Torsten Thiele
Point Sets with Distinct Distances. Comb. 15 (3) (1995)
Thomas Hofmeister, Hanno Lefmann
Derandomization for Sparse Approximations and Independent Sets. MFCS (1995)
Dwight Duffus, Hanno Lefmann, Vojtech Rödl
(l; r). Discret. Math. 137 (1-3) (1995)
Arie Bialostocki, Paul Erdös, Hanno Lefmann
Monochromatic and zero-sum sets of nondecreasing diameter. Discret. Math. 137 (1-3) (1995)
Richard A. Duke, Hanno Lefmann, Vojtech Rödl
On Uncrowded Hypergraphs. Random Struct. Algorithms 6 (2/3) (1995)
Walter A. Deuber, Neil Hindman, Imre Leader, Hanno Lefmann
Infinite Partition Regular Matrices. Comb. 15 (3) (1995)
Hanno Lefmann, Petr Savický
Some Typical Properties of Large AND/OR Boolean Formulas. MFCS (1995)
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) (1995)
Hanno Lefmann, Vojtech Rödl
On Erdös-Rado Numbers. Comb. 15 (1) (1995)
Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
The Algorithmic Aspects of the Regularity Lemma. J. Algorithms 16 (1) (1994)
Vitaly Bergelson, Walter A. Deuber, Neil Hindman, Hanno Lefmann
Rado's Theorem for Commutative Rings. J. Comb. Theory, Ser. A 66 (1) (1994)
Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak
Approximations with Axis-Aligned Rectangles (Extended Abstract). FCT (1993)
Hanno Lefmann, Vojtech Rödl
On Canonical Ramsey Numbers for Complete Graphs versus Paths. J. Comb. Theory, Ser. B 58 (1) (1993)
Neil Hindman, Hanno Lefmann
Partition Regularity of (M, P, C)-Systems. J. Comb. Theory, Ser. A 64 (1) (1993)
Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl
Rigid Linear Binary Codes. J. Comb. Theory, Ser. A 63 (1) (1993)
Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) FOCS (1992)
Hanno Lefmann, Vojtech Rödl, Robin Thomas
Monochromatic Vs multicolored paths. Graphs Comb. 8 (4) (1992)
Hanno Lefmann
Non t-intersecting families of linear spaces over GF(q). Discret. Math. 89 (2) (1991)
Hanno Lefmann
On partition regular systems of equations. J. Comb. Theory, Ser. A 58 (1) (1991)
Hanno Lefmann
On Families in Finite Lattices. Eur. J. Comb. 11 (2) (1990)
Hanno Lefmann
An extremal problem for Graham-Rotschild parameter words. Comb. 9 (2) (1989)
Hanno Lefmann, Bernd Voigt
. SIAM J. Discret. Math. 2 (4) (1989)

Hanno Lefmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hanno Lefmann