Hanno Lefmann

According to our database1, Hanno Lefmann authored at least 82 papers between 1984 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Edge-colorings avoiding rainbow stars.
Journal of Graph Theory, 2018

2017
A Rainbow Erdös-Rothschild Problem.
SIAM J. Discrete Math., 2017

Estimating the distance to a hereditary graph property.
Electronic Notes in Discrete Mathematics, 2017

Stability of extremal hypergraphs with applications to an edge-coloring problem.
Electronic Notes in Discrete Mathematics, 2017

On graphs with a large number of edge-colorings avoiding a rainbow triangle.
Eur. J. Comb., 2017

2016
A coloring problem for intersecting vector spaces.
Discrete Mathematics, 2016

Estimating Parameters Associated with Monotone Properties.
Proceedings of the Approximation, 2016

2015
Edge-colorings avoiding fixed rainbow stars.
Electronic Notes in Discrete Mathematics, 2015

A rainbow Erdős-Rothschild problem.
Electronic Notes in Discrete Mathematics, 2015

Edge-colorings avoiding a fixed matching with a prescribed color pattern.
Eur. J. Comb., 2015

Edge-colorings of uniform hypergraphs avoiding monochromatic matchings.
Discrete Mathematics, 2015

2014
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number.
Eur. J. Comb., 2014

2013
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs.
Journal of Graph Theory, 2013

Graphs on Affine and Linear Spaces and Deuber Sets.
Electr. J. Comb., 2013

An Unstable Hypergraph Problem with a Unique Optimal Solution.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Hypergraphs with many Kneser colorings.
Eur. J. Comb., 2012

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size.
Combinatorics, Probability & Computing, 2012

2011
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number.
Electronic Notes in Discrete Mathematics, 2011

2009
Kneser Colorings of Uniform Hypergraphs.
Electronic Notes in Discrete Mathematics, 2009

Generalizations of Heilbronn's triangle problem.
Eur. J. Comb., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Combinatorics, Probability & Computing, 2009

2008
Distributions of points in the unit square and large k-gons.
Eur. J. Comb., 2008

Distributions of Points in d Dimensions and Large k -Point Simplices.
Discrete & Computational Geometry, 2008

No lGrid-Points in Spaces of Small Dimension.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Generalizations of Heilbronn's Triangle Problem.
Electronic Notes in Discrete Mathematics, 2007

Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points.
Proceedings of the Combinatorial Optimization and Applications, 2007

Convex Hulls of Point-Sets and Non-uniform Hypergraphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Large triangles in the d-dimensional unit cube.
Theor. Comput. Sci., 2006

Distributions of Points and Large Convex Hulls of k Points.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Sparse Parity-Check Matrices over ${GF(q)}$.
Combinatorics, Probability & Computing, 2005

Distributions of points in the unit-square and large k-gons.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Distributions of Points in d Dimensions and Large k-Point Simplices.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Distributions of Points and Large Quadrangles.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Large Triangles in the d-Dimensional Unit-Cube.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract).
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions.
SIAM J. Comput., 2002

A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2000
MODp-tests, almost independence and small probability spaces.
Random Struct. Algorithms, 2000

Coloring arcs of convex sets.
Discrete Mathematics, 2000

On Heilbronn's problem in higher dimension.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
The Algorithmic Aspects of Uncrowded Hypergraphs.
SIAM J. Comput., 1999

Sparse 0-1-Matrices And Forbidden Hypergraphs.
Combinatorics, Probability & Computing, 1999

1998
On k-Partite Subgraphs.
Ars Comb., 1998

Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximating Maximum Independent Sets in Uniform Hypergraphs.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
PAC-Learning from General Examples.
Theor. Comput. Sci., 1997

On Sparse Parity Check Matrices.
Des. Codes Cryptography, 1997

MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract).
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

An Algorithm for Heilbronn's Problem.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Multicolored Subsets in Colored Hypergraphs.
J. Comb. Theory, Ser. A, 1996

Independent Sets in Graphs with Triangles.
Inf. Process. Lett., 1996

Canonical partition relations for (m, p, c)-systems.
Discrete Mathematics, 1996

On the degree of regularity of some equations.
Discrete Mathematics, 1996

A Combinatorial Design Approach to MAXCUT.
Proceedings of the STACS 96, 1996

Proper Bounded Edge-Colorings.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

On Sparse Parity Chack Matrices (Extended Abstract).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.
SIAM J. Comput., 1995

On Uncrowded Hypergraphs.
Random Struct. Algorithms, 1995

Shift graphs and lower bounds on Ramsey numbers rk(l; r).
Discrete Mathematics, 1995

Monochromatic and zero-sum sets of nondecreasing diameter.
Discrete Mathematics, 1995

Point Sets with Distinct Distances.
Combinatorica, 1995

On Erdös-Rado Numbers.
Combinatorica, 1995

Infinite Partition Regular Matrices.
Combinatorica, 1995

Some Typical Properties of Large AND/OR Boolean Formulas.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Derandomization for Sparse Approximations and Independent Sets.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Rado's Theorem for Commutative Rings.
J. Comb. Theory, Ser. A, 1994

The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms, 1994

1993
On Canonical Ramsey Numbers for Complete Graphs versus Paths.
J. Comb. Theory, Ser. B, 1993

Rigid Linear Binary Codes.
J. Comb. Theory, Ser. A, 1993

Partition Regularity of (M, P, C)-Systems.
J. Comb. Theory, Ser. A, 1993

Approximations with Axis-Aligned Rectangles (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
Monochromatic Vs multicolored paths.
Graphs and Combinatorics, 1992

The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
On partition regular systems of equations.
J. Comb. Theory, Ser. A, 1991

Non t-intersecting families of linear spaces over GF(q).
Discrete Mathematics, 1991

1990
On Families in Finite Lattices.
Eur. J. Comb., 1990

1989
Partitions of Aomega.
SIAM J. Discrete Math., 1989

A note on monoton waves.
J. Comb. Theory, Ser. A, 1989

An extremal problem for Graham-Rotschild parameter words.
Combinatorica, 1989

1986
A canonical version for partition regular systems of linear equations.
J. Comb. Theory, Ser. A, 1986

1984
A remark on infinite arithmetic progressions.
Discrete Mathematics, 1984


  Loading...