Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Mészáros 0001
Person information
- affiliation: Free University of Berlin, Germany
- affiliation (2015 - 2016): Budapest University of Technology and Economics, Department of Algebra, Hungary
- affiliation (PhD 2015): Central European University, Budapest, Hungary
Other persons with the same name
- Tamás Mészáros — disambiguation page
- Tamás Mészáros 0002 — Corvinus University of Budapest, Department of Strategy and Project Management, Hungary
- Tamás Mészáros 0003
![[0000-0001-9516-3053]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9516-3053")
— Budapest University of Technology and Economics, Department of Measurement and Information Systems, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Tamás Mészáros:
Subspace coverings with multiplicities. Comb. Probab. Comput. 32(5): 782-795 (2023)- 2022
- [j12]Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer:
Generalized Rainbow Turán Numbers. Electron. J. Comb. 29(2) (2022) - [j11]Tamás Mészáros, Raphael Steiner:
Complete directed minors and chromatic number. J. Graph Theory 101(4): 623-632 (2022) - 2021
- [j10]Tamás Mészáros, Raphael Steiner:
Zero sum cycles in complete digraphs. Eur. J. Comb. 98: 103399 (2021) - 2020
- [j9]Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean Dimension and Tree-Width. Comb. 40(5): 655-677 (2020) - [j8]Christopher Kusch, Tamás Mészáros:
Shattering-extremal set systems from Sperner families. Discret. Appl. Math. 276: 92-101 (2020) - [j7]Tamás Mészáros:
Standard monomials and extremal point sets. Discret. Math. 343(4): 111785 (2020) - [j6]Tamás Mészáros, Piotr Micek, William T. Trotter:
Boolean Dimension, Components and Blocks. Order 37(2): 287-298 (2020) - [j5]David Conlon, Shagnik Das, Joonkyung Lee, Tamás Mészáros:
Ramsey games near the critical threshold. Random Struct. Algorithms 57(4): 940-957 (2020) - [c2]Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman:
Greedy Maximal Independent Sets via Local Limits. AofA 2020: 20:1-20:19
2010 – 2019
- 2019
- [j4]Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter:
Separating tree-chromatic number from path-chromatic number. J. Comb. Theory, Ser. B 138: 206-218 (2019) - 2018
- [j3]József Balogh, Tamás Mészáros, Zsolt Adam Wagner:
Two results about the hypercube. Discret. Appl. Math. 247: 322-326 (2018) - 2017
- [j2]Tamás Mészáros, Lajos Rónyai:
Standard Monomials and Extremal Vector Systems. Electron. Notes Discret. Math. 61: 855-861 (2017) - [i2]Shagnik Das, Tamás Mészáros:
A Semi-Random Construction of Small Covering Arrays. CoRR abs/1703.05252 (2017) - [i1]Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean dimension and tree-width. CoRR abs/1707.06114 (2017) - 2014
- [j1]Tamás Mészáros, Lajos Rónyai:
Shattering-Extremal Set Systems of VC Dimension at most 2. Electron. J. Comb. 21(4): 4 (2014) - 2011
- [c1]Lajos Rónyai, Tamás Mészáros:
Some Combinatorial Applications of Gröbner Bases. CAI 2011: 65-83
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-04-29 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:
