Hanno Lefmann

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