default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanno Lefmann
Person information
- affiliation: Chemnitz University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Carlos Hoppen
, Hanno Lefmann, Dionatan Ricardo Schmidt:
Edge-colorings avoiding patterns in a triangle. Discret. Math. 347(4): 113896 (2024)- [j73]Maria Axenovich, Hanno Lefmann:
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations. SIAM J. Discret. Math. 38(1): 609-628 (2024) - 2023
- [j72]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: 151-164 (2023) - [j71]Fabrício Siqueira Benevides, Carlos Hoppen, Hanno Lefmann, Knut Odermann:
Heilbronn triangle-type problems in the unit square [0,1]2. Random Struct. Algorithms 62(3): 585-599 (2023) - 2021
- [j70]Carlos Hoppen, Hanno Lefmann, Denilson Nolibos:
An extension of the rainbow Erdős-Rothschild problem. Discret. Math. 344(8): 112443 (2021) - [j69]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): 141-173 (2021) - [j68]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): 1238-1251 (2021) - [j67]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): 1927-1951 (2021) - [c27]Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt:
Maximum number of r-edge-colorings such that all copies of Kk are rainbow. LAGOS 2021: 419-426 - 2020
- [j66]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29(4): 616-632 (2020) - [j65]Sang June Lee, Hanno Lefmann:
On the independence number of non-uniform uncrowded hypergraphs. Discret. Math. 343(9): 111964 (2020)
2010 – 2019
- 2019
- [j64]Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann:
Stability Results for Two Classes of Hypergraphs. SIAM J. Discret. Math. 33(4): 2023-2040 (2019) - [c26]Carlos Hoppen, Hanno Lefmann:
Remarks on an Edge-coloring Problem. LAGOS 2019: 511-521 - [i2]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
On the query complexity of estimating the distance to hereditary graph properties. CoRR abs/1912.01081 (2019) - 2018
- [j63]Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches:
Edge-colorings avoiding rainbow stars. J. Graph Theory 87(4): 399-429 (2018) - 2017
- [j62]Carlos Hoppen, Hanno Lefmann, Knut Odermann:
On graphs with a large number of edge-colorings avoiding a rainbow triangle. Eur. J. Comb. 66: 168-190 (2017) - [j61]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: 263-269 (2017) - [j60]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. 61: 607-613 (2017) - [j59]Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A Rainbow Erdös-Rothschild Problem. SIAM J. Discret. Math. 31(4): 2647-2674 (2017) - [i1]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. CoRR abs/1707.08225 (2017) - 2016
- [j58]Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A coloring problem for intersecting vector spaces. Discret. Math. 339(12): 2941-2954 (2016) - [c25]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM 2016: 35:1-35:13 - 2015
- [j57]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. 338(2): 262-271 (2015) - [j56]Carlos Hoppen, Hanno Lefmann:
Edge-colorings avoiding a fixed matching with a prescribed color pattern. Eur. J. Comb. 47: 75-94 (2015) - [j55]Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A rainbow Erdős-Rothschild problem. Electron. Notes Discret. Math. 49: 473-480 (2015) - [j54]Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches:
Edge-colorings avoiding fixed rainbow stars. Electron. Notes Discret. Math. 50: 275-280 (2015) - 2014
- [j53]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. 35: 354-373 (2014) - [j52]David S. Gunderson, Neil Hindman, Hanno Lefmann:
Some Partition Theorems for Infinite and Finite Matrices. Integers 14: A12 (2014) - 2013
- [j51]David S. Gunderson, Hanno Lefmann:
Graphs on Affine and Linear Spaces and Deuber Sets. Electron. J. Comb. 20(2): 47 (2013) - [j50]Hanno Lefmann, Yury Person:
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. J. Graph Theory 73(1): 1-31 (2013) - [c24]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory 2013: 432-450 - 2012
- [j49]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21(1-2): 203-218 (2012) - [j48]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Hypergraphs with many Kneser colorings. Eur. J. Comb. 33(5): 816-843 (2012) - 2011
- [j47]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: 469-474 (2011)
2000 – 2009
- 2009
- [j46]Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht:
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18(5): 803-818 (2009) - [j45]Hanno Lefmann:
Generalizations of Heilbronn's triangle problem. Eur. J. Comb. 30(7): 1686-1695 (2009) - [j44]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34: 219-223 (2009) - 2008
- [j43]Hanno Lefmann:
Distributions of Points in d Dimensions and Large k -Point Simplices. Discret. Comput. Geom. 40(3): 401-413 (2008) - [j42]Hanno Lefmann:
Distributions of points in the unit square and large k-gons. Eur. J. Comb. 29(4): 946-965 (2008) - [j41]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) - [c23]Hanno Lefmann:
No lGrid-Points in Spaces of Small Dimension. AAIM 2008: 259-270 - 2007
- [j40]Hanno Lefmann:
Generalizations of Heilbronn's Triangle Problem. Electron. Notes Discret. Math. 29: 553-557 (2007) - [c22]Hanno Lefmann:
Convex Hulls of Point-Sets and Non-uniform Hypergraphs. AAIM 2007: 285-295 - [c21]Hanno Lefmann:
Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points. COCOA 2007: 230-241 - 2006
- [j39]Hanno Lefmann:
Large triangles in the d-dimensional unit cube. Theor. Comput. Sci. 363(1): 85-98 (2006) - [c20]Hanno Lefmann:
Distributions of Points and Large Convex Hulls of k Points. AAIM 2006: 173-184 - 2005
- [j38]Hanno Lefmann:
Sparse Parity-Check Matrices over ${GF(q)}$. Comb. Probab. Comput. 14(1-2): 147-169 (2005) - [c19]Hanno Lefmann:
Distributions of Points in d Dimensions and Large k-Point Simplices. COCOON 2005: 514-523 - [c18]Hanno Lefmann:
Distributions of points in the unit-square and large k-gons. SODA 2005: 241-250 - 2004
- [c17]Hanno Lefmann:
Large Triangles in the d-Dimensional Unit-Cube. COCOON 2004: 43-52 - [c16]Hanno Lefmann:
Distributions of Points and Large Quadrangles. ISAAC 2004: 657-668 - 2003
- [j37]Hanno Lefmann:
On Heilbronn's Problem in Higher Dimension. Comb. 23(4): 669-680 (2003) - [c15]Hanno Lefmann:
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). COCOON 2003: 112-121 - 2002
- [j36]Hanno Lefmann, Niels Schmitt:
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions. SIAM J. Comput. 31(6): 1926-1947 (2002) - [c14]Hanno Lefmann, Niels Schmitt:
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. LATIN 2002: 165-180 - 2000
- [j35]Heiko Harborth, Hanno Lefmann:
Coloring arcs of convex sets. Discret. Math. 220(1-3): 107-117 (2000) - [j34]Claudia Bertram-Kretzberg, Hanno Lefmann:
MODp-tests, almost independence and small probability spaces. Random Struct. Algorithms 16(4): 293-313 (2000) - [j33]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
An Algorithm for Heilbronn's Problem. SIAM J. Comput. 30(2): 383-390 (2000) - [c13]Hanno Lefmann:
On Heilbronn's problem in higher dimension. SODA 2000: 60-64
1990 – 1999
- 1999
- [j32]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
Sparse 0-1-Matrices And Forbidden Hypergraphs. Comb. Probab. Comput. 8(5): 417-427 (1999) - [j31]Claudia Bertram-Kretzberg, Hanno Lefmann:
The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM J. Comput. 29(1): 201-230 (1999) - 1998
- [j30]Thomas Hofmeister, Hanno Lefmann:
On k-Partite Subgraphs. Ars Comb. 50 (1998) - [c12]Thomas Hofmeister, Hanno Lefmann:
Approximating Maximum Independent Sets in Uniform Hypergraphs. MFCS 1998: 562-570 - [c11]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract). SODA 1998: 181-187 - 1997
- [j29]Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Check Matrices. Des. Codes Cryptogr. 12(2): 107-130 (1997) - [j28]Hanno Lefmann, Petr Savický:
Some typical properties of large AND/OR Boolean formulas. Random Struct. Algorithms 10(3): 337-351 (1997) - [j27]Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann:
PAC-Learning from General Examples. Theor. Comput. Sci. 172(1-2): 43-65 (1997) - [c10]Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
An Algorithm for Heilbronn's Problem. COCOON 1997: 23-31 - [c9]Claudia Bertram-Kretzberg, Hanno Lefmann:
The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract). SODA 1997: 296-304 - [c8]Claudia Bertram-Kretzberg, Hanno Lefmann:
MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract). STACS 1997: 141-152 - 1996
- [j26]Arie Bialostocki, Hanno Lefmann, Terry Meerdink:
On the degree of regularity of some equations. Discret. Math. 150(1-3): 49-60 (1996) - [j25]Neil Hindman, Hanno Lefmann:
Canonical partition relations for (m, p, c)-systems. Discret. Math. 162(1-3): 151-174 (1996) - [j24]Thomas Hofmeister, Hanno Lefmann:
Independent Sets in Graphs with Triangles. Inf. Process. Lett. 58(5): 207-210 (1996) - [j23]Hanno Lefmann, Vojtech Rödl, Beata Wysocka:
Multicolored Subsets in Colored Hypergraphs. J. Comb. Theory A 74(2): 209-248 (1996) - [j22]Thomas Hofmeister, Hanno Lefmann:
A combinatorial design approach to MAXCUT. Random Struct. Algorithms 9(1-2): 163-175 (1996) - [c7]Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract). COCOON 1996: 41-49 - [c6]Claudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka:
Proper Bounded Edge-Colorings. DMTCS 1996: 121-130 - [c5]Thomas Hofmeister, Hanno Lefmann:
A Combinatorial Design Approach to MAXCUT. STACS 1996: 441-452 - 1995
- [j21]Hanno Lefmann, Vojtech Rödl:
On Erdös-Rado Numbers. Comb. 15(1): 85-104 (1995) - [j20]Walter A. Deuber, Neil Hindman, Imre Leader, Hanno Lefmann:
Infinite Partition Regular Matrices. Comb. 15(3): 333-355 (1995) - [j19]Hanno Lefmann, Torsten Thiele:
Point Sets with Distinct Distances. Comb. 15(3): 379-408 (1995) - [j18]Arie Bialostocki, Paul Erdös, Hanno Lefmann:
Monochromatic and zero-sum sets of nondecreasing diameter. Discret. Math. 137(1-3): 19-34 (1995) - [j17]Dwight Duffus, Hanno Lefmann, Vojtech Rödl:
Shift graphs and lower bounds on Ramsey numbers rk(l; r). Discret. Math. 137(1-3): 177-187 (1995) - [j16]Richard A. Duke, Hanno Lefmann, Vojtech Rödl:
On Uncrowded Hypergraphs. Random Struct. Algorithms 6(2/3): 209-212 (1995) - [j15]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) - [c4]Thomas Hofmeister, Hanno Lefmann:
Derandomization for Sparse Approximations and Independent Sets. MFCS 1995: 201-210 - [c3]Hanno Lefmann, Petr Savický:
Some Typical Properties of Large AND/OR Boolean Formulas. MFCS 1995: 237-246 - 1994
- [j14]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) - [j13]Vitaly Bergelson, Walter A. Deuber, Neil Hindman, Hanno Lefmann:
Rado's Theorem for Commutative Rings. J. Comb. Theory A 66(1): 68-92 (1994) - 1993
- [j12]Hanno Lefmann, Vojtech Rödl:
On Canonical Ramsey Numbers for Complete Graphs versus Paths. J. Comb. Theory B 58(1): 1-13 (1993) - [j11]Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl:
Rigid Linear Binary Codes. J. Comb. Theory A 63(1): 110-128 (1993) - [j10]Neil Hindman, Hanno Lefmann:
Partition Regularity of (M, P, C)-Systems. J. Comb. Theory A 64(1): 1-9 (1993) - [c2]Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak:
Approximations with Axis-Aligned Rectangles (Extended Abstract). FCT 1993: 244-255 - 1992
- [j9]Hanno Lefmann, Vojtech Rödl, Robin Thomas:
Monochromatic Vs multicolored paths. Graphs Comb. 8(4): 323-332 (1992) - [c1]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
- [j8]Hanno Lefmann:
Non t-intersecting families of linear spaces over GF(q). Discret. Math. 89(2): 173-183 (1991) - [j7]Hanno Lefmann:
On partition regular systems of equations. J. Comb. Theory A 58(1): 35-53 (1991) - 1990
- [j6]Hanno Lefmann:
On Families in Finite Lattices. Eur. J. Comb. 11(2): 165-179 (1990)
1980 – 1989
- 1989
- [j5]Hanno Lefmann:
An extremal problem for Graham-Rotschild parameter words. Comb. 9(2): 153-160 (1989) - [j4]Hanno Lefmann:
A note on monoton waves. J. Comb. Theory A 50(2): 316-318 (1989) - [j3]Hanno Lefmann, Bernd Voigt:
Partitions of Aomega. SIAM J. Discret. Math. 2(4): 524-529 (1989) - 1986
- [j2]Hanno Lefmann:
A canonical version for partition regular systems of linear equations. J. Comb. Theory A 41(1): 95-104 (1986) - 1984
- [j1]Hanno Lefmann, Bernd Voigt:
A remark on infinite arithmetic progressions. Discret. Math. 52(2-3): 285-286 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
