default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanno Lefmann
- > Home > Persons > Hanno Lefmann
Publications
- 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)- 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) - 2019
- [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) - 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) - [i1]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. CoRR abs/1707.08225 (2017) - 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) - 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) - 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) - 2009
- [j44]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34: 219-223 (2009)
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:
