default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOliver Janzer
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Oliver Janzer, Benny Sudakov, István Tomon:
Small Subgraphs with Large Average Degree. Comb. 44(4): 785-800 (2024)- [j12]Oliver Janzer, Cosmin Pohoata:
On the Zarankiewicz Problem for Graphs with Bounded VC-Dimension. Comb. 44(4): 839-848 (2024) - [j11]Barnabás Janzer, Oliver Janzer
:
On locally rainbow colourings. J. Comb. Theory B 169: 134-149 (2024) - [j10]Csongor Beke, Oliver Janzer:
On the Generalized Turán Problem for Odd Cycles. SIAM J. Discret. Math. 38(3): 2416-2428 (2024) - [i2]Oliver Janzer, Peter Manohar:
A kq/q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. CoRR abs/2411.14276 (2024) - [i1]Oliver Janzer, Peter Manohar:
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j9]Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov:
Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. 43(3): 429-446 (2023) - [c1]Oliver Janzer, Benny Sudakov, István Tomon:
Small subgraphs with large average degree. SODA 2023: 2345-2353 - 2022
- [j8]Oliver Janzer, Zoltán Lóránt Nagy:
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz. Des. Codes Cryptogr. 90(9): 1991-2001 (2022) - [j7]Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy:
The Turán number of blow-ups of trees. J. Comb. Theory B 156: 299-309 (2022) - [j6]Debarun Ghosh, Ervin Györi, Oliver Janzer, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum number of induced C 5 's in a planar graph. J. Graph Theory 99(3): 378-398 (2022) - [j5]Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy:
On the Turán Number of the Blow-Up of the Hexagon. SIAM J. Discret. Math. 36(2): 1187-1199 (2022) - 2021
- [j4]David Conlon, Joonkyung Lee, Oliver Janzer:
More on the Extremal Number of Subdivisions. Comb. 41(4): 465-494 (2021) - 2020
- [j3]Oliver Janzer:
The Extremal Number of the Subdivisions of the Complete Bipartite Graph. SIAM J. Discret. Math. 34(1): 241-250 (2020)
2010 – 2019
- 2019
- [j2]Oliver Janzer:
Improved Bounds for the Extremal Number of Subdivisions. Electron. J. Comb. 26(3): 3 (2019) - [j1]Timothy Gowers, Oliver Janzer:
Subsets of Cayley Graphs that Induce Many Edges. Theory Comput. 15: 1-29 (2019)
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 2025-01-09 13:20 CET 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:
