default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZsolt Adam Wagner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]József Balogh, Ramon Garcia, Lina Li
, Adam Zsolt Wagner:
Intersecting families of sets are typically trivial. J. Comb. Theory B 164: 44-67 (2024)- [c1]Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner:
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. IJCAI 2024: 6985-6993 - 2023
- [j17]Felix Christian Clemen, Adam Zsolt Wagner:
Balanced Edge-Colorings Avoiding Rainbow Cliques of Size Four. Electron. J. Comb. 30(3) (2023) - [i4]Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner:
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. CoRR abs/2311.03583 (2023) - 2022
- [j16]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Infinite Sperner's theorem. J. Comb. Theory A 187: 105558 (2022) - [j15]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Uniform chain decompositions and applications. Random Struct. Algorithms 60(2): 261-286 (2022) - 2021
- [i3]Adam Zsolt Wagner:
Constructions in combinatorics via neural networks. CoRR abs/2104.14516 (2021) - 2020
- [j14]József Balogh, Felix Christian Clemen, Jozef Skokan, Adam Zsolt Wagner:
The Ramsey Number of Fano Plane Versus Tight Path. Electron. J. Comb. 27(1): 1 (2020) - [j13]Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner:
Bounded Degree Spanners of the Hypercube. Electron. J. Comb. 27(3): 3 (2020) - [j12]Adam Zsolt Wagner:
Refuting conjectures in extremal combinatorics via linear programming. J. Comb. Theory A 169 (2020) - [j11]Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner:
Completion and deficiency problems. J. Comb. Theory B 145: 214-240 (2020) - [j10]József Balogh, Sárka Petrícková, Adam Zsolt Wagner:
Families in posets minimizing the number of comparable pairs. J. Graph Theory 95(4): 655-676 (2020)
2010 – 2019
- 2019
- [j9]József Balogh, Mikhail Lavrov, George Shakan, Adam Zsolt Wagner:
Monochromatic Hilbert Cubes and Arithmetic Progressions. Electron. J. Comb. 26(2): 2 (2019) - [j8]József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28(2): 159-176 (2019) - [j7]Cory Palmer, Michael Tait, Craig Timmons, Zsolt Adam Wagner:
Turán numbers for Berge-hypergraphs and related extremal problems. Discret. Math. 342(6): 1553-1563 (2019) - [j6]Jason Long, Adam Zsolt Wagner:
The largest projective cube-free subsets of Z2n. Eur. J. Comb. 81: 156-171 (2019) - [j5]Matija Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner:
Partition problems in high dimensional boxes. J. Comb. Theory A 166: 315-336 (2019) - [i2]Zsolt Adam Wagner:
Refuting conjectures in extremal combinatorics via linear programming. CoRR abs/1903.05495 (2019) - 2018
- [j4]József Balogh, Tamás Mészáros, Zsolt Adam Wagner:
Two results about the hypercube. Discret. Appl. Math. 247: 322-326 (2018) - 2017
- [j3]Zsolt Adam Wagner:
Large Subgraphs in Rainbow-Triangle Free Colorings. J. Graph Theory 86(2): 141-148 (2017) - 2016
- [j2]József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Applications of graph containers in the Boolean lattice. Random Struct. Algorithms 49(4): 845-872 (2016) - 2015
- [j1]Zsolt Adam Wagner:
Cops and Robbers on diameter two graphs. Discret. Math. 338(3): 107-109 (2015) - 2013
- [i1]Zsolt Adam Wagner:
An improved bound on the cop number of graphs of small diameter. CoRR abs/1312.7555 (2013)
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-10-21 21:31 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:
